Roundoff error analysis of algorithms based on Krylov subspace methods
From MaRDI portal
Publication:1914862
DOI10.1007/BF01731978zbMath0848.65019MaRDI QIDQ1914862
Publication date: 9 June 1996
Published in: BIT (Search for Journal in Brave)
algorithm; large sparse linear system; orthonormal basis; GMRES algorithm; Krylov subspace; full orthogonalization method; roundoff error propagation; Householder orthonormal matrices
65F10: Iterative numerical methods for linear systems
Related Items
Numerical behaviour of the modified Gram-Schmidt GMRES implementation, Theoretical and numerical comparisons of GMRES and WZ-GMRES, The influence of orthogonality on the Arnoldi method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Numerical stability of GMRES
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Implementation of the GMRES Method Using Householder Transformations
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
