The Subspace Projected Approximate Matrix (SPAM) modification of the Davidson method

Journal of Computational Physics

Volumn 172, Issue 2, 2001, Pages 472-514

  Shepard, Ron ^a   Wagner, Albert F ^a   Tilson, Jeffrey L ^a   Minkoff, Michael ^a  

^a ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Chemistry; Davidson; Eigenvalue; Eigenvector; Iterative; Matrix; Projection; Ritz; Subspace; Symmetric; Tensor

Indexed keywords

ITERATIVE METHODS; VECTORS;

DAVIDSON; DAVIDSON METHOD; EIGEN-VALUE; ITERATIVE; MATRIX; MATRIX MODIFICATION; PROJECTION; RITZ; SUBSPACE; SYMMETRICS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0035922240     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.2001.6828     Document Type: Article

References (31)

1. The Iterative Calculation of a Few of the Lowest Eigenvalues and Corresponding Eigenvectors of Large Real Symmetric Matrices
2. Super-Matrix Methods
3. Monster Matrices: Their Eigenvalues and Eigenvectors
4. The Davidson Method
5. Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
6. The Iterative Calculation of Several of the Lowest or Highest Eigenvalues and Corresponding Eigenvectors of Very Large Symmetric Matrices
7. A Progress Report on the Status of the COLUMBUS MRCI Program System
8. High-Level Multireference Methods in the Quantum-Chemistry Program System COLUMBUS: Analytic MR-CISD and MR-AQCC Gradients and MR-AQCC-LRT for Excited States, GUGA Spin-Orbit CI, and Parallel CI
9. Elimination of the Diagonalization Bottleneck in Parallel Direct-SCF Calculations
10. High-Performance Computational Chemistry: Hartree-Fock Electronic Structure Calculations on Massively Parallel Processors
11. Approaches to Large-Scale Parallel Self-Consistent Field Calculations
12. Semiclassical Limit of Quantum Mechanical Transition State Theory for Nonseparable Systems
13. The Cumulative Reaction Probability as Eigenvalue Problem
14. 2O Reaction: Full-Dimensional Results and Comparison to Reduced Dimensionality Models
15. Computing Eigenvalues of Very Large Symmetric Matrices-An Implementation of a Lanczos Algorithm with No Reorthogonalization
16. A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
17. A Space-Saving Modification of Davidson’s Eigenvector Algorithm
18. Improved Algorithms for the Lowest Few Eigenvalues and Associated Eigenvectors of Large Matrices
19. Passing the One-Billion Limit in Full Configuration-Interaction (FCI) Calculations
20. Jacobi-Davidson Type Methods for Generalized Eigenproblems and Polynomial Eigenproblems
21. A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems
22. An Improvement of Davidson’s Iteration Method: Applications to MRCI and MRCEPA Calculations