Solution of sparse positive definite systems on a shared-memory multiprocessor
Algorithms and software for performing sparse Cholesky decomposition and using the Cholesky factors in the solution of sparse symmetric positive definite systems on serial computers have reached a high state of development. In this paper we present algorithms for performing these two phases on a shared-memory multiprocessor computer, along with some numerical experiments demonstrating their performance on a Sequent Balance 8000 system. 10 refs., 3 figs., 7 tabs.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6842453
- Report Number(s):
- ORNL/TM-10260; ON: DE87005287
- Country of Publication:
- United States
- Language:
- English
Similar Records
Solution of sparse positive definite systems on a shared-memory multiprocessor
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems
Journal Article
·
Fri Aug 01 00:00:00 EDT 1986
· Int. J. Parallel Program.; (United States)
·
OSTI ID:5233207
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
Technical Report
·
Sun Mar 31 23:00:00 EST 1991
·
OSTI ID:5896533
Parallel sparse Cholesky factorization algorithms for shared-memory multiprocessor systems
Conference
·
Wed Jul 01 00:00:00 EDT 1992
·
OSTI ID:10159845