ILU Preconditioning Based on the FAPINV Algorithm
This work offers a new preconditioning method for solving linear systems, but it is incremental as it applies an existing algorithm (FAPINV) to a known problem (ILU preconditioning).
The paper presents a technique for computing an ILU preconditioner based on the FAPINV algorithm, showing it is well-defined for H-matrices and yields reliable solvers when used with GMRES. Numerical experiments demonstrate efficiency on test matrices.
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.