Reordering sparse matrices for parallel elimination
- 1 July 1989
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 11 (1) , 73-91
- https://doi.org/10.1016/0167-8191(89)90064-1
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Linear Reordering Algorithm for Parallel Pivoting of Chordal GraphsSIAM Journal on Discrete Mathematics, 1989
- Equivalent Sparse Matrix Reordering by Elimination Tree RotationsSIAM Journal on Scientific and Statistical Computing, 1988
- Sparse Cholesky Factorization on a Local-Memory MultiprocessorSIAM Journal on Scientific and Statistical Computing, 1988
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- Parallel implementation of multifrontal schemesParallel Computing, 1986
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- A Data Structure for Parallel L/U DecompositionIEEE Transactions on Computers, 1982
- Optimal parallel triangulation of a sparse matrixIEEE Transactions on Circuits and Systems, 1979