Average-case analysis of the Gaussian elimination with partial pivoting

The Gaussian elimination with partial pivoting (GEPP) is a classical algorithm for solving systems of linear equations. Although in specific cases the loss of precision in GEPP due to roundoff errors can be very significant, empirical evidence strongly suggests that for a typical square coefficient matrix, GEPP is numerically stable. We obtain a (partial) theoretical justification of this phenomenon by showing that, given the random \(n\times n\) $n\times n$ standard Gaussian coefficient matrix A, the growth factor of the Gaussian elimination with partial pivoting is at most polynomially large in n with probability close to one. This implies that with probability close to one the number of bits of precision sufficient to solve \(Ax = b\) $Ax=b$ to m bits of accuracy using GEPP is \(m+O(\log n)\) $m+O(logn)$ , which improves an earlier estimate \(m+O(\log ^2 n)\) $m+O({log}^{2}n)$ of Sankar, and which we conjecture to be optimal by the order of magnitude. We further provide tail estimates of the growth factor which can be used to support the empirical observation that GEPP is more stable than the Gaussian Elimination with no pivoting.