Previous: Conjugate Gradient Squared Method (CGS)
Up: Nonstationary Iterative Methods
Next: Chebyshev Iteration
Previous Page: Implementation
Next Page: Convergence
Previous: Conjugate Gradient Squared Method (CGS)
Up: Nonstationary Iterative Methods
Next: Chebyshev Iteration
Previous Page: Implementation
Next Page: Convergence
The BiConjugate Gradient Stabilized method (Bi-CGSTAB) was developed to
solve nonsymmetric linear systems while avoiding the often irregular
convergence patterns of the Conjugate
Gradient Squared
method (see Van der Vorst [202]). Instead of computing
the CGS sequence
, Bi-CGSTAB computes
where
is an
th degree polynomial describing a steepest
descent update.
