2021
DOI: 10.2118/203991-pa
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Sequential Fully Implicit Domain-Decomposition Solver

Abstract: Summary Modern reservoir simulation must handle complex compositional fluid behavior, orders-of-magnitude variations in rock properties, and large velocity contrasts. We investigate how one can use nonlinear domain-decomposition preconditioning to combine sequential and fully implicit (FI) solution strategies to devise robust and highly efficient nonlinear solvers. A full simulation model can be split into smaller subdomains that each can be solved independently, treating variables in all other … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 41 publications
0
3
0
Order By: Relevance
“…The multiplicative Schwarz method has been used to split boundary value problems (BVP) into subproblems solver on smaller physical domains [29][30][31][32][33]. It has also been used to split a coupled BVP into subproblems based on the physics [34][35][36], each subproblem being solved on the full domain to update one of the fields (here, pressure and saturation).…”
Section: Field-split Multiplicative Schwarz Newton Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The multiplicative Schwarz method has been used to split boundary value problems (BVP) into subproblems solver on smaller physical domains [29][30][31][32][33]. It has also been used to split a coupled BVP into subproblems based on the physics [34][35][36], each subproblem being solved on the full domain to update one of the fields (here, pressure and saturation).…”
Section: Field-split Multiplicative Schwarz Newton Methodsmentioning
confidence: 99%
“…Given k ∈ N * the outer-loop iteration number Given k−1 s ∈ [0, 1[ the tolerance used at outer-loop iteration k − 1 ( 0 = 1) Compute η k using (30), or (31), or (32) Compute the new tolerance…”
Section: Algorithm 3 Transport Inner Loop With Adaptive Tolerancementioning
confidence: 99%
See 1 more Smart Citation