A new pivoting strategy for Gaussian elimination
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.
scientific article; zbMATH DE number 894240