The row/column pivoting strategy on multicomputers (Q1319522)
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: The row/column pivoting strategy on multicomputers |
scientific article; zbMATH DE number 550165
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The row/column pivoting strategy on multicomputers |
scientific article; zbMATH DE number 550165 |
Statements
The row/column pivoting strategy on multicomputers (English)
0 references
12 April 1994
0 references
Matrix decomposition on multicomputers has relevant impact on the performance of the pivot search. In almost all the decompositions partial pivoting does not perform well due to an inherent load unbalancing. The authors propose to reduce load unbalancing by assigning extra work to idle processors, which leads to a new pivoting strategy, named ``row/column pivoting''.
0 references
matrix decomposition
0 references
row/column pivoting
0 references
multicomputers
0 references
performance
0 references
pivot search
0 references
load unbalancing
0 references
pivoting strategy
0 references
0.86774623
0 references
0.8429606
0 references
0.8337053
0 references
0.83292705
0 references
0.82586443
0 references
0.8249872
0 references