Opuscula Math. 35, no. 2 (2015), 235-250
http://dx.doi.org/10.7494/OpMath.2015.35.2.235

 
Opuscula Mathematica

ILU preconditioning based on the FAPINV algorithm

Davod Khojasteh Salkuyeh
Amin Rafiei
Hadi Roohani

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.

Full text (pdf)

  • Davod Khojasteh Salkuyeh
  • University of Guilan, Faculty of Mathematical Sciences, Rasht, Iran
  • Amin Rafiei
  • Hakim Sabzevari University, Department of Mathematics, P.O. Box. 397, Sabzevar, Iran
  • Hadi Roohani
  • Malek Ashtar University of Technology, Department of Mathematics, Shahin Shar, Isfahan, P.O. Box 83145-115, Iran
  • Received: 2014-04-25.
  • Revised: 2014-05-27.
  • Accepted: 2014-06-07.
Opuscula Mathematica - cover

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.

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.