Jump to content

Biconjugate gradient stabilized method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kxx (talk | contribs) at 22:17, 5 January 2010 (Created page with 'In numerical linear algebra, the '''biconjugate gradient stabilized method''', often abbreviated as '''BiCGSTAB''', is an iterative method developed by [[He...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In numerical linear algebra, the biconjugate gradient stabilized method, often abbreviated as BiCGSTAB, is an iterative method developed by H. A. van der Vorst for the numerical solution of nonsymmetric linear systems. It is a variant of the biconjugate gradient method (BiCG) and has faster and smoother convergence than the original BiCG as well as other variants such as the conjugate gradient squared method (CGS).

References

  • Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1137/0913035, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1137/0913035 instead.