Avoiding breakdown in variants of the BI-CGSTAB algorithm
type: Item
instance of: scholarly article
title: Avoiding breakdown in variants of the BI-CGSTAB algorithm
zbMATH Open document ID: 0885.65033
DOI: 10.1016/S0024-3795(96)00525-3
published in: Linear Algebra and its Applications
publication date: 1998-04-02T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 1067946
zbMATH Keywords: bi-conjugate-gradient method
zbMATH Keywords: nonsymmetric linear systems
zbMATH Keywords: breakdown-free BI-CGSTAB algorithm
zbMATH Keywords: numerical examples
author: Zhi-Hao Cao
reviewed by: Horst Hollatz
describes a project that uses: na1
describes a project that uses: Bi-CG
describes a project that uses: CGS
MaRDI profile type: Publication
cites work: Padé-type approximation and general orthogonal polynomials
cites work: A breakdown-free Lanczos type algorithm for solving linear systems
cites work: Avoiding breakdown and near-breakdown in Lanczos type algorithms
cites work: Avoiding breakdown in the CGS algorithm
cites work: A Theoretical Comparison of the Arnoldi and GMRES Algorithms
cites work: Polynômes orthogonaux formels - applications
cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
cites work: Variants of BICGSTAB for Matrices with Complex Spectrum
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
cites work: How Fast are Nonsymmetric Matrix Iterations?
cites work: Beiträge zur Kenntnis des Biorthogonalisierungs-Algorithmus von Lanczos
cites work: The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
cites work: Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
cites work: Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
full work available at URL: s0024-3795(96)00525-3
OpenAlex ID: W2072431272
description: scientific article; zbMATH DE number 1067946