Previous: BiConjugate Gradient Stabilized (Bi-CGSTAB)
Up: Nonstationary Iterative Methods
Previous Page: Implementation
Next Page: Comparison with other methods
Previous: BiConjugate Gradient Stabilized (Bi-CGSTAB)
Up: Nonstationary Iterative Methods
Previous Page: Implementation
Next Page: Comparison with other methods
Chebyshev Iteration is another method for solving
nonsymmetric
problems (see Golub and Van Loan [108] 10.1.5,and
Varga[206], Chapter 5).
Chebyshev Iteration avoids the computation of inner products as is
necessary for the other nonstationary methods.
For some distributed memory architectures
these inner products are a bottleneck
with respect to efficiency. The
price one pays for avoiding inner products is that the method requires
enough knowledge about the spectrum of the coefficient matrix
that
an ellipse enveloping the spectrum can be identified
;
however this
difficulty can be overcome via an adaptive construction
developed by
Manteuffel [143], and implemented by Ashby [7].
Chebyshev iteration is suitable for any nonsymmetric linear system for
which the enveloping ellipse does not include the origin.