A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems (Q1334200): Difference between revisions

The composite step bi-conjugate gradient (CSBCG) algorithm, which is a useful modification of the BCG algorithm, is derived. The CSBCG algorithm eliminates pivot break-downs, assuming that the underlying Lanczos process does not break-down. The BCG algorithm and the break-down possibilities are briefly reviewed. It is proved that CSBCG is able to compute exactly those BCG iterates that are well-defined. The choice of some heuristic strategies for deciding when to take a composite step as well as details of implementation are discussed thoroughly. Numerical experiments are given.