Parallel Algorithms for Sparse Linear Systems

Authors:
  • MHMichael T. Heath
    Michael T. Heath
  • ENEsmond Ng
    Esmond Ng
  • BPBarry W. Peyton
    Barry W. Peyton

Abstract
This paper surveys recent progress in the development of parallel algorithms for solving sparse linear systems on computer architectures having multiple processors. Attention is focused on direct methods for solving sparse symmetric positive definite systems, specifically by Cholesky factorization. Recent progress on parallel algorithms is surveyed for all phases of the solution process, including ordering, symbolic factorization, numeric factorization, and triangular solution.

This publication has 78 references indexed in Scilit: