Stability of a pivoting strategy for parallel Gaussian elimination (Q5952352)
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: Stability of a pivoting strategy for parallel Gaussian elimination |
scientific article; zbMATH DE number 1688768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stability of a pivoting strategy for parallel Gaussian elimination |
scientific article; zbMATH DE number 1688768 |
Statements
Stability of a pivoting strategy for parallel Gaussian elimination (English)
0 references
19 August 2002
0 references
The stability of a parallel mechanism for carrying out partial pivoting is investigated. The theoretical results demonstrate that the upper bounds on the growth factor under the parallel strategy is bounded by \(3^{n-1}\), as compared to \(2^{n-1}\) for partial pivoting. There is no reason to conclude that Gaussian elimination with partial pivoting by adding will be significantly worse in practice than Gaussian elimination with partial pivoting.
0 references
Gaussian elimination
0 references
algorithm
0 references
growth factor
0 references
parallel computation
0 references
stability
0 references
partial pivoting
0 references
0.8180283904075623
0 references
0.8109025359153748
0 references
0.7944831252098083
0 references
0.7890741229057312
0 references
0.7785049676895142
0 references