A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods

Authors:
Jan Mayer
Affiliations:
Universiät Karlsruhe, Karlsruhe, Germany
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2009

Citing 15
Cited 1

Experimental study of ILU preconditioners for indefinite matrices

Journal of Computational and Applied Mathematics
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices

SIAM Journal on Matrix Analysis and Applications
Preconditioning Highly Indefinite and Nonsymmetric Matrices

SIAM Journal on Scientific Computing
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix

SIAM Journal on Matrix Analysis and Applications
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors

SIAM Journal on Scientific Computing
Crout Versions of ILU for General Sparse Matrices

SIAM Journal on Scientific Computing
Solving unsymmetric sparse systems of linear equations with PARDISO

Future Generation Computer Systems - Special issue: Selected numerical algorithms
Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems

SIAM Journal on Matrix Analysis and Applications
Multilevel ILU With Reorderings for Diagonal Dominance

SIAM Journal on Scientific Computing
Alternative Weighted Dropping Strategies for ILUTP

SIAM Journal on Scientific Computing
Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems

SIAM Journal on Scientific Computing
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

ACM Transactions on Mathematical Software (TOMS)
Symmetric Permutations for I-matrices to Delay and Avoid Small Pivots During Factorization

SIAM Journal on Scientific Computing

Combined compact difference scheme for linear second-order partial differential equations with mixed derivative

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent advances in multilevel LU factorizations and novel preprocessing techniques have led to an extremely large number of possibilities for preconditioning sparse, unsymmetric linear systems for solving with iterative methods. However, not all combinations work well for all systems, so making the right choices is essential for obtaining an efficient solver. The numerical results for 256 matrices presented in this article give an indication of which approaches are suitable for which matrices (based on different criteria, such as total computation time or fill-in) and of the differences between the methods.