Multipole-based preconditioners for large sparse linear systems

  • Authors:

  • Sreekanth R. Sambavaram;Vivek Sarin;Ahmed Sameh;Ananth Grama

  • Affiliations:

  • Department of Computer Science, Texas A&M University, 410 B, H.R. Bright Building, College Station, TX;Department of Computer Science, Texas A&M University, 410 B, H.R. Bright Building, College Station, TX;Department of Computer Science, Purdue University, 250 N. University Street, West Lafayette, IN;Department of Computer Science, Purdue University, 250 N. University Street, West Lafayette, IN

  • Venue:
  • Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block low-rank approximations and hierarchical multipole approximations, the cost of computing and storing these preconditioners has reduced dramatically. This paper describes the use of multipole operators as parallel preconditioners for sparse linear systems. Hierarchical multipole approximations of explicit Green's functions are effective preconditioners due to their bounded-error properties. By enumerating nodes in proximity preserving order, one can achieve high parallel efficiency in computing matrix-vector products with these dense preconditioners. The benefits of the approach are illustrated on the Poisson problem and the generalized Stokes problem arising in incompressible fluid flow simulations. Numerical experiments show that the multipole-based techniques are effective preconditioners that can be parallelized efficiently on multiprocessing platforms.