Communication results for parallel sparse Cholesky factorization on a hypercube
- 1 May 1989
- journal article
- Published by Elsevier in Parallel Computing
- Vol. 10 (3) , 287-298
- https://doi.org/10.1016/0167-8191(89)90101-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Reordering sparse matrices for parallel eliminationParallel Computing, 1989
- A Linear Reordering Algorithm for Parallel Pivoting of Chordal GraphsSIAM Journal on Discrete Mathematics, 1989
- 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
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- Communication complexity of the Gaussian elimination algorithm on multiprocessorsLinear Algebra and its Applications, 1986
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, 1982
- An Automatic Nested Dissection Algorithm for Irregular Finite Element ProblemsSIAM Journal on Numerical Analysis, 1978