Date: 05 Oct 2006

The convergence behaviour of preconditioned CG and CG-S in the presence of rounding errors

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Incomplete Choleski decompositions and modified versions thereof are quite effective preconditioners for the conjugate gradients method. It is explained why Modified Incomplete Choleski may lead to more iteration steps, in some cases, whereas it should theoretically be more effective than standard Incomplete Choleski. It is also shown, by carefully analyzing a numerical example, why the convergence behaviour of Conjugate Gradients-Squared can be, sometimes unacceptable, irregular.