An approach for parallelizing any general unsymmetric sparse matrix algorithm
Conference
·
OSTI ID:125544
In many large scale scientific and engineering computations, the solution to a sparse linear system is required. We present a partial unsymmetric nested dissection method that can be used to parallelize any general unsymmetric sparse matrix algorithm whose pivot search can be restricted to a subset of rows and columns in the active submatrix. The submatrix is determined by the partial unsymmetric dissection. We present results of this approach, applied to the unsymmetric-pattern multifrontal method.
- OSTI ID:
- 125544
- Report Number(s):
- CONF-950212--; CNN: Grant ASC-9111263; Grant DMS-9223088
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel algorithm for sparse unsymmetric LU factorization
On general row merging schemes for sparse Givens transformations
Sparse matrix algorithms on distributed memory multiprocessors
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6037134
On general row merging schemes for sparse Givens transformations
Journal Article
·
Wed Oct 01 00:00:00 EDT 1986
· SIAM J. Sci. Stat. Comput.; (United States)
·
OSTI ID:5100212
Sparse matrix algorithms on distributed memory multiprocessors
Technical Report
·
Thu Dec 31 23:00:00 EST 1992
·
OSTI ID:6645453