Parallel Algorithms for Sparse Linear Systems
Michael T. Heath, Esmond Ng, Barry W. Peyton · SIAM Review · 1991
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.
Cited by 235 works. doi:10.1137/1033099
Authors
References
- An Efficient Heuristic Procedure for Partitioning Graphs
- Basic Linear Algebra Subprograms for Fortran Usage
- Algebraic connectivity of graphs
- Computer Solution of Large Sparse Positive Definite Systems.
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- A Separator Theorem for Planar Graphs
- A frontal solution program for finite element analysis
- Direct Methods for Sparse Matrices
- Nested Dissection of a Regular Finite Element Mesh