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

Jan Mayer | Zendy

Open Access

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

Author(s) -

Jan Mayer

Publication year - 2009

Publication title -

acm transactions on mathematical software

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.767

H-Index - 87

eISSN - 1557-7295

pISSN - 0098-3500

DOI - 10.1145/1486525.1486526

Subject(s) - computer science , solver , preprocessor , linear system , computation , iterative method , sparse matrix , algorithm , matrix free methods , iterative refinement , numerical linear algebra , numerical analysis , mathematical optimization , mathematics , artificial intelligence , mathematical analysis , physics , quantum mechanics , gaussian , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research