A new pivoting strategy for Gaussian elimination Original Research Article

This paper discusses a method for determining a good pivoting sequence for Gaussian elimination, based on an algorithm for solving assignment problems. The worst case complexity is O(n3); in practice O(n2.25) operations are sufficient.