Task scheduling for parallel sparse Cholesky factorization
George A. Geist, Esmond Ng · International Journal of Parallel Programming · 1989
Cited by 105 works. doi:10.1007/bf01407861
Authors
References
- The Art of Computer Programming: Volume 3: Sorting and Searching
- Computer Solution of Large Sparse Positive Definite Systems.
- Nested Dissection of a Regular Finite Element Mesh
- The Art of Computer Programming, Volume 3, Sorting and Searching
- Modification of the minimum-degree algorithm by multiple elimination
- The Role of Elimination Trees in Sparse Factorization
- The Evolution of the Minimum Degree Ordering Algorithm
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- A compact row storage scheme for Cholesky factors using elimination trees