The Chebyshev iteration revisited

8 years 7 months ago
The Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massively parallel computers with high communication cost. We compare six different algorithms that implement this methods and compare them with respect to roundoff effects, in particular, the ultimately achievable accuracy. Two of these algorithms replace the three-term recurrences by more accurate coupled two-term recurrences and seem to be new. But we also show that, for real data, the classical three-term Chebyshev iteration is never seriously affected by roundoff, in contrast to the corresponding version of the conjugate gradient method. Even for complex data, strong roundoff effects are seen to be limited to very special situations where convergence is anyway slow. The Chebyshev iteration is applicable to symmetric definite linear systems and to nonsymmetric matrices whose eigenvalues are known to be confined...
Martin H. Gutknecht, Stefan Röllin
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where PC
Authors Martin H. Gutknecht, Stefan Röllin
Comments (0)