Independent set orderings for parallel matrix factorization by Gaussian elimination (Q1823612)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4115822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Independent set orderings for parallel matrix factorization by Gaussian elimination |
scientific article; zbMATH DE number 4115822 |
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
0.87407255
0 references
0.86520666
0 references
0.8630475
0 references
0.86080134
0 references
0.8600249
0 references
0.8582492
0 references
0.8571181
0 references
