Rational approximation preconditioners for sparse linear systems

  • Authors:
  • Philippe Guillaume;Yousef Saad;Masha Sosonkina

  • Affiliations:
  • UMR MIP 5640, Département de Mathématiques, INSA, Complexe Scientifique de Ranguetl, 31077 Toulouse Cedex, France;Department of Computer Science and Engineering, University of Minnesota, 200 Union Street S.E., Minneapolis, MN;Department of Computer Science, University of Minnesota-Duluth, 320 Heller Hall, 1114 Kirby Drive, Duluth, MN

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2003

Quantified Score

Hi-index 7.29

Visualization

Abstract

This paper presents a class of preconditioning techniques which exploit rational function approximations to the inverse of the original matrix. The matrix is first shifted and then an incomplete LU factorization of the resulting matrix is computed. The resulting factors are then used to compute a better preconditioner for the original matrix. Since the incomplete factorization is made on a shifted matrix, a good LU factorization is obtained without allowing much fill-in. The result needs to be extrapolated to the nonshifted matrix. Thus, the main motivation for this process is to save memory. The method is useful for matrices whose incomplete LU factorizations are poor, e.g., unstable.