Abstract
The standard preconditioning techniques for conjugate gradient methods often fail for matrices that are indefinite and/or strongly nonsymmetric. The most common alterative considered for these cases are either to use expensive direct solvers or to resort to one of many techniques based on the normal equations. This paper examines several such alternatives and compares them. In particular an incomplete LQ factorization is proposed and some of its implementation details are described. A number of experiments are reported to compare these methods.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 89-105 |
| Number of pages | 17 |
| Journal | Journal of Computational and Applied Mathematics |
| Volume | 24 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - Nov 1988 |
| Externally published | Yes |
Bibliographical note
Funding Information:* Research supported by the National Science Foundation under Grants No. US NSF-MIP-8410110 and US NSF DCR85-09970, the US Department of Energy under Grant No. DOE DE-FGO2-85ER25001, by the US Air Force under Contract AFSOR-85-0211, and the IBM donation.
Keywords
- Indefinite linear systems
- SSOR preconditioners
- incomplete LQ factorization
- least squares problems
- normal equations
- preconditioned conjugate gradient