4.10 Computational Complexity of Pivoting

Obviously, complete pivoting and partial pivoting differ substantially with regard to the computational effort required to determine the next pivot element. Complete pivoting on a dense, asymmetric matrix is an O(n3) operation requiring


floating point comparisons. Partial pivoting on the same matrix is an O(n2) operation requiring


floating point comparisons.