<i>S</i><sup>+</sup>: Efficient 2D Sparse LU Factorization on Parallel Machines (Q2706257): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:03, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | <i>S</i><sup>+</sup>: Efficient 2D Sparse LU Factorization on Parallel Machines |
scientific article |
Statements
<i>S</i><sup>+</sup>: Efficient 2D Sparse LU Factorization on Parallel Machines (English)
0 references
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
