Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
SIAM Journal on Scientific and Statistical Computing · 1992 · 5,467 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Vorst, H. A. van der. (1992). Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM Journal on Scientific and Statistical Computing, 13(2), 631–644. https://doi.org/10.1137/0913035
In text: (Vorst, 1992)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
Recently the Conjugate Gradients-Squared (CG-S) method has been proposed as an attractive variant of the Bi-Conjugate Gradients (Bi-CG) method. However, it has been observed that CG-S may lead to a rather irregular convergence behaviour, so that in some cases rounding errors can even result in severe cancellation effects in the solution. In this paper, another variant of Bi-CG is proposed which does not seem to suffer from these negative effects. Numerical experiments indicate also that the new variant, named Bi-CGSTAB, is often much more efficient than CG-S.
Related papers
- LINCS: A linear constraint solver for molecular simulations1997
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems1986
- Methods of conjugate gradients for solving linear systems1952
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs1998
- A Singular Value Thresholding Algorithm for Matrix Completion2010
Metadata from OpenAlex (CC0). Citations are generated from the published record.