2. Parallel Algorithms for Sparse Linear Systems
Michael T. Heath, Esmond Ng, Barry W. Peyton · Society for Industrial and Applied Mathematics eBooks · 1990
In this paper we survey recent progress in the development of parallel algorithms for solving sparse linear systems on computer architectures having multiple processors. We focus our attention on direct methods for solving sparse symmetric positive definite systems, specifically by Cholesky factorization. We survey recent progress on parallel algorithms for all phases of the solution process, including ordering, symbolic factorization, numeric factorization, and triangular solution.