BIT Numerical Mathematics

, Volume 34, Issue 2, pp 177–204

A numerical study of optimized sparse preconditioners

  • A. M. Bruaset
  • A. Tveito

DOI: 10.1007/BF01955867

Cite this article as:
Bruaset, A.M. & Tveito, A. BIT (1994) 34: 177. doi:10.1007/BF01955867


Preconditioning strategies based on incomplete factorizations and polynomial approximations are studied through extensive numerical experiments. We are concerned with the question of the optimal rate of convergence that can be achieved for these classes of preconditioners.

Our conclusion is that the well-known Modified Incomplete Cholesky factorization (MIC), cf. e.g., Gustafsson [20], and the polynomial preconditioning based on the Chebyshev polynomials, cf. Johnson, Micchelli and Paul [22], have optimal order of convergence as applied to matrix systems derived by discretization of the Poisson equation. Thus for the discrete two-dimensional Poisson equation withn unknowns,O(n1/4) andO(n1/2) seem to be the optimal rates of convergence for the Conjugate Gradient (CG) method using incomplete factorizations and polynomial preconditioners, respectively. The results obtained for polynomial preconditioners are in agreement with the basic theory of CG, which implies that such preconditioners can not lead to improvement of the asymptotic convergence rate.

By optimizing the preconditioners with respect to certain criteria, we observe a reduction of the number of CG iterations, but the rates of convergence remain unchanged.

AMS subject classification


Key words

Conjugate gradient methodpreconditioningincomplete factorizationpolynomial preconditionermatrix-free methodFourier analysis

Copyright information

© the BIT Foundation 1994

Authors and Affiliations

  • A. M. Bruaset
    • 1
  • A. Tveito
    • 1
  1. 1.SINTEFOsloNorway