ILU preconditioning based on the FAPINV algorithm
Davod Khojasteh Salkuyeh, Amin Rafiei, Hadi Roohani
Abstract
Open-access reader
Davod Khojasteh Salkuyeh, Amin Rafiei, Hadi Roohani
Abstract
Open-access reader
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.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Mathematics, Algorithm