Adaptively Preconditioned GMRES Algorithms

The restarted GMRES algorithm proposed by Saad and Schultz [SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856--869] is one of the most popular iterative methods for the solution of large linear systems of equations Ax=b with a nonsymmetric and sparse matrix. This algorithm is particularly attractive when a good preconditioner is available. The present paper describes two new methods for determining preconditioners from spectral information gathered by the Arnoldi process during iterations by the restarted GMRES algorithm. These methods seek to determine an invariant subspace of the matrix A associated with eigenvalues close to the origin and to move these eigenvalues so that a higher rate of convergence of the iterative methods is achieved.

[1]  W. Arnoldi.  The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[2]  G. Smith,et al.  Numerical Solution of Partial Differential Equations: Finite Difference Methods , 1978 .

[3]  Y. Saad.  Krylov subspace methods for solving large unsymmetric linear systems , 1981 .

[4]  H. Elman,et al.  Polynomial iteration for nonsymmetric indefinite linear systems , 1986 .

[5]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[6]  L. Reichel,et al.  A stable Richardson iteration method for complex linear systems , 1988 .

[7]  Danny C. Sorensen,et al.  Implicit Application of Polynomial Filters in a k-Step Arnoldi Method , 1992, SIAM J. Matrix Anal. Appl..

[8]  Lloyd N. Trefethen,et al.  A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems , 1992, SIAM J. Matrix Anal. Appl..

[9]  G. Golub,et al.  Iterative solution of linear systems , 1991, Acta Numerica.

[10]  H. V. D. Vorst,et al.  The superlinear convergence behaviour of GMRES , 1993 .

[11]  Lyapunov Equations.  KRYLOV SUBSPACE METHODS FOR SOLVING LARGE , 1994 .

[12]  Lloyd N. Trefethen,et al.  GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems , 2018, SIAM J. Sci. Comput..

[13]  Tim Hopkins,et al.  A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations , 1994, Adv. Comput. Math..

[14]  D. Calvetti,et al.  AN IMPLICITLY RESTARTED LANCZOS METHOD FOR LARGE SYMMETRIC EIGENVALUE PROBLEMS , 1994 .

[15]  Homer F. Walker,et al.  A simpler GMRES , 1994, Numer. Linear Algebra Appl..

[16]  L. Reichel,et al.  A Newton basis GMRES implementation , 1994 .

[17]  Ronald B. Morgan,et al.  A Restarted GMRES Method Augmented with Eigenvectors , 1995, SIAM J. Matrix Anal. Appl..

[18]  M. Rozložník,et al.  Numerical stability of GMRES , 1995 .

[19]  Jocelyne Erhel,et al.  A parallel GMRES version for general sparse matrices. , 1995 .

[20]  S. A. Kharchenko,et al.  Eigenvalue translation based preconditioners for the GMRES(k) method , 1995, Numer. Linear Algebra Appl..

[21]  Yousef Saad,et al.  Preconditioned Krylov Subspace Methods For CFD Applications , 1995 .

[22]  R. Lehoucq.  Analysis and implementation of an implicitly restarted Arnoldi iteration , 1996 .

[23]  K. Burrage,et al.  Restarted GMRES preconditioned by deflation , 1996 .

[24]  Y. Saad,et al.  Deflated and Augmented Krylov Subspace Techniques , 1997 .

[25]  Marcus J. Grote,et al.  Parallel Preconditioning with Sparse Approximate Inverses , 1997, SIAM J. Sci. Comput..

[26]  Yousef Saad,et al.  Deflated and Augmented Krylov Subspace Techniques , 1997, Numer. Linear Algebra Appl..

[27]  G. Golub,et al.  Gmres: a Generalized Minimum Residual Algorithm for Solving , 2022 .