Content deleted Content added
Citation bot (talk | contribs) Removed parameters. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | Linked from User:AManWithNoPlan/sandbox3 | #UCB_webform_linked 21/186 |
Mentioned that transpose is unnecessary, unlike BiCG |
||
Line 1:
{{Technical|date=May 2015}}
In [[numerical linear algebra]], the '''biconjugate gradient stabilized method''', often abbreviated as '''BiCGSTAB''', is an [[iterative method]] developed by [[Henk van der Vorst|H. A. van der Vorst]] for the numerical solution of nonsymmetric [[System of linear equations|linear system]]s. 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). It is a [[Krylov subspace]] method. Unlike the original BiCG method, it doesn't require multiplication by the transpose of the system matrix.
==Algorithmic steps==
| |||