Year: 2021
Author: Daniele Boffi, Zhongjie Lu, Luca F. Pavarino
Journal of Computational Mathematics, Vol. 39 (2021), Iss. 4 : pp. 633–654
Abstract
Iterative ILU factorizations are constructed, analyzed and applied as preconditioners to solve both linear systems and eigenproblems. The computational kernels of these novel Iterative ILU factorizations are sparse matrix-matrix multiplications, which are easy and efficient to implement on both serial and parallel computer architectures and can take full advantage of existing matrix-matrix multiplication codes. We also introduce level-based and threshold-based algorithms in order to enhance the accuracy of the proposed Iterative ILU factorizations. The results of several numerical experiments illustrate the efficiency of the proposed preconditioners to solve both linear systems and eigenvalue problems.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/jcm.2009-m2020-0138
Journal of Computational Mathematics, Vol. 39 (2021), Iss. 4 : pp. 633–654
Published online: 2021-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 22
Keywords: Iterative ILU factorization Matrix-matrix multiplication Fill-in Eigenvalue problem Parallel preconditioner.