Error Analysis of Krylov Methods In a Nutshell
From MaRDI portal
Publication:4389266
DOI10.1137/S1064827595290450zbMath0914.65024MaRDI QIDQ4389266
Christian Lubich, Marlis Hochbruck
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Lanczos method; error bounds; iterative methods; Krylov subspace methods; Arnoldi method; residual bound; conjugate-gradient-type methods
65F10: Iterative numerical methods for linear systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On semiiterative methods generated by Faber polynomials
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- An analysis of the composite step biconjugate gradient method
- Minimization properties and short recurrences for Krylov subspace methods
- Matrix-free \(W\)-methods using a multiple Arnoldi iteration
- Convergence of Krylov methods for sums of two operators
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem