ILU Preconditioning Based on the FAPINV Algorithm
classification
🧮 math.NA
cs.NA
keywords
algorithmfapinvpreconditionersolverscomputingconjunctionefficiencyexperiments
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.