Abstract
This paper discusses two Fortran subroutines, LANSYM and LANUSM, for computing eigenvalues of real sparse matrices on the CM-200. These subroutines are designed for symmetric and unsymmetric matrices, respectively. Both are adaptations of single-vector Lanczos algorithms developed by Cullum and Willoughby. The eigenvalues are computed in a region prescribed by the user. In the case of LANSYM, this is a real interval [a,b]. In the case of LANUSM, it is a quadrilateral, Q, in the complex plane. The main attractions of the Cullum and Willoughby approach are the absence of both the reorthogonalization of the Lanczos vectors and factorizations of the (shifted) input matrix.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
CMSSL (1992). CMSSL Release Notes for the CM-200, Version 3.0, Thinking Machines Corporation, Cambridge, Mass.
Cullum, J. K. and Willoughby, R. A. (1985a). Lanczos Algorithms tor Large Symmetric Eigenvalue Computations; Vol. 1, Theory. Birkhauser, Boston.
Cullum, J. K. and Willoughby, R. A. (1985b). Lanczos Algorithms for Large Symmetric Eigenvalue Computations; Vol. 2, Codes. Birkhauser, Boston.
Cullum, J. K. and Willoughby, R. A. (1986). A practical procedure for computing eigenvalues of large sparse nonsymmetric matrices. In Large Scale Eigenvalue Problems, eds. J. K. Cullum and W. A. Willoughby, North-Holland, Amsterdam, pp. 193–240.
Eispack (1976, 1977). Matrix Eigensystem Routines, eds. B. S. Garbow, J. M. Boyle, J. J. Dongarra and C. B. Moler. Lecture Notes in Mathematics, 6 and 51, Springer, New York.
Paige, C. C. (1971). The computation of eigenvalues and eigenvectors of very large sparse matrices. Ph. D. Thesis, University of London.
Paige, C. C. (1972). Computational variants of the Lanczos method for the eigenproblem. J. Inst. Math. Appl.,10, 373–381.
Paige, C. C. (1976). Error analysis of the Lanczos algorithms for tridiagonalizing a symmetric matrix. J. Inst. Math. Appl.,18, 341–349.
Paige, C. C. (1980). Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem. Linear Algebra Appl., 34, 235–258.
Parlett, B. N. (1980). The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barker, V.A., Yingqun, C. (1994). Computing eigenvalues of sparse matrices on the connection machine. In: Dongarra, J., Waśniewski, J. (eds) Parallel Scientific Computing. PARA 1994. Lecture Notes in Computer Science, vol 879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030135
Download citation
DOI: https://doi.org/10.1007/BFb0030135
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58712-5
Online ISBN: 978-3-540-49050-0
eBook Packages: Springer Book Archive