A pivot ordering algorithm aimed at minimizing computation time

An optimal pivot ordering algorithm is proposed for the solution of sparse systems of equations using the Crout method. The purpose of this algorithm is to minimize the computation time, where it takes into account the machine cycles of the four rules of arithmetic. The Markowitz strategy is used as a basic rule, and the total computation time of the LU decomposition, of the forward elimination, and of the backward substitution is used as a tie-break rule. Comparison is made with three other known algorithms.