Further Analysis of the Arnoldi Process for Eigenvalue Problems

DOI10.1137/070711487zbMath1210.65085OpenAlexW2018896957MaRDI 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

zbMATH Keywords

GMRESSchur factorizationKrylov subspaces methodgeneralized minimal residual iterationsnon-Hermitian eigenvalue problemsArnoldi's methodsconvergence analysis method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items (8)

The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems ⋮ Accelerating the Sinkhorn-Knopp iteration by Arnoldi-type methods ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems ⋮ On the generation of Krylov subspace bases ⋮ The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output ⋮ Preconditioning linear systems via matrix function evaluation ⋮ An Arnoldi-extrapolation algorithm for computing pagerank

Uses Software

• ARPACK

This page was built for publication: Further Analysis of the Arnoldi Process for Eigenvalue Problems