The growth factor and efficiency of Gaussian elimination with rook pivoting

Gaussian elimination is among the most widely used tools in scientific computing. Gaussian elimination with partial pivoting requires only O(n2) comparisons beyond the work required in Gaussian elimination with no pivoting but can, in principle, have error growth that is exponential in the matrix size n. Gaussian elimination with complete pivoting, on the other hand, cannot have exponential error growth but requires O(n3) comparisons beyond the work required by Gaussian elimination with no pivoting. Numerical experiments suggest that Gaussian elimination with rook pivoting is between partial pivoting and complete pivoting in terms of efficiency and accuracy. In this paper we prove that rook pivoting cannot have exponential error growth. We also introduce a combination of partial pivoting and rock pivoting which we call Gaussian elimination with partial rook pivoting and we prove the partial rook pivoting cannot have exponential error growth. We include numerical experiments showing that on a serial computer the run times for cook pivoting are almost always close to those of partial pivoting and the run times for partial rook pivoting appear to be the same as those of partial pivoting.