Further Analysis of the Arnoldi Process for Eigenvalue Problems
From MaRDI portal
Publication:3084193
DOI10.1137/070711487zbMath1210.65085MaRDI QIDQ3084193
Yousef Saad, Hassane Sadok, Mohammed Bellalij
Publication date: 15 March 2011
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070711487
GMRES; Schur factorization; Krylov subspaces method; generalized minimal residual iterations; non-Hermitian eigenvalue problems; Arnoldi's methods; convergence analysis method
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65F10: Iterative numerical methods for linear systems
Related Items
The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output, The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems, Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem, On the generation of Krylov subspace bases, An Arnoldi-extrapolation algorithm for computing pagerank, Preconditioning linear systems via matrix function evaluation, Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods, A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems
Uses Software