Parallel Algorithms for Sparse Linear Systems
- 1 September 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 33 (3), 420-460
- https://doi.org/10.1137/1033099
Abstract
No abstract availableThis publication has 72 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