Using successive approximations for improving the convergence of GMRES method
A possibility how to improve the convergence of the GMRES method for the iterative solution of the system \((I-T)x=b\) of linear algebraic equations with a nonsymmetric matrix is suggested. It consists in performing \(m\) pre-iterations of the form \(y_{l+1}=Ty_l+b\) before starting GMRES and in putting \(y_m\) as the initial approximation for GMRES. From the practical point of view, such pre-processing seems to be advantageous since one iteration of the pre-processing process costs less work that one of GMRES. Numerical tests confirm this hypothesis and the theory presented in the paper explains this observations.
- A generalized conjugate gradient, least square method
- Acceleration of Convergence of Vector Sequences
- Combining the preconditioned conjugate gradient method and a matrix iterative method
- Convergence and Stability Properties of Minimal Polynomial and Reduced Rank Extrapolation Algorithms
- Convergence of extrapolation coefficients
- Extrapolation methods theory and practice
- Extrapolation vs. projection methods for linear systems of equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 45286 (Why is no real title available?)
- scientific article; zbMATH DE number 53168 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 1056988 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Improving the convergence of GMRES using preconditioning and pre-iterations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- Sequence transformations and their applications
- The superlinear convergence behaviour of GMRES
- Three Methods of Solving Prandtl's Equation
- A comparison of some GMRES-like methods
- Theoretical and numerical comparisons of GMRES and WZ-GMRES
- Usage of the convergence test of the residual norm in the Tsuno-Nodera version of the GMRES algorithm
- Convergence conditions for a restarted GMRES method augmented with eigenspaces
- On the progressive iteration approximation property and alternative iterations
- An Efficient Variant of the GMRES(m) Method Based on the Error Equations
- scientific article; zbMATH DE number 3223142 (Why is no real title available?)
This page was built for publication: Using successive approximations for improving the convergence of GMRES method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979007)
