New look-ahead Lanczos-type algorithms for linear systems

Summary. A breakdown (due to a division by zero) can arise in the algorithms for implementing Lanczos' method because of the non-existence of some formal orthogonal polynomials or because the recurrence relationship used is not appropriate. Such a breakdown can be avoided by jumping over the polynomials involved. This strategy was already used in some algorithms such as the MRZ and its variants. In this paper, we propose new implementations of the recurrence relations of these algorithms which only need the storage of a fixed number of vectors, independent of the length of the jump. These new algorithms are based on Horner's rule and on a different way for computing the coefficients of the recurrence relationships. Moreover, these new algorithms seem to be more stable than the old ones and they provide better numerical results. Numerical examples and comparisons with other algorithms will be given.

[1]  Claude Brezinski,et al.  Breakdowns in the implementation of the Lánczos method for solving linear systems , 1997 .

[2]  E. H. Ayachour.  Avoiding look-ahead in the Lanczos method and Padé approximation , 1999 .

[3]  André Draux,et al.  Polynomes Orthogonaux-Formels , 1983 .

[4]  Martin H. Gutknecht,et al.  A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I , 1992, SIAM J. Matrix Anal. Appl..

[5]  Kang C. Jea,et al.  Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods , 1980 .

[6]  George W. Struble.  Orthogonal polynomials: Variable-signed weight functions , 1963 .

[7]  Roland W. Freund,et al.  An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices , 1993, SIAM J. Sci. Comput..

[8]  Peter N. Brown,et al.  A Theoretical Comparison of the Arnoldi and GMRES Algorithms , 1991, SIAM J. Sci. Comput..

[9]  Kang C. Jea,et al.  On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems , 1983 .

[10]  Zhishun A. Liu,et al.  A Look Ahead Lanczos Algorithm for Unsymmetric Matrices , 1985 .

[11]  P. K. W. Vinsome,et al.  Orthomin, an Iterative Method for Solving Sparse Sets of Simultaneous Linear Equations , 1976 .

[12]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[13]  D. Taylor.  Analysis of the Look Ahead Lanczos Algorithm. , 1982 .

[14]  M. Gutknecht.  The Unsymmetric Lanczos Algorithms And Their Relations To Pad ' E Approximation, Continued Fractions , 1990 .

[15]  Claude Brezinski,et al.  Lanczos-type algorithms for solving systems of linear equations , 1993 .

[16]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[17]  C. Baheux,et al.  New implementations of Lanczos method , 1995 .

[18]  Q. Ye.  A breakdown-free variation of the nonsymmetric Lanczos algorithms , 1994 .

[19]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[20]  M. Gutknecht.  A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II , 1994, SIAM J. Matrix Anal. Appl..

[21]  C. Brezinski,et al.  Breakdowns In The Computation Of Orthogonal Polynomials , 1994 .

[22]  Cs.J. Hegedüs,et al.  Generating conjugate directions for arbitrary matrices by matrix equations I. , 1991 .

[23]  H. Simon,et al.  Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations , 1988 .

[24]  Mohamed Khelifi,et al.  Lanczos maximal algorithm for unsymmetric eigenvalue problems , 1991 .

[25]  C. Brezinski.  Padé-type approximation and general orthogonal polynomials , 1980 .

[26]  C. Brezinski,et al.  A breakdown-free Lanczos type algorithm for solving linear systems , 1992 .

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