Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- 31 December 1992
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 103 (2) , 382-389
- https://doi.org/10.1016/0021-9991(92)90409-r
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A space‐saving modification of Davidson's eigenvector algorithmJournal of Computational Chemistry, 1990
- Passing the one-billion limit in full configuration-interaction (FCI) calculationsChemical Physics Letters, 1990
- Super-matrix methodsComputer Physics Communications, 1989
- Quasidegenerate variational perturbation theory and the calculation of first-order properties from variational perturbation theory wave functionsThe Journal of Chemical Physics, 1988
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric MatricesSIAM Journal on Scientific and Statistical Computing, 1986
- 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
- A new method for large-scale Cl calculationsChemical Physics Letters, 1972
- Methods of conjugate gradients for solving linear systemsJournal 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