Parallel Algorithms for Sparse Linear Systems
Authors:
- Michael T. HeathMHMichael T. Heath
- Esmond NgENEsmond Ng
- Barry W. PeytonBPBarry W. Peyton
- 1 September 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 33 (3) , 420-460
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.Keywords
This publication has 78 references indexed in Scilit:
- Parallel sparse Gaussian elimination with partial pivotingAnnals of Operations Research, 1990
- The multifrontal method and paging in sparse Cholesky factorizationACM Transactions on Mathematical Software, 1989
- Solution of sparse positive definite systems on a hypercubeJournal of Computational and Applied Mathematics, 1989
- Vectorization of a Multiprocessor Multifrontal CodeThe International Journal of Supercomputing Applications, 1989
- A graph partitioning algorithm by node separatorsACM Transactions on Mathematical Software, 1989
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, 1987
- Progress in Sparse Matrix Methods for Large Linear Systems On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- Concurrent Multifrontal Methods: Shared Memory, Cache, and Frontwidth IssuesThe International Journal of Supercomputing Applications, 1987
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, 1982