An iterative method for calculating several of the extreme eigensolutions of large real non-symmetric matrices
- 31 January 1982
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 45 (1) , 100-107
- https://doi.org/10.1016/0021-9991(82)90104-8
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Comments on the Kalamboukis tests of the Davidson algorithmJournal of Physics A: General Physics, 1980
- Equations‐of‐motion method: Calculation of the k lowest or highest solutionsInternational Journal of Quantum Chemistry, 1979
- A simultaneous coordinate relaxation algorithm for large, sparce matrix eigenvalue problemsJournal of Computational Physics, 1979
- The use of biorthogonal sets in valence bond calculationsChemical Physics Letters, 1975
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matricesJournal of Computational Physics, 1975
- The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matricesJournal of Computational Physics, 1973
- Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matricesJournal of Computational Physics, 1972
- Time‐dependent Hartree–Fock calculations in the Pariser–Parr–Pople model. Applications to aniline, azulene and pyridineInternational Journal of Quantum Chemistry, 1970
- An iterative procedure for the calculation of the lowest real eigenvalue and eigenvector of a nonsymmetric matrixJournal of Computational Physics, 1970
- Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matricesJournal of Computational Physics, 1970