Avoiding breakdown in variants of the BI-CGSTAB algorithm
The bi-conjugate gradient (BI-CG) method and its variants (CGS, BI-CGSTAB, BI-CGSTAB2) for solving nonsymmetric linear systems can suffer from breakdown. In this paper a breakdown-free BI-CGSTAB algorithm and a breakdown-free BI-CGSTAB2 algorithm are presented. Only exact breakdowns are cured accurately. These algorithms are tested successfully on numerical examples of size up to \(n=40\) which involved breakdowns.
scientific article; zbMATH DE number 1067946
scientific article