The subspace projected approximate matrix (SPAM) modification of the Davidson method

DOI10.1006/jcph.2001.6828zbMath0986.65027OpenAlexW2015162888MaRDI QIDQ5948922

Jeffrey L. Tilson, Ron Shepard, Albert F. Wagner, Michael Minkoff

Publication date: 12 November 2001

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/65eed0848f94c08ecefb2ff2afd5ea7ac5b089ae

zbMATH Keywords

convergenceeigenvectoriterative matrix diagonalization methodsubspace projectionssymmetric eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

On the subspace projected approximate matrix method. ⋮ Computing eigenvalue bounds for iterative subspace matrix methods

Uses Software

• JDQZ
• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item
• Unnamed Item
• Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization
• Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Super-matrix methods
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
• The Davidson Method
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems

This page was built for publication: The subspace projected approximate matrix (SPAM) modification of the Davidson method