Research Article  Open Access
A Posteriori Error Estimates for the Generalized Overlapping Domain Decomposition Methods
Abstract
A posteriori error estimates for the generalized overlapping domain decomposition method (GODDM) (i.e., with Robin boundary conditions on the interfaces), for second order boundary value problems, are derived. We show that the error estimate in the continuous case depends on the differences of the traces of the subdomain solutions on the interfaces. After discretization of the domain by finite elements we use the techniques of the residual a posteriori error analysis to get an a posteriori error estimate for the discrete solutions on subdomains. The results of some numerical experiments are presented to support the theory.
1. Introduction
We consider the generalized overlapping domain decomposition method that is, with Robin transmission conditions on the interfaces [1, 2] for second order boundary value problems on a bounded domain with Dirichlet boundary conditions. The a priori estimate of the error is given in several papers, see for instance Lions [3] in which a variational formulation of the classical Schwarz method is derived. In Chan et al. [4] a geometry related convergence results are obtained. Douglas and Huang [1] studied the accelerated version of the GODDM, Engquist and Zhao [2] studied the convergence for simple (rectangular or circular) geometries; however, these authors did not give a criterion to stop the iterative process. All these results can also be found in the recent books on domain decomposition methods of Quarteroni and Valli [5], Toselli and Widlund [6]. Recently Maday and Magoulès [7, 8] presented an improved version of the Schwarz method for highly heterogeneous media. This method uses new optimized interface conditions specially designed to take into account the heterogeneity between the subdomains on the interfaces. A recent overview of the current state of the art on domain decomposition methods can be found in two special issues of the computer methods in applied mechanics and engineering journal, edited by Farhat and Le Tallec [9], Magoulès and Rixen [10] and in Nataf [11].
In general, the a priori estimate is not suitable for assessing the quality of the approximate solution on subdomains since it depends mainly on the exact solution itself which is unknown. The alternative approach is to use the approximate solution itself in order to find such an estimate. This approach, known as a posteriori estimate, became very popular in the nineties of the last century with finite element methods, see the monographs [12, 13] and the references therein. In their paper Otto and Lube [14] gave an a posteriori estimate for a nonoverlapping domain decomposition algorithm that said that “the better the local solutions fit together at the interface the better the errors of the subdomain solutions will be.” This error estimate enables us to know with certainty when one must stop the iterative process as soon as the required global precision is reached. A posteriori error analysis was also used by Bernardi et al. [15] to determine an optimal value of the penalty parameter for penalty domain decomposition methods to construct fast solvers.
In various situations it is better to use overlapping decompositions for faster convergence rate, for example, the case of decomposition into simple subdomains where uniform discretizations are possible. So the aim of this paper is to show that a similar result to that in [14], in the case of the GODDM, holds. It is obtained via the introduction of two auxiliary problems defined each over two nonoverlapping subdomains. These auxiliary problems are needed for the analysis and not for the computation.
The paper is organized as follows. In Section 1, we introduce some necessary notations, then we give a variational formulation of our model problem. We establish, in Section 2, a stopping criterion for the iterative process in the continuous case. In Section 3, an a posteriori error estimate is proposed for the convergence of the discretized solution using the finite element method on subdomains. We conclude this section by an adaptation of the techniques of the residual a posteriori error analysis to give an a posteriori estimate in the discrete case.
1.1. Problem Formulation and Domain Decomposition Method
Let be a bounded domain in with a piecewise boundary . We denote and the usual inner product and norm of . Let be the usual Sobolev space with norm and seminorm ; is the subspace of functions of vanishing on .
Let and be two subdomains of (to be defined later), when we need the space which is a subspace of ; equipped with the norm On the subdomain we use the space which has as a trace space , . By we denote the inner product of .
Let us consider the following model problem: The variational formulation of this problem is given by where and for all . We split the domain into two overlapping subdomains and such that
The generalized overlapping domain decomposition method is written as follows: set in and construct the sequence , in parallel for where is the exterior normal to and is a real parameter, .
The convergence of the GODDM (1.5) and (1.6) is proved in [2, 5]. Our main interest is to obtain an a posteriori error estimate we need for stopping the iterative process as soon as the required global precision is reached.
The weak formulations of problems (1.5), (1.6) are given, respectively, by where is defined above. It can also be written as
2. A Posteriori Error Estimate in the Continuous Case
Since it is numerically easier to compare the subdomain solutions on the interfaces and rather than on the overlap , thus we need to introduce two auxiliary problems defined on nonoverlapping subdomains of . This idea allows us to obtain the a posteriori error estimate by following the steps of Otto and Lube [14]. We get these auxiliary problems by coupling each one of the problems (1.5) and (1.6) with another problem in a nonoverlapping way over . These auxiliary problems are needed for the analysis and not for the computation, to get the estimate. We see that we can go from the GODDM to a couple of nonoverlapping domain decomposition methods with Robin boundary conditions on the interfaces and . To define these auxiliary problems we need to split the domain into two sets of disjoint subdomains: and , see Figure 1, such that
(a)
(b)
Let be the solutions of problems (1.5), (1.6). We define the couple over to be the solution of the following nonoverlapping problems: We can write on (in the 3rd equation in (2.2)) that is, is the difference between the overlapping and the nonoverlapping solutions and (in problems (1.5)(1.6) and (2.2)(2.3), resp.) in . Because both overlapping and nonoverlapping problems converge, see [2, 5] that is, and tend to , should tend to naught an tends to infinity in .
By multiplying the first equation in (2.2) by and integrating by parts we obtain where is given by On the other hand, using the last equation in (2.3) and putting we get where . From this result we can write the following algorithm which is equivalent to the auxiliary nonoverlapping problem (2.2)(2.3). We need this algorithm and two lemmas for obtaining an a posteriori error estimate for this problem.
Algorithm 2.1. The sequences solutions of problems (2.2), (2.3) satisfy the following domain decomposition algorithm denoted ALG.G.D.D.M.(1)Let be an initial value, is the dual of .(2)Given solve for , : Find solutions of (3)Compute new data , from (4)Set , go to Step .
Lemma 2.2. Let , and . Then for , the following relations hold
The proof follows directly from steps 2 and 3 of ALG.G.D.D.M.
Lemma 2.3. By letting be a generic constant which has different values at different places one get for
Proof. Using (2.10) and the fact that the trace mapping and its inverse are continuous, we obtain On the otherhand we have This ends the proof.
Based on the previous two lemmas, we can obtain the following a posteriori error estimate for the nonoverlapping domain decomposition problem (2.2)(2.3).
Proposition 2.4. For the sequences solutions of problems (2.2), (2.3) one has the following a posteriori error estimation
Proof. From (2.10) and (2.11) we have Taking and , then using Lemma 2.3 we get which is the required result.
In the similar way, we define another nonoverlapping auxiliary problem over . The sequences are solutions of where we can write on (in the 3rd equation in (2.18)) that is, is the difference between the overlapping and the nonoverlapping solutions and (in problems (1.5)(1.6) and (2.18)(2.19) resp.) in . As both sequences and converge towards , should tend to naught as tends to infinity. Using Lemmas 2.2 and 2.3 over we obtain the a posteriori error estimate for this auxiliary problem.
Proposition 2.5. For the sequences solutions of problems (2.18), (2.19) one has the following a posteriori error estimate
Remark 2.6. We remark from Propositions 2.4 and 2.5 that we can go from sequences of solutions to problems (1.5) and (1.6) to sequences of solutions to problems generated by nonoverlapping domain decomposition problems of Robin type transmission conditions across the interfaces and . This result enable us to compare the subdomain iterations of the GODDM on the interfaces and rather than on the overlap region .
In the following theorem we are going to use this fact to obtain an a posteriori error estimate for the continuous generalized overlapping domain decomposition method (1.5)(1.6).
Theorem 2.7. Let where is the solution of problem (1.2). For the sequences solutions of problems (1.5) and (1.6), one has the following a posteriori error estimate
Proof. We use two auxiliary problems defined each over two nonoverlapping subdomains of . These two problems are defined over and , respectively. From the previous two propositions we have From the definitions of and , we have which is the required result.
3. A Posteriori Error Estimate in the Discrete Case
In this section, we consider the discretization of the variational problems (1.7) and (1.8). Let be a triangulation of compatible with the decomposition and is the subspace of continuous functions (polynomials of degree , ) which vanish over . We have is a subspace of which consists of continuous piecewise polynomial functions on which vanish at the end points of .
Let be the solution of the discrete problem associated with (1.3), . We construct the sequences solutions of the discrete versions of (1.5) and (1.6) at the iteration, that is, In a similar manner to that of Section 2, we introduce two discrete auxiliary problems, one over , , the other over , . We let We can write on (in the 3rd equation in (3.4)), that is, is the difference between the discrete overlapping and the nonoverlapping solutions and (in problems (3.2)(3.3) and (3.4)(3.5) resp.,) in . Because both and converges to should tend to naught as tends to infinity.
Similarly, over , we consider the sequences solutions of the following discrete problems: where we can also write on , tends to naught as tends to infinity as explained for the previous problems. We can obtain the discrete counterparts of Propositions 2.4 and 2.5 by doing almost the same analysis as in Section 2 (i.e., passing from continuous spaces to discrete subspaces and from continuous sequences to discrete ones). Therefore where the discrete trace subspace norm defined over is taken to be Hence, using the previous two inequalities, we have We remark that (3.10) is the discrete version of (2.21).
Remark 3.1. Let us note that (3.10) is an estimate of the error between the approximate solution and the approximate solution of the discretized overlapping domain decomposition algorithm .
Next we will obtain an estimate of the error between the approximate solution and the exact solution . We introduce some necessary notations. We denote by
For every and , we define
For a function which is not necessarily continuous across two neighboring elements of having as a common side, denotes the jump of across and the normal vector of .
We have the following theorem which gives the a posteriori error estimate for the discrete GODDM.
Theorem 3.2. Let where is the solution of problem (1.2), the sequences are solutions of problems (3.2)(3.3). Then there exists a constant independent of such that where The symbol * corresponds to when and to when .
Proof. The proof is based on the technique of the residual a posteriori estimation (see [13]) and Theorem 2.7. We give the main steps. By the triangle inequality we have The second term on the righthand side of (3.15) is bounded as in (3.10) by To bound the first term on the r.h.s of (3.15) we use the residual equation and apply the technique of the residual a posteriori error estimation, see [13], to get for and where is any approximation of by polynomials of degree at most , therefore We use the fact that Finally, by combining (3.15), (3.18), and (3.19) the required result follows.
3.1. Numerical Examples
As an illustration of the theoretical results obtained in this article and to be able to use the a posteriori error estimate (3.10), we consider the following problem with for the first and second examples and for the third example (i.e., an shaped region). The exact solution is taken to be for the first example, for the second example, and finally = for the third example.
We first compute the bilinear Galerkin solution over and then apply the generalized overlapping domain decomposition method (1.7)(1.8) to compute the bilinear sequences to be able to look at the behavior of the constant within (3.10) as the mesh size becomes small . We take and for the first and second examples. As for the third example we have and . We denote by The generalized overlapping domain decomposition method, with , converges. The iterations have been stopped when the relative error between two subsequent iterates is less than .
The Quotient in Tables 1, 2, 3, 4, 5, and 6 represents an estimate of the constant in (3.10). It happens to tend to a constant value around 1 which what we expect (i.e., we have asymptotic exactness). We present, for each example, results with and without the a posteriori estimate as a stopping criteria. We see that we obtain the same results but with less iterations when using the a posteriori estimate as a stopping criteria for a moderately small mesh size for the first and third examples. But for the second example, the difference in iteration count is clear between the two approaches.


