Computing eigenvalues of very large symmetric matrices—An implementation of a Lanczos algorithm with no reorthogonalization
- 1 December 1981
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 44 (2) , 329-358
- https://doi.org/10.1016/0021-9991(81)90056-5
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblemLinear Algebra and its Applications, 1980
- Use of the Lanczos Method for Finding Complete Sets of Eigenvalues of Large Sparse Symmetric MatricesIMA Journal of Applied Mathematics, 1979
- The Lanczos algorithm with selective orthogonalizationMathematics of Computation, 1979
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric MatrixIMA Journal of Applied Mathematics, 1976
- 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 several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matricesJournal of Computational Physics, 1973
- Computational Variants of the Lanczos Method for the EigenproblemIMA Journal of Applied Mathematics, 1972
- Computational aspects of F. L. Bauer's simultaneous iteration methodNumerische Mathematik, 1969
- Solution of systems of linear equations by minimized iterationsJournal of Research of the National Bureau of Standards, 1952
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJournal of Research of the National Bureau of Standards, 1950