An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems

In this paper, we consider the problem of solving a sparse nonsingular system of linear equations. We show that the structures of the triangular matrices obtained in the $LU$-decomposition of a sparse nonsingular matrix A using Gaussian elimination with partial pivoting are contained in those of the Cholesky factors of $A^T A$, provided that the diagonal elements of A are nonzero. Based on this result, a method for solving sparse linear systems is then described. The main advantage of this method is that the numerical computation can be carried out using a static data structure. Numerical experiments comparing this method with other implementations of Gaussian elimination for solving sparse linear systems are presented and the results indicate that the method proposed in this paper is quite competitive with other approaches.

[1]  Iain S. Duff.  Analysis of sparse systems , 1972 .

[2]  John K. Reid,et al.  An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix , 1978, TOMS.

[3]  Andrew H. Sherman,et al.  Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4] , 1978, TOMS.

[4]  Alan George,et al.  The Design of a User Interface for a Sparse Matrix Package , 1979, TOMS.

[5]  John K. Reid,et al.  Some Design Features of a Sparse Matrix Code , 1979, TOMS.

[6]  Z. Zlatev.  On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique , 1980 .

[7]  Iain S. Duff,et al.  MA28 --- A set of Fortran subroutines for sparse unsymmetric linear equations , 1980 .

[8]  A. George,et al.  Solution of sparse linear least squares problems using givens rotations , 1980 .

[9]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[10]  Alan George,et al.  Computer Solution of Large Sparse Positive Definite , 1981 .

[11]  Iain S. Duff,et al.  Algorithm 575: Permutations for a Zero-Free Diagonal [F1] , 1981, TOMS.

[12]  Stanley C. Eisenstat,et al.  Yale sparse matrix package I: The symmetric codes , 1982 .

[13]  Iain S. Duff,et al.  The design and use of a frontal scheme for solving sparse unsymmetric equations , 1982 .

[14]  M. Heath.  Some Extensions of an Algorithm for Sparse Linear Least Squares Problems , 1982 .

[15]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[16]  A. George,et al.  A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems , 1983 .

[17]  Michael T. Heath,et al.  Solution of Sparse Underdetermined Systems of Linear Equations , 1984 .

[18]  Iain S. Duff,et al.  The Multifrontal Solution of Unsymmetric Sets of Linear Equations , 1984 .