A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- 1 April 1994
- journal article
- Published by Elsevier in Computer Physics Communications
- Vol. 79 (2), 268-290
- https://doi.org/10.1016/0010-4655(94)90073-6
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A configuration interaction programComputer Physics Communications, 1991
- The MCHF atomic-structure packageComputer Physics Communications, 1991
- Multitasking the Davidson Algorithm for the Large, Sparse Eigenvalue ProblemThe International Journal of Supercomputing Applications, 1989
- Super-matrix methodsComputer Physics Communications, 1989
- Benchmark full configuration-interaction calculations on H2O, F, and F−The Journal of Chemical Physics, 1986
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric MatricesSIAM Journal on Scientific and Statistical Computing, 1986
- The Software Scene in the Extraction of Eigenvalues from Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1984
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975
- Computational Variants of the Lanczos Method for the EigenproblemIMA Journal of Applied Mathematics, 1972
- 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