A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination

Abstract

A large number of pivotal strategies for use in conjunction with Gaussian elimination for solving sparse systems of linear equations are compared on the grounds of how well they preserve sparsity, how many arithmetic operations they involve and their computational cost. Conclusions are based mainly on the results obtained on test problems.