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

DOI10.1006/JCPH.2001.6828MaRDI QIDQ5948922zbMATH OpenOpenAlexFDO

Authors Ron Shepard, Albert F. Wagner, Jeffrey L. Tilson, 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)

Recommendations

• On the subspace projected approximate matrix method.
• Is Jacobi--Davidson Faster than Davidson?
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• A new method for diagonalising large matrices
• A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix

Cites work

• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
• Computing eigenvalues of very large symmetric matrices. An implementation of a Lanczos algorithm with no reorthogonalization
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Super-matrix methods
• The Davidson Method
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• The iterative calculation of several of the lowest or highest eigenvalues and corresponding eigenvectors of very large symmetric matrices

Cited in

(4)

• A new method for diagonalising large matrices
• On the subspace projected approximate matrix method.
• Large-Scale Scientific Computing
• Computing eigenvalue bounds for iterative subspace matrix methods

Describes a project that uses

Uses Software

• JDQZ
• Harwell-Boeing sparse matrix collection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948922)