volume 28, issue 3, P301-324 2002
DOI: 10.1145/569147.569149
View full text
|
Sign up to set email alerts
|
Share

Abstract: During the past few years, algorithmic improvements alone have reduced the time required for the direct solution of unsymmetric sparse systems of linear equations by almost an order of magnitude. This paper compares the performance of some well-known software packages for solving general sparse systems. In particular, it demonstrates the consistently high level of performance achieved by WSMP-the most recent of such solvers. It compares the various algorithmic components of these solvers and discusses their i…

Expand abstract