Analysis of the convergence of the minimal and the orthogonal residual methods
From MaRDI portal
Publication:2583224
Two Krylov subspace methods, the minimal and orthogonal residual methods, are studied for solving linear systems. By using the Petrov-Galerkin condition, the residual norms of these methods are described in terms of the Krylov vectors, and the relationship between these norms is examined. The author proves that the convergence of these two methods is governed by the convergence of the Ritz singular values.
Recommendations
- On the convergence of Krylov linear equation solvers
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- By how much can residual minimization accelerate the convergence of orthogonal residual methods?
- Residual and backward error bounds in minimum residual Krylov subspace methods
- Convergence properties of some block Krylov subspace methods for multiple linear systems
Cites work
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Analysis of some vector extrapolation methods for solving systems of linear equations
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 85892 (Why is no real title available?)
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- The Arnoldi Method for Normal Matrices
- The rate of convergence of conjugate gradients
- The superlinear convergence behaviour of GMRES
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(23)- Minimal residual-like condition with collinearity for shifted Krylov subspace methods
- On block minimal residual methods
- On investigating GMRES convergence using unitary matrices
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- 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
- GMRES algorithms over 35 years
- A computational method for symmetric Stein matrix equations
- New results on the convergence of the conjugate gradient method
- On the residual norm in FOM and GMRES
- Residual-Minimizing Krylov Subspace Methods for Stabilized Discretizations of Convection-Diffusion Equations
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Some properties of range restricted GMRES methods
- Analysis of the Minimal Residual Method Applied to Ill Posed Optimality Systems
- By how much can residual minimization accelerate the convergence of orthogonal residual methods?
- A unified approach to Krylov subspace methods for solving linear systems
- Constraints on admissible behavior of GMRES applied to tridiagonal Toeplitz systems
- Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
- Analysis of some Krylov subspace methods for normal matrices via approximation theory and convex optimization
- FOM accelerated by an extrapolation method for solving PageRank problems
- New conditions for non-stagnation of minimal residual methods
- New convergence results on the global GMRES method for diagonalizable matrices
This page was built for publication: Analysis of the convergence of the minimal and the orthogonal residual methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583224)
