Generalizations of davidson's method for computing eigenvalues of large nonsymmetric matrices
- 31 August 1992
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 101 (2) , 287-291
- https://doi.org/10.1016/0021-9991(92)90006-k
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Computing interior eigenvalues of large matricesLinear Algebra and its Applications, 1991
- Davidson's method and preconditioning for generalized eigenvalue problemsJournal of Computational Physics, 1990
- Super-matrix methodsComputer Physics Communications, 1989
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976SIAM Review, 1989
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric MatricesSIAM Journal on Scientific and Statistical Computing, 1986
- Block Preconditioning for the Conjugate Gradient MethodSIAM Journal on Scientific and Statistical Computing, 1985
- Lanczos versus subspace iteration for solution of eigenvalue problemsInternational Journal for Numerical Methods in Engineering, 1983
- The Advantages of Inverted Operators in Rayleigh–Ritz ApproximationsSIAM Journal on Scientific and Statistical Computing, 1982
- Modification of Davidson's method for the calculation of eigenvalues and eigenvectors of large real-symmetric matrices: “root homing procedure”Journal of Computational Physics, 1976
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975