Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
Journal Article
·
· Parallel Computing
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Here, in this paper, we consider the symbolic factorization step in computing the Cholesky factorization of a sparse symmetric positive definite matrix on distributed-memory multiprocessor systems. By exploiting the supernodal structure in the Cholesky factor, the performance of a previous parallel symbolic factorization algorithm is improved. Empirical tests demonstrate that there can be drastic reduction in the execution time required by the new algorithm on an Intel iPSC/2 hypercube.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- Grant/Contract Number:
- AC05-84OR21400
- OSTI ID:
- 5456424
- Report Number(s):
- ORNL/TM--11836; ON: DE91014967
- Journal Information:
- Parallel Computing, Journal Name: Parallel Computing Journal Issue: 2 Vol. 19; ISSN 0167-8191
- Publisher:
- ElsevierCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
A supernodal Cholesky factorization algorithms for shared-memory multiprocessors
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Matrix factorization on a hypercube multiprocessor
Journal Article
·
Thu Jul 01 00:00:00 EDT 1993
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (United States)
·
OSTI ID:7369124
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Technical Report
·
Sun Mar 31 23:00:00 EST 1991
·
OSTI ID:5896533
Matrix factorization on a hypercube multiprocessor
Conference
·
Thu Aug 01 00:00:00 EDT 1985
·
OSTI ID:5653196