Sparse LU factorization with partial pivoting on distributed memory machines
- 17 November 1996
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Run-time compilation for parallel sparse matrix computationsPublished by Association for Computing Machinery (ACM) ,1996
- On the granularity and clustering of directed acyclic task graphsIEEE Transactions on Parallel and Distributed Systems, 1993
- PYRROSPublished by Association for Computing Machinery (ACM) ,1992
- Parallel Algorithms for Sparse Linear SystemsSIAM Review, 1991
- Parallel sparse Gaussian elimination with partial pivotingAnnals of Operations Research, 1990
- Algorithm 656: an extended set of basic linear algebra subprograms: model implementation and test programsACM Transactions on Mathematical Software, 1988
- Progress in Sparse Matrix Methods for Large Linear Systems On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- Symbolic Factorization for Sparse Gaussian Elimination with Partial PivotingSIAM Journal on Scientific and Statistical Computing, 1987
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981