Independent set orderings for parallel matrix factorization by Gaussian elimination (Q1823612): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:51, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Independent set orderings for parallel matrix factorization by Gaussian elimination |
scientific article |
Statements
Independent set orderings for parallel matrix factorization by Gaussian elimination (English)
0 references
1989
0 references
Experiments and discussions comparing various approaches to ordering matrices for parallel factorization by Gaussian elimination are presented. The techniques designed to reduce fill are reviewed. As an alternative, the strategy of independent set ordering is proposed, aiming to maximize the number of independent operations that can be produced simultaneously. Cost and performance analyses are also given.
0 references
matrix ordering
0 references
parallel factorization
0 references
Gaussian elimination
0 references
