The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems

DOI10.1016/J.LAA.2016.04.018zbMATH Open1338.65097OpenAlexW2341107015MaRDI QIDQ286164FDOQ286164

Authors Hassane Sadok, M. Bellalij, G. Meurant

Publication date 20 May 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2016.04.018

zbMATH Keywords

eigenvalueseigenvectorsKrylov subspacenormal matricesArnoldi methoddiagonalizable matricesRitz values

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 697769
• Convergence of Restarted Krylov Subspaces to Invariant Subspaces
• Convergence of Polynomial Restart Krylov Methods for Eigenvalue Computations
• Convergence analysis of restarted Krylov subspace eigensolvers
• Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization

Cites work

• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3789762 (Why is no real title available?)
• An analogue of the results of Saad and Stewart for harmonic Ritz vectors
• Composite orthogonal projection methods for large matrix eigenproblems
• Further analysis of the Arnoldi process for eigenvalue problems
• New convergence results on the global GMRES method for diagonalizable matrices
• Numerical methods for large eigenvalue problems
• On investigating GMRES convergence using unitary matrices
• On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
• Some theoretical comparisons of refined Ritz vectors and Ritz vectors
• The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
• The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• The role eigenvalues play in forming GMRES residual norms with non-normal matrices
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices

Cited in

(2)

• Varying the \(s\) in your \(s\)-step GMRES
• scientific article; zbMATH DE number 697769 (Why is no real title available?)

This page was built for publication: The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems

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