A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- 144 Downloads
The Bi-Conjugate Gradient (BCG) algorithm is the simplest and most natural generalization of the classical conjugate gradient method for solving nonsymmetric linear systems. It is well-known that the method suffers from two kinds of breakdowns. The first is due to the breakdown of the underlying Lanczos process and the second is due to the fact that some iterates are not well-defined by the Galerkin condition on the associated Krylov subspaces. In this paper, we derive a simple modification of the BCG algorithm, the Composite Step BCG (CSBCG) algorithm, which is able to compute all the well-defined BCG iterates stably, assuming that the underlying Lanczos process does not break down. The main idea is to skip over a step for which the BCG iterate is not defined.
KeywordsBiconjugate gradients nonsymmetric linear systems
AMS(MOS) subject classification65N20 65F10
Unable to display preview. Download preview PDF.
- C. Brezinski, M.R. Zaglia and H. Sadok, Avoiding breakdown and near-breakdown in Lanczos type algorithms, Numer. Algor. 1 (1991) 261–284.Google Scholar
- C. Brezenski, M.R. Zaglia and H. Sadok, Addendum to: Avoiding breakdown and nearbreakdown in Lanczos type algorithms, Numer. Algor. 2 (1992) 133–136.Google Scholar
- C. Brezinski, M.R. Zaglia and H. Sadok, Breakdowns in the implementation of the Lanczos method for solving linear systems, Int. J. Math. Appl. (1994), to appear.Google Scholar
- T. Chan, E. Gallopoulos, V. Simoncini, T. Szeto and C. Tong, QMRCGSTAB: A quasi-minimal residual version of the Bi-CGSTAB algorithm for nonsymmetric systems, Tech. Rep. CAM 92-26, UCLA, Dept. of Math., Los Angeles, CA 90024-1555 (1992), to appear in SIAM J. Sci. Comp.Google Scholar
- T.F. Chan and T. Szeto, A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems, Numer. Algor. (1994), this issue.Google Scholar
- A. Draux,Polynômes Orthogonaux Formels. Applications, Lect. Notes in Mathematics, vol. 974 (Springer, Berlin, 1983).Google Scholar
- R. Fletcher, Conjugate gradient methods for indefinite systems, in:Numerical Analysis Dundee 1975, Lecture Notes in Mathematics 506, ed. G.A. Watson (Springer, Berlin, 1976) pp. 73–89.Google Scholar
- W. Joubert, Generalized conjugate gradient and Lanczos methods for the solution of non-symmetric systems of linear equations, PhD thesis, Univ. of Texas at Austin (1990).Google Scholar
- C. Lanczos, Solution of linear equations by minimized iterations, J. Res. Natl. Bar. Stand. 49 (1952) 33–53.Google Scholar
- C.H. Tong, A comparative study of preconditioned Lanczos methods for nonsymmetric linear systems, Tech. Rep. SAND91-8402 UC-404, Sandia National Laboratories, Albuquerque (1992).Google Scholar