Some numerical results about the solution of sparse linear systems

Abstract

The paper compares two Pascal programs that solve unsymmetric (very) sparse linear systems by applying, respectively, Gaussian elimination with partial pivoting and Gauss-Jordan reduction. The comparison involves both the CPU times and the storage requirements.