\(S^+\): Efficient 2D sparse LU factorization on parallel machines (Q2706257)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(S^+\): Efficient 2D sparse LU factorization on parallel machines |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(S^+\): Efficient 2D sparse LU factorization on parallel machines |
scientific article |
Statements
19 March 2001
0 references
Gaussian elimination with partial pivoting
0 references
LU factorization
0 references
sparse matrices
0 references
elimination forests
0 references
supernode amalgamation and partitioning
0 references
asynchronous computation scheduling
0 references
parallel computation
0 references
\(S^+\): Efficient 2D sparse LU factorization on parallel machines (English)
0 references
Presentation of an improved algorithm for the direct solution of sparse linear systems, using a distribution in blocks on a 2D processor array. Elimination forests, supernode partitioning/amalgamation and execution scheduling are combined with static and dynamic symbolic factorization. Experiments are executed on a Cray T3E.
0 references
