A new pivoting strategy for Gaussian elimination (Q1915612)
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: A new pivoting strategy for Gaussian elimination |
scientific article; zbMATH DE number 894240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new pivoting strategy for Gaussian elimination |
scientific article; zbMATH DE number 894240 |
Statements
A new pivoting strategy for Gaussian elimination (English)
0 references
5 December 1996
0 references
The following task is discussed: Given a matrix \(A\), find diagonal matrices \(D_1\), \(D_2\) such that the matrix \(\overline A = D_1 AD_2\) has the following form: All coefficients are of absolute value at most 1, and there are \(n\) elements of absolute value 1, no two of which lie in the same row or column. The worst case complexity of a corresponding method is \(O(n^3)\). Some experimental results show that a good pivoting sequence in the general situation is given.
0 references
matrix scaling
0 references
pivoting strategy
0 references
Gaussian elimination
0 references
worst case complexity
0 references
