Analysis of the convergence of the minimal and the orthogonal residual methods

DOI10.1007/s11075-005-1533-3zbMath1086.65031OpenAlexW2057359548MaRDI QIDQ2583224

Hassane Sadok

Publication date: 13 January 2006

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-005-1533-3

zbMATH Keywords

convergenceGMRESKrylov subspace methodsminimal and orthogonal residual methodsRitz singular values

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

On block minimal residual methods, A Computational Method for Symmetric Stein Matrix Equations, FOM accelerated by an extrapolation method for solving PageRank problems, GMRES algorithms over 35 years, On investigating GMRES convergence using unitary matrices, On the choice of preconditioner for minimum residual methods for non-Hermitian matrices, New conditions for non-stagnation of minimal residual methods, New convergence results on the global GMRES method for diagonalizable matrices, Some properties of range restricted GMRES methods, New results on the convergence of the conjugate gradient method, Convergence properties of some block Krylov subspace methods for multiple linear systems, The role eigenvalues play in forming GMRES residual norms with non-normal matrices, Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rate of convergence of conjugate gradients
• Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
• The superlinear convergence behaviour of GMRES
• Analysis of some vector extrapolation methods for solving systems of linear equations
• Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• How Fast are Nonsymmetric Matrix Iterations?
• Solution of Sparse Indefinite Systems of Linear Equations
• The Arnoldi Method for Normal Matrices
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• Methods of conjugate gradients for solving linear systems