A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- 1 July 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 14 (4) , 761-769
- https://doi.org/10.1137/0914048
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On Finding Supernodes for Sparse Matrix ComputationsSIAM Journal on Matrix Analysis and Applications, 1993
- A set of level 3 basic linear algebra subprogramsACM Transactions on Mathematical Software, 1990
- Vectorization of a Multiprocessor Multifrontal CodeThe International Journal of Supercomputing Applications, 1989
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Progress in Sparse Matrix Methods for Large Linear Systems On Vector SupercomputersThe International Journal of Supercomputing Applications, 1987
- Computational models and task scheduling for parallel sparse Cholesky factorizationParallel Computing, 1986
- Solution of sparse positive definite systems on a shared-memory multiprocessorInternational Journal of Parallel Programming, 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
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973