Task scheduling for parallel sparse Cholesky factorization
- 1 August 1989
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 18 (4) , 291-314
- https://doi.org/10.1007/bf01407861
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Role of Elimination Trees in Sparse FactorizationSIAM Journal on Matrix Analysis and Applications, 1990
- Reordering sparse matrices for parallel eliminationParallel Computing, 1989
- Communication results for parallel sparse Cholesky factorization on a hypercubeParallel Computing, 1989
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- Sparse Cholesky Factorization on a Local-Memory MultiprocessorSIAM Journal on Scientific and Statistical Computing, 1988
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, 1987
- Solution of sparse positive definite systems on a shared-memory multiprocessorInternational Journal of Parallel Programming, 1986
- Parallel implementation of multifrontal schemesParallel Computing, 1986
- An Automatic Nested Dissection Algorithm for Irregular Finite Element ProblemsSIAM Journal on Numerical Analysis, 1978
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973