Some theoretical problems and implementation problems are studied here for the semi‐conjugate direction method established by Yuan, Golub, Plemmons and Cecilio (2002). The existence of semi‐conjugate directions is proved for almost all matrices except skew‐symmetric matrices. A new technique is proposed to overcome the breakdown problem appeared in the semi‐conjugate direction method. In the implementation of the semi‐conjugate direction method, the generation of the semi‐conjugate direction is very important and necessary, but very expensive. The technique of limited‐memory is introduced to economize the cost of the generation of the semi‐conjugate direction in the Yuan–Golub– Plemmons–Cecilio algorithm. Finally, some numerical experiments are given to confirm our theoretical results. Our results illustrate that the semi‐conjugate direction method is very nice alternative for solving non‐symmetric systems, and the limited‐memory left conjugate direction method is a good improvement of the left conjugate direction method. Copyright © 2004 John Wiley & Sons, Ltd.
[1]
M. Hestenes,et al.
Methods of conjugate gradients for solving linear systems
,
1952
.
[2]
G. Stewart.
Conjugate direction methods for solving systems of linear equations
,
1973
.
[3]
T. Manteuffel,et al.
Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
,
1984
.
[4]
Jorge Nocedal,et al.
On the limited memory BFGS method for large scale optimization
,
1989,
Math. Program..
[5]
Gene H. Golub,et al.
An adaptive Chebyshev iterative method\newline for
nonsymmetric linear systems based on modified moments
,
1994
.
[6]
Gene H. Golub,et al.
Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
,
2002,
SIAM J. Matrix Anal. Appl..
[7]
G. Golub,et al.
Semi-Conjugate Direction Methods for Real Positive Definite Systems
,
2004
.