TY - JOUR

T1 - Scaling up through domain decomposition

AU - Pechstein, C

AU - Scheichl, R

PY - 2009/10

Y1 - 2009/10

N2 - In this article, we discuss domain decomposition parallel iterative solvers for highly heterogeneous problems of flow and transport in porous media. We are particularly interested in highly unstructured coefficient variation where standard periodic or stochastic homogenization theory is not applicable. When the smallest scale at which the coefficient varies is very small, it is often necessary to scale up the equation to a coarser grid to make the problem computationally feasible. Standard upscaling or multiscale techniques require the solution of local problems in each coarse element, leading to a computational complexity that is at least linear in the global number N of unknowns on the subgrid. Moreover, except for the periodic and the isotropic random case, a theoretical analysis of the accuracy of the upscaled solution is not yet available. Multilevel iterative methods for the original problem on the subgrid, such as multigrid or domain decomposition, lead to similar computational complexity (i.e. O(N)) and are therefore a viable alternative. However, previously no theory was available guaranteeing the robustness of these methods to large coefficient variation. We review a sequence of recent papers where simple variants of domain decomposition methods, such as overlapping Schwarz and one-level FETI, are proposed that are robust to strong coefficient variation. Moreover, we also extend the theoretical results, for the first time, to the dual-primal variant of FETI.

AB - In this article, we discuss domain decomposition parallel iterative solvers for highly heterogeneous problems of flow and transport in porous media. We are particularly interested in highly unstructured coefficient variation where standard periodic or stochastic homogenization theory is not applicable. When the smallest scale at which the coefficient varies is very small, it is often necessary to scale up the equation to a coarser grid to make the problem computationally feasible. Standard upscaling or multiscale techniques require the solution of local problems in each coarse element, leading to a computational complexity that is at least linear in the global number N of unknowns on the subgrid. Moreover, except for the periodic and the isotropic random case, a theoretical analysis of the accuracy of the upscaled solution is not yet available. Multilevel iterative methods for the original problem on the subgrid, such as multigrid or domain decomposition, lead to similar computational complexity (i.e. O(N)) and are therefore a viable alternative. However, previously no theory was available guaranteeing the robustness of these methods to large coefficient variation. We review a sequence of recent papers where simple variants of domain decomposition methods, such as overlapping Schwarz and one-level FETI, are proposed that are robust to strong coefficient variation. Moreover, we also extend the theoretical results, for the first time, to the dual-primal variant of FETI.

UR - http://www.scopus.com/inward/record.url?scp=71049130396&partnerID=8YFLogxK

UR - http://dx.doi.org/10.1080/00036810903157204

U2 - 10.1080/00036810903157204

DO - 10.1080/00036810903157204

M3 - Article

VL - 88

SP - 1589

EP - 1608

JO - Applicable Analysis

JF - Applicable Analysis

SN - 0003-6811

IS - 10-11

ER -