ILU Preconditioning Based on the FAPINV Algorithm
Davod Khojasteh Salkuyeh, Amin Rafiei, Hadi Roohani
TL;DR
This paper introduces an ILU preconditioning method based on the FAPINV algorithm, which is effective for H-matrices and enhances the reliability of Krylov-subspace iterative solvers like GMRES, demonstrated through numerical tests.
Contribution
The paper presents a novel ILU preconditioner derived from the FAPINV algorithm, specifically effective for H-matrices and compatible with Krylov subspace methods.
Findings
Effective for H-matrices
Improves reliability of GMRES solver
Numerical tests show efficiency
Abstract
A technique for computing an ILU preconditioner based on the 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Electromagnetic Scattering and Analysis · Electromagnetic Simulation and Numerical Methods