Leapfrog variants of iterative methods for linear algebraic equations

Abstract Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterants are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

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

[2]  C. Micchelli,et al.  Polynomial Preconditioners for Conjugate Gradient Calculations , 1983 .

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

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

[5]  Tom K. Eccles.  A method of data management in a simulator used for large reservoir models , 1983 .

[6]  D. Smolarski.  Optimum semi-iterative methods for the solution of any linear algebraic system with a square matrix , 1982 .

[7]  T. Broadbent.  Mathematics for the Physical Sciences , 1959, Nature.

[8]  L. Adams.  Iterative algorithms for large sparse linear systems on parallel computers , 1983 .

[9]  W. Gautschi.  On Generating Orthogonal Polynomials , 1982 .

[10]  T. Manteuffel,et al.  A taxonomy for conjugate gradient methods , 1990 .

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

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

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

[14]  J. Ortega,et al.  Solution of Partial Differential Equations on Vector and Parallel Computers , 1987 .

[15]  Polynomial scaling in the conjugate gradient method and related topics in matrix scaling , 1982 .

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

[17]  T. Manteuffel.  The Tchebychev iteration for nonsymmetric linear systems , 1977 .