A BDDC algorithm for the mortar-type rotated FEM for elliptic problems with discontinuous coefficients
Boundary Value Problems volume 2014, Article number: 79 (2014)
In this paper, we propose a BDDC preconditioner for the mortar-type rotated finite element method for second order elliptic partial differential equations with piecewise but discontinuous coefficients. We construct an auxiliary discrete space and build our algorithm on an equivalent auxiliary problem, and we present the BDDC preconditioner based on this constructed discrete space. Meanwhile, in the framework of the standard additive Schwarz methods, we describe this method by a complete variational form. We show that our method has a quasi-optimal convergence behavior, i.e., the condition number of the preconditioned problem is independent of the jumps of the coefficients, and depends only logarithmically on the ratio between the subdomain size and the mesh size. Numerical experiments are presented to confirm our theoretical analysis.
The method of balancing domain decomposition by constraints (BDDC) was first introduced by Dohrmann in . Mandel and Dohrmann restated the method in an abstract manner, and provided its convergence theory in . The BDDC method is closely related to the dual-primal FETI (FETI-DP) method , which is one of dual iterative substructuring methods. Each BDDC and FETI-DP method is defined in terms of a set of primal continuity. The primal continuity is enforced across the interface between the subdomains and provides a coarse space component of the preconditioner. In , Mandel, Dohrmann, and Tezaur analyzed the relation between the two methods and established the corresponding theory.
In the last decades, the two methods have been widely analyzed and successfully been extended to many different types of partial differential equations. In , the two algorithms for elliptic problems were rederived and a brief proof of the main result was given. A BDDC algorithm for mortar finite element was developed in , meanwhile, the author also extended the FETI-DP algorithm to elasticity problems and Stokes problems in [6, 7], respectively. These algorithms are based on locally conforming finite element methods, and the coarse space components of the algorithms are related to the cross-points (i.e., corners), which are often noteworthy points in domain decomposition methods (DDMs). Since the cross-points are related to more than two subregions, thus it is not convenient to design the domain decomposition algorithm.
The BDDC method derives from the Neumann-Neumann domain decomposition method (see ). The difference is that the BDDC method applies an additive rather than a multiplicative coarse grid correction, and substructure spaces have some constraints which result in non-singular subproblems. Thus we need not modify the bilinear forms on subdomains, and we can solve each subproblem and coarse problem in parallel.
The rotated element is an important nonconforming element. It was introduced by Rannacher and Turek in  for stokes equations originally, and it is the simplest example of a divergence-stable nonconforming element on quadrilaterals. Since its degree of freedom is integral average on element edge which is not related to the corners, and each degree of freedom on subdomain interfaces is only included in two neighboring subdomains, so it is easy to design the BDDC algorithm.
The mortar technique was introduced in . This method is nonconforming domain decomposition methods with nonoverlapping subdomains. The meshes on different subdomains need not align across subdomain interfaces, and the matching of discretizations on adjacent subdomains is only enforced weakly. This offers the advantages of freely choosing highly varying mesh sizes on different subdomains and is very promising to approximate the problems with abruptly changing diffusion coefficients or local anisotropic.
In this paper, we study the BDDC algorithm for the mortar-type rotated element for the second order elliptic problem with discontinuous coefficients, where the discontinuities lie only along the subdomain interfaces. Following the technique in , we construct an auxiliary discrete space and build our BDDC algorithm on an equivalent auxiliary problem. This approach overcomes the difficulty caused by the mortar condition and simplifies the implementation of the BDDC preconditioning iteration. Furthermore, since the rotated element is not related to the subdomain’s vertices, we can complete our theoretical analysis conveniently. It is proved that the condition number of the preconditioned operator is independent of the jumps of the coefficients and only depends logarithmically on the ratio between the subdomain size and mesh size. Numerical experiments are presented to confirm our theoretical analysis.
The rest of this paper is organized as follows: in Section 2, we introduce the model problem and the auxiliary problem. Section 3 gives the BDDC algorithm and proposes the BDDC preconditioner. Several technical tools are presented and analyzed in Section 4. In Section 5, we give the proof of the main result. Last section provides numerical experiments. For convenience, the symbols ⪯, ⪰ and ≍ are used, and , , and mean that , , and for some constants , , , and that are independent of discontinuous coefficients and mesh size.
Let be a bounded, simply connect rectangular or L-shaped domain, we divide Ω into several nonoverlapping regular rectangular subdomains , i.e., . Consider the following model problem: Find such that
, the coefficients () are piecewise positive constants over ().
For simplicity, we only consider the geometrically conforming case, i.e., the intersection between the closure of two different subdomains is empty, or a vertex, or an edge. The subdomains together form a coarse partition , we denote the diameter of each by . Let be a quasi-uniform partition with the mesh size , made up of shape regular rectangles in . The resulted partition can be nonmatched across adjacent subdomain interfaces. We denote the sets of edges of the triangulation in and by , respectively, and let , be the sets of vertices of the triangulation that are in , respectively.
For each triangulation , the rotated element space is defined by
Let the global discrete space . We equip the space with the following seminorm:
We denote the common open edge of and , and let . Each can be regarded as two sides corresponding to the two subdomains and . We define one of the sides of as mortar denoted by and the other one as nonmortar denoted by , here m represents the indexing of (see Figure 1). We assume that: (1) the mortar for is chosen by the condition ; (2) there is at least one subdomain which has two mortar sides associated with each cross point; (3) , i.e., is bounded. The first condition used in choosing mortar sides is essential (see the numerical tests in ). The last condition is technical but not essential for the convergence analysis. Along each , there are two independent and different 1-D meshes which are denoted by and . For each nonmortar side , we denote by an auxiliary test space whose functions are piecewise constant on . We denote by the -orthogonal projection from the space to the space.
Now we define the mortar-type rotated space as follows:
here is the restriction of to the mortar side , and is the restriction of to the nonmortar side . The condition in (2.2) for each interface is called mortar condition. The mortar-type rotated element approximation of problem (2.1) is: find such that
It can easily be shown that is positive definite on , which yields the existence and uniqueness of the discrete solution. The error estimate between the discrete and the continuous solution is discussed in .
Since the mortar condition depends on both the degrees of freedom on the interfaces and the ones near the interfaces, it is difficult to construct a preconditioner directly for (2.3). To overcome this difficulty, we introduce a new discrete space and an auxiliary problem which is equivalent to problem (2.3).
For each , we define an element that satisfies the following conditions:
for any ,(2.4)
for any ,(2.5)
where is a piecewise constant function on elements of such that for any . Note that the average value of on can be calculated by (2.5).
By the above definition, all associated with v form a space as
For the two related spaces and , we have the following result.
Lemma 2.1 ()
For any pair of , defined above, the following is true:
Now we introduce the auxiliary problem, that is, to find which satisfies
Define an operator by
From the above lemma, we only need to construct a preconditioner for the operator .
3 BDDC algorithm
In this section, we introduce our BDDC preconditioner for problem (2.7) and describe the BDDC algorithm.
We first define a discrete harmonic operator associated with the rotated element: for any , let such that
here . Let . We define ℋ as a corresponding piecewise harmonic operator on the auxiliary space by .
In order to introduce our domain decomposition method, we decompose the auxiliary discrete space as follows:
where the space is a piecewise harmonic function space defined as
We define a space . The space is between and , and our BDDC preconditioner is mainly constructed on this space.
As we know, the technical aspect in DDMs is that the preconditioner includes a coarse problem which can enhance the convergence. In view of the characteristic of the space , we select the standard coarse space which is the rotated finite element space associated with the coarse partition , and it satisfies primal constraints on subdomain interfaces.
The substructure space with constraints is defined by
Denote . The coarse space and the product space play an important role in the description and analysis of our iterative method.
To present our BDDC preconditioner, we introduce several space transfer operators. Define an interpolation operator by
The intergrid transfer operator is defined by
Define an extension operator as
for any , ;
for any , ;
for any , satisfies (2.5).
Its transpose is defined by
Denote by , the corresponding transpose is defined by
We also need to define another prolongation operator as follows:
if , then ;
if , , then ;
if , , , then ;
if , it follows from (2.5) that can be obtained by the edge average values on associated mortar sides;
In what follows, we describe our BDDC preconditioning algorithm, we apply the basic framework of additive Schwarz method (or parallel subspace correction method ). From the decomposition (3.1), we only need to choose appropriate subspace solvers.
First of all, the coarse subspace solver is defined by
On each subdomain, similar operators and are defined, respectively, by
Remark 3.1 The bilinear form on the coarse space can be different from that on substructure space, here we only use the exact solvers. On each subdomain, we avoid the possible singularity of local subproblem and we need not modify the bilinear forms.
Now we define our BDDC preconditioner as
where , is the corresponding transpose defined by
Let be an operator from to defined by
and be the operators from to and defined, respectively, by
Then the BDDC preconditioned operator can be written as
We have the following main result.
Theorem 3.1 The BDDC preconditioned operator satisfies
4 Technical tools
In this section we state and prove a few technical lemmas necessary for the proof of Theorem 3.1. Our theoretical analysis is based on the substructuring theory of conforming elements.
We assume be the bilinear conforming element space associated with the partition . We split the interface into four open edges ℰ, and define a restriction operator () as: for any
For the operator , we have the following result.
Lemma 4.1 ()
For an edge ℰ of , then for any , we have
Remark 4.1 The above lemma is related to vertex-edge-face arguments in substructuring methods, in view of the characteristic for the rotated element, here the results only concern the inequalities for faces.
Let be the conforming element space of bilinear continuous functions on the partition which is constructed by joining the midpoints of the edges of elements of . We now introduce a local equivalence map as follows (cf. ).
Definition 4.2 Given , we define by the values of at the vertices of the partition .
If P is a central point of E, , then
If P is a midpoint of one edge , , then
If , then
where the sum is taken over all edges with the common vertex P, , .
If , then
where and are the left and right neighbor edges of P, . If P is a vertex of , then .
Define the pseudo-inverse map by
where , , P is the midpoint of e. Obviously, we have
For the operators and , we have the following results (see ):
Lemma 4.3 For any , we can split into , and we have
where , and for any ,; for any , .
Proof By (4.1), Lemma 4.1, the inverse trace theorem, the trace theorem, and the Poincaré inequality, we obtain
where is a piecewise bilinear conforming element harmonic operator, and we have used the minimal energy property of discrete harmonic functions. □
5 Proof of Theorem 3.1
In the proof of Theorem 3.1 we use the abstract framework of ASM methods (see ), we need to prove three assumptions. Assumption II follows from the standard coloring argument, we only need to prove Assumption I and Assumption III.
First we show the following stability of the decomposition.
Lemma 5.1 (Assumption I)
For any , we have the following decomposition:
Proof First we show the decomposition (5.1). For any function , let and , obviously is a piecewise discrete harmonic function. So we denote , . From the definition of and , we have
and by the definition of , we get
where we have used the fact , . Hence and the equality (5.1) holds.
Now we prove the stability of decomposition (5.2). Let . Using Lemma 3.5 in , Poincaré-Friedrichs’ inequality and scaling argument, we derive
From (5.3) and the discrete equivalent norm, we have
Since is an orthogonal projection with respect to , we obtain
Meanwhile, from the fact that the harmonic function has minimal energy norm and (5.4)-(5.5), we deduce
So (5.4)-(5.6) lead to (5.2). □
Next we state the local stability as follows.
Lemma 5.2 (Assumption III)
For any , we have
For any , we have
Proof To prove (5.8) we first introduce a function associated with a mortar side , which satisfies the following:
for any , ;
for any , ;
for any , satisfies (2.5).
Then we can decompose as follows:
here we have used the fact that the degrees of freedom on the interface Γ of the function u are as same as that of , and the operator is defined by the average values on the edge elements, i.e.,
Note that the support of is on , and using Lemma 3.4 in  we have
Since the degrees of freedom on the interface of are only nonzero on the edge , using Lemma 4.3, we deduce
From (5.10)-(5.12), we complete the proof of (5.8).
Using similar techniques to those in (5.8), and summing over all subdomains, we can complete the proof of (5.9). □
6 Numerical results
In this section, we show numerical results of our method using the model problem
where . The domain is composed of sub-squares, their mesh sizes are H, and the sub-squares are divided into smaller ones with mesh sizes in mortar subdomains; and in nonmortar subdomains. The coefficient ρ is either 1 or ().
We use the preconditioned conjugate gradient (PCG) method with zero initial guess for the discrete system of equations. The stopping criterion for the PCG method is when the 2-norm of the residual is reduced by the factor of 10−6 of the initial guess. An estimate for the condition number of the corresponding system is computed by using the Lanczos algorithm.
In Table 1, we show the number of iterations and the condition numbers with different ratio . In Figure 2, we plot the condition number as the function for 16 domains. From the results in Table 1 and Figure 2, we see that the convergence of our method is quasi-optimal since the number of iterations is independent of the jumps of the coefficients, and almost independent of the mesh size.
Dohrmann C: A preconditioner for substructuring based on constrained energy minimization. SIAM J. Sci. Comput. 2003, 25: 246-258. 10.1137/S1064827502412887
Mandel J, Dohrmann C: Convergence of a balancing domain decomposition by constraints and energy minimization. Numer. Linear Algebra Appl. 2003, 10: 639-659. 10.1002/nla.341
Li J, Widlund O: FETI-DP, BDDC, and block Cholesky methods. Int. J. Numer. Methods Eng. 2006, 66: 250-271. 10.1002/nme.1553
Mandel J, Dohrmann C, Tezaur R: An algebraic theory for primal and dual substructuring methods by constraints. Appl. Numer. Math. 2005, 54: 167-193. 10.1016/j.apnum.2004.09.022
Kim H: A BDDC algorithm for mortar discretization of elasticity problems. SIAM J. Numer. Anal. 2008, 46: 2090-2111. 10.1137/060649677
Kim H: A FETI-DP formulation of three dimensional elasticity problems with mortar discretization. SIAM J. Numer. Anal. 2008, 46: 2090-2111. 10.1137/060649677
Kim H, Lee C, Park E: A FETI-DP formulation for the Stokes problem without primal pressure component. SIAM J. Numer. Anal. 2010, 47: 4142-4162. 10.1137/080731876
Le Tallec P, Mandel J, Vidrascu M: A Neumann-Neumann domain decomposition algorithm for solving plate and shell problems. SIAM J. Numer. Anal. 1998, 35: 836-867. 10.1137/S0036142995291019
Rannacher R, Turek S: Simple nonconforming quadrilateral Stokes element. Numer. Methods Partial Differ. Equ. 1992, 8: 97-111. 10.1002/num.1690080202
Bernardi C, Maday Y, Patera A: Domain decomposition by the mortar element method. In Asymptotic and Numerical Methods for Partial Differential Equations with Critical Parameters. Edited by: Kaper HG, Garbey M, Pieper GW. Kluwer Academic, Dordrecht; 1993:269-286.
Marcinkowski L:Additive Schwarz method for mortar discretization of elliptic problems with nonconforming elements. BIT Numer. Math. 2005, 45: 375-394. 10.1007/s10543-005-7123-x
Wang F, Chen J, Xu W, Li Z:An additive Schwarz preconditioner for the mortar-type rotated FEM for elliptic problems with discontinuous coefficients. Appl. Numer. Math. 2009, 59: 1657-1667. 10.1016/j.apnum.2008.11.006
Chen J, Xu X:The mortar element methods for rotated element. J. Comput. Math. 2002, 20: 313-324.
Xu J: Iterative methods by space decomposition and subspace correction. SIAM Rev. 1992, 34: 581-613. 10.1137/1034116
Xu J, Zou J: Some nonoverlapping domain decomposition method. SIAM Rev. 1998, 40: 857-914. 10.1137/S0036144596306800
Toselli A, Widlund O: Domain Decomposition Methods: Algorithms and Theory. Springer, Berlin; 2005.
The work was supported by the National Natural Science Foundation of China (Grant Nos. 11371199 and 11301275), Jiangsu Provincial 2011 Program (Collaborative Innovation Center of Climate Change), the Program of Natural Science Research of Jiangsu Higher Education Institutions of China (Grant No. 12KJB110013), the Doctoral fund of Ministry of Education of China (Grant No. 20123207120001), and Jiangsu Key Lab for NSLSCS (Grant No. 201306). Moreover the authors are grateful to anonymous referees for their constructive comments and suggestions.
The authors declare that they have no competing interests.
All results belong to YJ and JC. All authors read and approved the final manuscript.
About this article
Cite this article
Jiang, Y., Chen, J. A BDDC algorithm for the mortar-type rotated FEM for elliptic problems with discontinuous coefficients. Bound Value Probl 2014, 79 (2014). https://doi.org/10.1186/1687-2770-2014-79
- domain decomposition
- BDDC algorithm
- rotated element