Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Biconjugate gradient stabilized method

Numerical Algorithm

The biconjugate gradient stabilized method, usually abbreviated BiCGSTAB, is an iterative method for the numerical solution of nonsymmetric linear systems. H. A. van der Vorst developed it as a variant of the biconjugate gradient method (BiCG), and it converges faster and more smoothly than the original BiCG as well as other variants such as the conjugate gradient squared method (CGS). It belongs to the family of Krylov subspace methods. A practical advantage over the original BiCG method is that it does not require multiplication by the transpose of the system matrix, which simplifies its use when only products with the matrix itself are available.

Connections

In Field

Source Biconjugate gradient stabilized method (Wikipedia)

Uses Design Technique

Source Biconjugate gradient stabilized method (Wikipedia)
Sources
Biconjugate gradient stabilized method (Wikipedia)
  • In Group: Linear Algebra and Matrix Decomposition, Lead paragraph
    for the numerical solution of nonsymmetric linear systems
  • In Field: Computational Science, Lead paragraph [in-field]
    In numerical linear algebra, the biconjugate gradient stabilized method
  • Uses Design Technique: Iterative Refinement, Lead paragraph [design-technique-used]
    is an iterative method developed by H. A. van der Vorst
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.