Report icon

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,...

Expand abstract

Actions


Access Document


Files:

Authors


Publication date:
2008-10-05
URN:
uuid:1ea288ad-6e39-4636-a8f2-f258a11327ba
Local pid:
oai:eprints.maths.ox.ac.uk:1064

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP