An optimal pivoting order for the solution of sparse systems of equations

Analytic expressions for finding fill-in, the number of nonzero elements that change in value, and the number of "long operations" during each step of the LU decomposition are given. A new optimal pivot ordering algorithm is proposed which leads to a reduction of the overall fill-in and long operation count. Comparison is made with two other known algorithms.