Optimal expansion of subspaces for eigenvector approximations
From MaRDI portal
Publication:2469518
DOI10.1016/j.laa.2007.08.021zbMath1142.65039OpenAlexW2009440392MaRDI QIDQ2469518
Publication date: 6 February 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.08.021
Related Items (4)
Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems ⋮ Tensor-Krylov method for computing eigenvalues of parameter-dependent matrices ⋮ On expansion of search subspaces for large non-Hermitian eigenproblems ⋮ Behavior of the correction equations in the Jacobi-Davidson method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computing interior eigenvalues of large matrices
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Templates for the Solution of Algebraic Eigenvalue Problems
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
This page was built for publication: Optimal expansion of subspaces for eigenvector approximations