Implementation of an adaptive algorithm for Richardson's method

Abstract We discuss the implementation of an adaptive algorithm proposed by one of us. The algorithm is a hybrid of the gmres method and Richardson's method. Richardson's method ( RM ) depends on a set of parameters that are computed by minimizing the L 2 norm of a polynomial over the convex hull of eigenvalues. Execution of GMRES yields not only an approximate solution but also the approximate convex hull. RM is used to avoid storing and working with a large number of vectors as GMRES often requires. This method is also advantageous for the solution of large problems. We consider several test problems and compare our algorithm primarily with the conjugate-gradient-squared algorithm, but also with GMRES and to CG (applied to the normal equations). For many (test) problems our algorithm takes roughly 50 percent more work than the conjugate-gradient-squared algorithm, although if the matrix is either preconditioned or indefinite, our algorithm is more efficient. However, our algorithm currently imposes an undesirable burden on the user, who is invited to consider a variety of numerical parameters to manipulate, such as the number of steps of rm , in order to enhance performance: the values we suggest are only empirical.

[1]  Lothar Reichel,et al.  The application of Leja points to Richardson iteration and polynomial preconditioning , 1991 .

[2]  Gerhard Opfer,et al.  Richardson's iteration for nonsymmetric matrices , 1984 .

[3]  H. Elman Iterative methods for large, sparse, nonsymmetric systems of linear equations , 1982 .

[4]  G. Golub,et al.  The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems , 1988 .

[5]  T. Manteuffel Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration , 1978 .

[6]  David M. Young,et al.  On Richardson's Method for Solving Linear Systems with Positive Definite Matrices , 1953 .

[7]  H. Tal-Ezer Polynomial approximation of functions of matrices and applications , 1989 .

[8]  S. J. Dennis C. Smolarski,et al.  Computing the Roots of Complex Orthogonal and Kernel Polynomials , 1988 .

[9]  Y. Saad,et al.  Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method , 1985 .

[10]  Y. Saad,et al.  A hybrid Chebyshev Krylov subspace algorithm for solving nonsymmetric systems of linear equations , 1986 .

[11]  Anthony T. Chronopoulos A class of parallel iterative methods implemented on multiprocessors , 1987 .

[12]  P. Brown,et al.  Matrix-free methods for stiff systems of ODE's , 1986 .

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

[14]  David M. Young,et al.  A historical review of iterative methods , 1990 .

[15]  Owe Axelsson,et al.  A survey of preconditioned iterative methods for linear systems of algebraic equations , 1985 .

[16]  P. Saylor,et al.  Leapfrog variants of iterative methods for linear algebraic equations , 1988 .

[17]  R. Fletcher Conjugate gradient methods for indefinite systems , 1976 .

[18]  Martin H. Gutknecht,et al.  Stationary and almost stationary iterative (k, l)-step methods for linear and nonlinear systems of equations , 1989 .

[19]  T. Manteuffel,et al.  Adaptive polynomial preconditioning for hermitian indefinite linear systems , 1989 .

[20]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[21]  Lothar Reichel,et al.  Polynomials by Conformal Mapping for the Richardson Iteration Method for Complex Linear Systems , 1988 .

[22]  Bradley Parsons General k-part stationary iterative solutions to linear systems , 1987 .

[23]  Convergence of a two-stage Richardson process for nonlinear equations , 1986 .

[24]  S. Ashby,et al.  A numerical investigation of the conjugate gradient method as applied to three‐dimensional groundwater flow problems in randomly heterogeneous porous media , 1989 .

[25]  P. Saylor,et al.  An optimum iterative method for solving any linear system with a square matrix , 1988 .

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

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

[28]  Gene H. Golub,et al.  Richardson''s non-stationary matrix iterative procedure. , 1972 .

[29]  Anthony T. Chronopoulos,et al.  On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy , 1989, Parallel Comput..

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

[31]  P. Sonneveld CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems , 1989 .

[32]  S. F. Ashby,et al.  ChebyCode, a FORTRAN implementation of Manteuffel's adaptive Chebyshev algorithm , 1985 .

[33]  Anthony T. Chronopoulos,et al.  s-step iterative methods for symmetric linear systems , 1989 .