2015
DOI: 10.5540/03.2015.003.01.0093
|View full text |Cite
|
Sign up to set email alerts
|

An algebraic ILU(k) based two-level domain decomposition preconditioner

Abstract: With the ultimate goal of designing a scalable parallel preconditioner for reservoir simulation problems, we combine domain decomposition ideas (prove suitable for parallelization) with incomplete factorizations (which are standard in reservoir simulation) at subdomain level. We introduce an ILU(k)-based two-level domain decomposition preconditioner and compare its performance with a two-level ILU(k)-Block-Jacobi preconditioner.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
3
0
2

Year Published

2017
2017
2018
2018

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 3 publications
0
3
0
2
Order By: Relevance
“…O passo 4 constrói o complemento de Schur através de um produto incompleto comoé descrito em [1]. A submatriz A ΓΓé formada pelas interfaces dos subdomínios e portanto…”
Section: Implementação Paralelaunclassified
See 1 more Smart Citation
“…O passo 4 constrói o complemento de Schur através de um produto incompleto comoé descrito em [1]. A submatriz A ΓΓé formada pelas interfaces dos subdomínios e portanto…”
Section: Implementação Paralelaunclassified
“…Conforme descrito em [1], T Jé um operador diagonal, assim podemos construí-lo como um vetor, quéé aplicado através do produto entrada a entrada. O resultadoé então somado globalmente em z Γ .…”
Section: Implementação Paralelaunclassified
“…This paper discusses the formulation and the parallel implementation of an algebraic ILU(k)based two-level domain decomposition preconditioner first introduced in [2].…”
Section: Introductionmentioning
confidence: 99%
“…Due to the difficulty in parallelizing ILU(k), it is quite natural to combine ILU(k) and block-Jacobi, so much so that this combination constitutes PETSc's default parallel preconditioner [3]. The algorithm proposed in [2], whose parallel implementation we discuss in this article, seeks to combine the use of (sequential) ILU(K) with two ideas borrowed from domain decomposition methods: (i) the introduction of an interface that connects subdomains, allowing, as opposed to block-Jacobi, for the interaction between subdomains to be taken into account, and (ii) the introduction of a second level, associated to a coarse version of the problem, that speeds up the resolution of low frequency modes. These improvements come at the cost of greater communication, requiring a more involved parallel implementation.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation