A matrix analysis of Arnoldi and Lanczos methods
From MaRDI portal
The author presents a matrix analysis of the Arnoldi and Lanczos methods for approximating eigenpairs of a non-normal matrix. A new relation between the matrix representation of the two methods is defined to relate the corresponding eigenvalues and eigenvectors. Finally, backward error analysis is used to theoretically justify some unexpected experimental behaviour of non-normal matrices and in particular of banded Toeplitz matrices.
Recommendations
Cited in
(8)- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
- Arnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problems
- The effect of non-optimal bases on the convergence of Krylov subspace methods
- New matrix function approximations and quadrature rules based on the Arnoldi process
- A low cost Arnoldi method for large linear initial value problems
- scientific article; zbMATH DE number 4215273 (Why is no real title available?)
- The Arnoldi Method for Normal Matrices
- Adaptation of the Lanczos and Arnoldi methods to the spectrum, or why the two Krylov subspace methods are powerful
This page was built for publication: A matrix analysis of Arnoldi and Lanczos methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279839)