Efficient Parallel Computation of ILU(k) Preconditioners

Abstract

We report the development of a parallel algorithm for computing ILU preconditioners. The algorithm attains a high degree of parallelism through employment of a two-level ordering strategy, coupled with a subdomain graph constraint that regulates the location of nonzeros in the Schur complement. Experimental results include timings on four parallel platforms, for problems with up to 20 million unknowns running on up to 216 processors. The results support our theoretic analysis that the algorithm is highly scalable, for both preconditioner computation (factorization) and application (triangular solve) stages.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 2000
Accession Number
ADA377213

Entities

People

  • Alex Pothen
  • David Hysom

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computations
  • Computer Science
  • Convergence
  • Difference Equations
  • Differential Equations
  • Engineering
  • Environment
  • Equations
  • Floating Point Operations
  • High Performance Computing
  • Iterations
  • Linear Systems
  • Navier Stokes Equations
  • Parallel Computing
  • Partial Differential Equations

Readers

  • Linear Algebra
  • Operations Research
  • Parallel and Distributed Computing.