## Abstract

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. © 1994 J.C. Baltzer AG, Science Publishers.

Original language | English |
---|---|

Pages (from-to) | 1-16 |

Number of pages | 16 |

Journal | Numerical Algorithms |

Volume | 7 |

Issue number | 1 |

DOIs | |

State | Published - 1994 |

Externally published | Yes |