Report

### Chebyshev semi-iteration in Preconditioning

Abstract:

It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterative methods. When the solution of a linear system with a symmetric and positive definite coefficient matrix is required then the Conjugate Gradient method will compute the optimal approximate solution from the appropriate Krylov subspace, that is, it will implicitly compute the optimal polynomial. Hence a semi-iterative method, which requires eigenvalue bounds and computes an explicit polynomial,...

### Access Document

Files:
• (pdf, 145.6KB)

### Authors

Publication date:
2008-10-05
URN:
Local pid:
oai:eprints.maths.ox.ac.uk:1064