Semi-Conjugate Direction Methods for Real Positive Definite Systems

In this preliminary work, left and right conjugate direction vectors are defined for nonsymmetric, nonsingular matrices A and some properties of these vectors are studied. A left conjugate direction (LCD) method for solving nonsymmetric systems of linear equations is proposed. The method has no breakdown for real positive definite systems. The method reduces to the usual conjugate gradient method when A is symmetric positive definite. A finite termination property of the semi-conjugate direction method is shown, providing a new simple proof of the finite termination property of conjugate gradient methods. The new method is well defined for all nonsingular M-matrices. Some techniques for overcoming breakdown are suggested for general nonsymmetric A. The connection between the semi-conjugate direction method and LU decomposition is established. The semi-conjugate direction method is successfully applied to solve some sample linear systems arising from linear partial differential equations, with attractive convergence rates. Some numerical experiments show the benefits of this method in comparison to well-known methods.

[1]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[2]  N. S. Barnett,et al.  Private communication , 1969 .

[3]  G. Stewart.  Conjugate direction methods for solving systems of linear equations , 1973 .

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

[5]  O. Axelsson.  Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations , 1980 .

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

[7]  J. Strikwerda.  A Generalized Conjugate Gradient Method for Non-Symmetric Systems of Linear Equations. , 1981 .

[8]  T. Manteuffel,et al.  Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method , 1984 .

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

[10]  G. Kreisselmeier.  Adaptive control of a class of slowly time-varying plants , 1986 .

[11]  R. Freund,et al.  QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .

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

[13]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[14]  Gene H. Golub,et al.  An adaptive Chebyshev iterative method\newline for nonsymmetric linear systems based on modified moments , 1994 .

[15]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[16]  G. Golub,et al.  NA-92-05 M AY 1992 Adaptive Chebyshev Iterative Methods for Nonsymmetric Linear Systems Based on Modified Moments , 1999 .