Solution of sparse positive definite systems on a hypercube
Technical Report
·
OSTI ID:7078026
The solution of large sparse positive definite systems of equations typically involves four steps: ordering, data structure set-up (symbolic factorization), numerical factorization, and triangular solution. This article describes how these four phases are implemented on a hypercube multiprocessor. The role of elimination trees in the exploitation of sparsity and the identification of parallelism is explained, and pseudo-code algorithms are provided for some of the important algorithms. Numerical experiments run on an Intel iPSC multiprocessor are presented in order to provide some indication of the performance of the various algorithms. 36 refs., 23 figs., 5 tabs.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 7078026
- Report Number(s):
- ORNL/TM-10865; ON: TI89001878
- Country of Publication:
- United States
- Language:
- English
Similar Records
Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
Solution of sparse positive definite systems on a shared-memory multiprocessor
Matrix factorization on a hypercube multiprocessor
Journal Article
·
Thu Aug 14 00:00:00 EDT 2003
· Parallel Computing
·
OSTI ID:5456424
Solution of sparse positive definite systems on a shared-memory multiprocessor
Journal Article
·
Fri Aug 01 00:00:00 EDT 1986
· Int. J. Parallel Program.; (United States)
·
OSTI ID:5233207
Matrix factorization on a hypercube multiprocessor
Conference
·
Thu Aug 01 00:00:00 EDT 1985
·
OSTI ID:5653196