Roundoff error analysis of algorithms based on Krylov subspace methods

DOI10.1007/BF01731978zbMath0848.65019MaRDI QIDQ1914862

Mario Arioli, Claudia Fassino

Publication date: 9 June 1996

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

algorithmlarge sparse linear systemorthonormal basisGMRES algorithmKrylov subspacefull orthogonalization methodroundoff error propagationHouseholder orthonormal matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

Backward error analysis of the shift-and-invert Arnoldi algorithm ⋮ Numerical behaviour of the modified Gram-Schmidt GMRES implementation ⋮ A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems ⋮ The influence of orthogonality on the Arnoldi method ⋮ Theoretical and numerical comparisons of GMRES and WZ-GMRES

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