A Mapping Algorithm for Parallel Sparse Cholesky Factorization
- 1 September 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 14 (5) , 1253-1257
- https://doi.org/10.1137/0914074
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Highly Parallel Sparse Cholesky FactorizationSIAM Journal on Scientific and Statistical Computing, 1992
- The Multifrontal Method for Sparse Matrix Solution: Theory and PracticeSIAM Review, 1992
- Parallel Algorithms for Sparse Linear SystemsSIAM Review, 1991
- A Fan-In Algorithm for Distributed Sparse Numerical FactorizationSIAM Journal on Scientific and Statistical Computing, 1990
- A Fast Algorithm for Reordering Sparse Matrices for Parallel FactorizationSIAM Journal on Scientific and Statistical Computing, 1989
- Solution of sparse positive definite systems on a hypercubeJournal of Computational and Applied Mathematics, 1989
- Task scheduling for parallel sparse Cholesky factorizationInternational Journal of Parallel Programming, 1989
- Communication results for parallel sparse Cholesky factorization on a hypercubeParallel Computing, 1989
- A Parallel Solution Method for Large Sparse Systems of EquationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973