Opuscula Mathematica
Opuscula Math. 35, no. 2 (), 235-250
Opuscula Mathematica

ILU preconditioning based on the FAPINV algorithm

Abstract. A technique for computing an ILU preconditioner based on the factored approximate inverse (FAPINV) algorithm is presented. We show that this algorithm is well-defined for H-matrices. Moreover, when used in conjunction with Krylov-subspace-based iterative solvers such as the GMRES algorithm, results in reliable solvers. Numerical experiments on some test matrices are given to show the efficiency of the new ILU preconditioner.
Keywords: system of linear equations, preconditioner, FAPINV, ILU preconditioner, H-matrix, GMRES.
Mathematics Subject Classification: 65F10, 65F50.
Cite this article as:
Davod Khojasteh Salkuyeh, Amin Rafiei, Hadi Roohani, ILU preconditioning based on the FAPINV algorithm, Opuscula Math. 35, no. 2 (2015), 235-250, http://dx.doi.org/10.7494/OpMath.2015.35.2.235
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.