On the subspace projected approximate matrix method.

DOI10.1007/s10492-015-0104-8zbMath1363.65048arXiv1103.1779OpenAlexW77078096MaRDI QIDQ499032

Ricardo Reis da Silva, Jan H. Brandts

Publication date: 29 September 2015

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.1779

zbMATH Keywords

eigenvaluesnumerical experimentsLanczos methodJacobi-Davidson methodHermitian eigenproblemRitz-Galerkin approximationsubspace projected approximate matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Uses Software

• eigs
• JDQR
• JDQZ
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing eigenvalue bounds for iterative subspace matrix methods
• Norms and exclusion theorems
• Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
• Finite element methods (Part 1)
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Harmonic Ritz and Lehmann bounds
• Eigenvalue computation in the 20th century
• On the use of harmonic Ritz pairs in approximating internal eigenpairs
• The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
• An analysis of the Rayleigh--Ritz method for approximating eigenspaces
• Matrix Algorithms
• Alternative correction equations in the Jacobi-Davidson method
• A Krylov--Schur Algorithm for Large Eigenproblems
• Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Solution of Sparse Indefinite Systems of Linear Equations
• The Davidson Method
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• Templates for the Solution of Algebraic Eigenvalue Problems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Subspace-Projected Approximate Matrix Method for Systems of Linear Equations
• The subspace projected approximate matrix (SPAM) modification of the Davidson method

This page was built for publication: On the subspace projected approximate matrix method.