Parallel sparse Gaussian elimination with partial pivoting
Conference
·
OSTI ID:7029136
In this article we consider the factorization of a sparse nonsymmetric matrix using Gaussian elimination with partial pivoting on a multiprocessor having a globally-shared memory. The parallel algorithm makes use of a static data structure developed by George, Liu and Ng. Some numerical experiments on a Sequent Balance 8000 are presented to demonstrate the efficiency of the parallel implementation. 10 figs., 6 tabs.
- Research Organization:
- Oak Ridge National Lab., TN (USA); Waterloo Univ., Ontario (Canada). Dept. of Computer Science
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 7029136
- Report Number(s):
- CONF-8805200-1; ON: DE89000654
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel sparse Gaussian elimination with partial pivoting
Gaussian elimination with partial pivoting and load balancing on a multiprocessor
Gaussian elimination with partial pivoting and load balancing on a multiprocessor
Technical Report
·
Sat Oct 01 00:00:00 EDT 1988
·
OSTI ID:6852873
Gaussian elimination with partial pivoting and load balancing on a multiprocessor
Conference
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6919169
Gaussian elimination with partial pivoting and load balancing on a multiprocessor
Technical Report
·
Sat Feb 28 23:00:00 EST 1987
·
OSTI ID:6636181