Toward efficient polynomial preconditioning for GMRES
- 30 December 2021
- journal article
- research article
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 29 (4) , e2427
Abstract
We present a polynomial preconditioner for solving large systems of linear equations. The polynomial is derived from the minimum residual polynomial (the GMRES polynomial) and is more straightforward to compute and implement than many previous polynomial preconditioners. Our current implementation of this polynomial using its roots is naturally more stable than previous methods of computing the same polynomial. We implement further stability control using added roots, and this allows for high degree polynomials. We discuss the effectiveness and challenges of root‐adding and give an additional check for stability. In this article, we study the polynomial preconditioner applied to GMRES; however it could be used with any Krylov solver. This polynomial preconditioning algorithm can dramatically improve convergence for some problems, especially for difficult problems, and can reduce dot products by an even greater margin.Keywords
All Related Versions
Funding Information
- National Science Foundation of Sri Lanka (DMS‐1418677)
This publication has 32 references indexed in Scilit:
- A polynomial preconditioner for the GMRES algorithmJournal of Computational and Applied Mathematics, 1995
- Approximate solutions and eigenvalue bounds from Krylov subspacesNumerical Linear Algebra with Applications, 1995
- A Newton basis GMRES implementationIMA Journal of Numerical Analysis, 1994
- GMRESR: a family of nested GMRES methodsNumerical Linear Algebra with Applications, 1994
- Computing interior eigenvalues of large matricesLinear Algebra and its Applications, 1991
- A stable Richardson iteration method for complex linear systemsNumerische Mathematik, 1989
- Leapfrog variants of iterative methods for linear algebraic equationsJournal of Computational and Applied Mathematics, 1988
- An optimum iterative method for solving any linear system with a square matrixBIT Numerical Mathematics, 1988
- Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problemsMathematics of Computation, 1984
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-MatrixMathematics of Computation, 1977