Abstract
The computation of a few eigenvalues and their corresponding eigenvectors of large, usually sparse, real symmetric matrices is often required in the determination of the solution of many of the important problems encountered in scientific and engineering applications. A common characteristic of two distinct classes of iterative methods for the computation of such eigenvalues and eigenvectors is the construction of a sequence of subspaces which contains, in the limit, the desired eigenvectors. In this paper two algorithms, one from each class, for the parallel computation of a few extreme eigenvalues and their associated eigenvectors of large symmetric matrices are discussed. The first algorithm is a simultaneous iteration method in which the subspaces are of a constant dimension; the second is the Lanczos algorithm in which the subspaces increase in dimension. Modified versions of each of the algorithms are proposed and implemented on an MPP Connection Machine CM-200 with 8K processors. A comparative evaluation of the efficiency of the most efficient version of each of the two algorithms for a variety of different types of matrices of maximum order 11,948 is also presented.
This work was supported by the Engineering and Physical Sciences Research Council under grants GR/J41857 and GR/J41864 and was carried out using the facilities of the University of Edinburgh Parallel Computing Centre
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Clint, M., and Jennings A., The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration, Comput. J., (1970) 76–80.
Duff, I.S., Grimes, R.G., and Lewis, J.G., User's Guide for the Harwell-Boeing Sparse Matrix Collection (release I), available online ftp orion.cerfacs.fr, (1992).
Golub, G, and Van Loan C.F., Matrix Computations, John Hopkins University Press, London, (1989).
Kim, S.K, and A.T. Chronopoulos, A class of Lanczos-like algorithms implemented on parallel computers, Parallel Computing, 17 (1991) 763–778.
Murphy, K., Clint, M., Szularz, M., and Weston, J.S., The Computation of Partial Eigensolutions on a Distributed Memory Machine Using a Modified Lanczos Method, Proceedings Euro-Par'96, (1996).
Stuart, E.J., and Weston J.S., An Algorithm for the Parallel Computation of Subsets of Eigenvalues and Associated Eigenvectors of Large Symmetric Matrices using an Array Processor, in Proceedings Euromicro Workshop on Parallel and Distributed Processing, 27–29 January, 1993, Milligan, P., and A. Nunez (Eds.), IEEE Computer Society Press (1992), 211–217.
Szularz, M., Weston, J., Murphy, K., and Clint M., Monitoring the Convergence of the Lanczos Algorithm in Parallel Computing Environments, Parallel Algorithms and Applications, Vol. 6, (1995), 287–302.
Szularz M., Weston J., Murphy K. and Clint M., An Improved Lanczos Algorithm, Abstracts: ParCo 95, Gent, Belgium, 19–22 September 1995, p.113.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weston, J., Szularz, M., Clint, M., Murphy, K. (1996). The parallel computation of partial eigensolutions of large matrices on a massively parallel processor. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024681
Download citation
DOI: https://doi.org/10.1007/BFb0024681
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive