Avoiding breakdown in variants of the BI-CGSTAB algorithm (Q1368763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Avoiding breakdown in variants of the BI-CGSTAB algorithm |
scientific article; zbMATH DE number 1067946
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Avoiding breakdown in variants of the BI-CGSTAB algorithm |
scientific article; zbMATH DE number 1067946 |
Statements
Avoiding breakdown in variants of the BI-CGSTAB algorithm (English)
0 references
2 April 1998
0 references
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.
0 references
bi-conjugate-gradient method
0 references
nonsymmetric linear systems
0 references
breakdown-free BI-CGSTAB algorithm
0 references
numerical examples
0 references
0 references
