We report on an extensive experiment to compare an iterative solver preconditioned by several versions of incomplete LU factorization with a sparse direct solver using LU factorization with partial pivoting. Our test suite is 24 nonsymmetric matrices drawn from benchmark sets in the literature. On a few matrices, the best iterative method is more than 5 times as fast and more than 10 times as memory-efficient as the direct method. Nonetheless, in most cases the iterative methods are slower; in many cases they do not save memory; and in general they are less reliable. Our primary conclusion is that a direct method is currently more appropriate than an iterative method for a general-purpose black-box nonsymmetric linear solver. We draw several other conclusions about these nonsymmetric problems: pivoting is even more important for incomplete than for complete factorizations; the best iterative solutions almost always take only 8 to 16 iterations; a drop-tolerance strategy is superior to a column-count strategy; and column MMD ordering is superior to RCM ordering. The reader is advised to keep in mind that our conclusions are drawn from experiments with 24 matrices; other test suites might have given somewhat different results. Nonetheless, we are not aware of any other studies more extensive than ours.
[1]
J. Gilbert,et al.
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
,
1986
.
[2]
I. Duff,et al.
The effect of ordering on preconditioned conjugate gradients
,
1989
.
[3]
Alex Pothen,et al.
Computing the block triangular form of a sparse matrix
,
1990,
TOMS.
[4]
Youcef Saad,et al.
A Basic Tool Kit for Sparse Matrix Computations
,
1990
.
[5]
Joseph W. H. Liu,et al.
Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
,
1993,
SIAM J. Sci. Comput..
[6]
Y. Shapira.
A multi-level method for sparse linear systems
,
1997
.
[7]
Y. Saad,et al.
Experimental study of ILU preconditioners for indefinite matrices
,
1997
.
[8]
Marcus J. Grote,et al.
Parallel Preconditioning with Sparse Approximate Inverses
,
1997,
SIAM J. Sci. Comput..
[9]
James Demmel,et al.
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
,
1997,
SIAM J. Matrix Anal. Appl..
[10]
James Demmel,et al.
A Supernodal Approach to Sparse Partial Pivoting
,
1999,
SIAM J. Matrix Anal. Appl..
[11]
William Gropp,et al.
PETSc 2.0 users manual
,
2000
.