A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems

Bu, Y., Carpentieri, B. ORCID: 0000-0002-0516-0033, Shen, Z. and Huang, T.-Z., 2016. A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems. Applied Numerical Mathematics, 104, pp. 141-157. ISSN 0168-9274

[img]
Preview
Text
5381_Carpentieri.pdf - Post-print

Download (1MB) | Preview

Abstract

In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine factorization techniques of both implicit and explicit type, recursive combinatorial algorithms, multilevel mechanisms and overlapping strategies to maximize sparsity in the inverse factors and consequently reduce the factorization costs. Numerical experiments demonstrate the good potential of the proposed solver to precondition effectively general linear systems, also against other state-of-the-art iterative solvers of both implicit and explicit form.

Item Type: Journal article
Publication Title: Applied Numerical Mathematics
Creators: Bu, Y., Carpentieri, B., Shen, Z. and Huang, T.-Z.
Publisher: Elsevier
Date: June 2016
Volume: 104
ISSN: 0168-9274
Identifiers:
NumberType
10.1016/j.apnum.2015.12.007DOI
Divisions: Schools > School of Science and Technology
Depositing User: Linda Sullivan
Date Added: 20 May 2016 09:08
Last Modified: 09 Jun 2017 14:02
URI: http://irep.ntu.ac.uk/id/eprint/27835

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year