Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
Journal Article
·
· Linear Algebra and Its Applications; (United States)
- Univ. of Texas, Austin, TX (United States)
Recent papers by Faber and Manteuffel characterize the cases where ORTHODIR, a generalized conjugate-gradient algorithm for solving complex non-Hermitian linear systems, can be defined by a short recurrence formula and thus simplified. In the present paper similar results are obtained for two other generalized conjugate-gradient algorithms, namely, ORTHOMIN and ORTHORES. Necessary and sufficient conditions on the coefficient matrix A are given so that simplification is possible. Illustrative examples are given.
- DOE Contract Number:
- AS05-81ER10954
- OSTI ID:
- 5703737
- Journal Information:
- Linear Algebra and Its Applications; (United States), Journal Name: Linear Algebra and Its Applications; (United States) Vol. 88-89; ISSN 0024-3795; ISSN LAAPAW
- Country of Publication:
- United States
- Language:
- English
Similar Records
Conjugate gradient algorithms using multiple recursions
Necessary and sufficient conditions for the existence of a conjugate gradient method
A matrix analysis of conjugate gradient algorithms
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:440695
Necessary and sufficient conditions for the existence of a conjugate gradient method
Journal Article
·
Sat Mar 31 23:00:00 EST 1984
· SIAM J. Numer. Anal.; (United States)
·
OSTI ID:6682201
A matrix analysis of conjugate gradient algorithms
Conference
·
Wed Mar 31 23:00:00 EST 1993
·
OSTI ID:10193408