A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
Autor: | Yiming Bu, Ting-Zhu Huang, Zhao-Li Shen, Bruno Carpentieri |
---|---|
Přispěvatelé: | Computational and Numerical Mathematics |
Rok vydání: | 2016 |
Předmět: |
Mathematical optimization
Linear systems 010103 numerical & computational mathematics 02 engineering and technology Incomplete Cholesky factorization Preconditioners ILU 01 natural sciences Precondition ARMS Factorization Multilevel reordering algorithms FOS: Mathematics 0202 electrical engineering electronic engineering information engineering Mathematics - Numerical Analysis 0101 mathematics Sparse approximate inverse methods Mathematics Numerical Analysis APPROXIMATE INVERSE PRECONDITIONER Preconditioner ELECTROMAGNETIC PROBLEMS Applied Mathematics Linear system 020206 networking & telecommunications Numerical Analysis (math.NA) SOLVERS Incomplete LU factorization Solver Computer Science::Numerical Analysis PARALLEL IMPLEMENTATION Computational Mathematics Schur complement PRIORI SPARSITY PATTERNS Iterative solvers MATRIX |
Zdroj: | Applied numerical mathematics, 104, 141-157. ELSEVIER SCIENCE BV |
ISSN: | 0168-9274 |
Popis: | 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 types, 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. (C) 2016 IMACS. Published by Elsevier B.V. All rights reserved. |
Databáze: | OpenAIRE |
Externí odkaz: |