Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 859424, 8 pages
http://dx.doi.org/10.1155/2014/859424
Research Article

A BDDC Preconditioner for the Rotated FEM for Elliptic Problems with Discontinuous Coefficients

School of Sciences, Nanjing University of Posts and Telecommunications, Nanjing 210046, China

Received 30 May 2013; Accepted 1 December 2013; Published 16 January 2014

Academic Editor: K. S. Govinder

Copyright © 2014 Yaqin Jiang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We propose a BDDC preconditioner for the rotated finite element method for second order elliptic equations with piecewise but discontinuous coefficients. 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 quasioptimal convergence behavior; that is, 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.

1. Introduction

The balancing domain decomposition by constraints (BDDC) method was first introduced by Dohrmann in [1]. Then Mandel and the author Dohrmann restated the method in an abstract manner and provided its convergence theory in [2]. The BDDC method is closely related to the dual-primal FETI (FETI-DP) method [3], 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 [4], Mandel et al. 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 [3], 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 [5]; meanwhile, the authors also extended the FETI-DP algorithm to elasticity problems and stokes problems in [6, 7], respectively. These algorithms were based on locally conforming finite element methods, and the coarse space components of the algorithms were 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 when designing algorithm.

The BDDC method derives from the Neumann-Neumann domain decomposition method (see [8]). 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 nonsingular subproblems, so that 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 [9] 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 algorithm.

In this paper, we consider the second order problem with discontinuous coefficients, where the discontinuities lie only along the subdomain interfaces. Such problems play an important role in scientific computing. It is well known that large jumps in the coefficients may result in bad convergence for the traditional iterative methods (such as C-G algorithm). To overcome this difficulty, we construct a family of weighted counting functions associated with the substructures. Our counting functions are related to only two neighboring subdomains; this brings convenience for computing. 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 corresponding Schur complement system. 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 complete 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.

2. Preliminaries

Let be a bounded, simply connect rectangular or -shaped domain. We divide into several nonoverlapping regular rectangular subdomains   ; that is, . Consider the following model problem: find such that where where , and the coefficients are positive constants over   .

We only consider the geometrically conforming case; that is, 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 quasiuniform partition with mesh size , made up of rectangles in ; then is the global quasiuniform partition on . The nodes on the boundaries of neighboring subdomains match across the interface . We define by the interface between and , and let . We denote the sets of edges of the partition in , , , and by , , , and , respectively, and let , be the sets of vertices of the triangulation that are in , , respectively.

The global rotated element space is defined as follows:

The discrete approximation of the original problem (1) is to find such that where For each space (), we equip the following seminorm and norm:

It can be easily shown that is positive definite on , which yields the existence and uniqueness of the discrete solution.

We define a discrete harmonic operator associated with the rotated element: for any , let such that here . We define a corresponding piecewise harmonic operator by on the global rotated element space .

In order to introduce our domain decomposition method, we decompose the discrete space as follows: where the space is a piecewise harmonic function space defined as

We assume to be the solution of (4) and to be the solution of the local homogeneous Dirichlet problem: where . Let be the function that is equal to on the subdomain ; then obviously satisfies and we get . So we can equivalently derive the Schur complement system of (4) easily: find such that where is the piecewise harmonic function of in ; that is, .

For the sake of completeness, we define a Schur complement operator by Our goal is therefore to construct a preconditioner for the operator .

3. BDDC Algorithm

In this section, we introduce our BDDC preconditioner and describe the BDDC algorithm. Let ; we define the space . The space is intermediary between and ; our BDDC preconditioner is constructed based 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 product space play an important role in the description and analysis of our iterative method. In essence, we give a decomposition of the space as follows:

To present our BDDC preconditioner, we introduce several space transfer operators. Define the interpolation operator by The intergrid transfer operator is defined by We define the extension operator as Its transpose is defined by Denote by ; the corresponding transpose is defined by

To overcome the discontinuous coefficients , we define a family of weighted counting functions associated with as follows: here is the set of indices of the subregions such that . Actually, are piecewise constants associated with . Let be the corresponding pseudoinverse; for any , they provide a partition of unity as follows: By an elementary argument, we can see According to the construction of , given the scaling factors at the subdomain interface elements' edges, we can define the two scaled extension operators. where , . Following (19) the corresponding transposes are denoted by and , respectively.

In what follows, we describe our BDDC preconditioning algorithm, by using the basic framework of additive Schwarz method (or parallel subspace correction method [10]). From the decomposition (15), we only need to define appropriate subspace solvers.

First of all, the coarse subspace solver is defined by On each subdomain, the similar solver is given by

Remark 1. The bilinear forms on the coarse space can be different from substructure space; here we only use the exact solvers; on each subdomain, we avoid the possible singularity of local subproblem.

Now we define the BDDC preconditioner as where , is the corresponding transpose defined by Let be the operator from to defined by and let be the operator from to defined by Then the BDDC preconditioned operator can be written as The next key theorem gives an estimate on .

Theorem 2. The BDDC preconditioned operators satisfies where .

4. Technical Tools

In this section we state and prove a technical lemma necessary for the proof of Theorem 2. Our theoretical analysis is based on substructuring theory of conforming element.

We assume to be the bilinear conforming element space associated with the partition . We split the interface into four open edges and define a zero prolong operator on as for any For the operator , we introduce the following result (cf. [11]).

Lemma 3. For an edge of , for any , one has

Remark 4. The above lemma is related to vertex-edge-face arguments in substructuring methods, in view of 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 triangulation which is constructed by joining the midpoints of the edges of elements of . We now introduce a local equivalence map as follows (cf. [12]).

Definition 5. Given , we define by the values of at the vertices of the partition . (i)If is a central point of , , then (ii)If is a midpoint of one edge , , then (iii)If , then where the sum is taken over all edges with the common vertex , , .(iv)If , then where and are the left and right neighbor edges of , . If is a vertex of , then .

Remark 6. For , we define an operator [12, Definition 3.2]; that is, if is a vertex of , let , and their stable pseudoinverse is denoted by [12, Lemma 3.2]; here .

For the operators and , we have the following results (see [12]): For the rotated element, we have the following inequality.

Lemma 7. For any , we can split into , and one has where , and for any , ; for any , .

Proof. By (39), Lemma 3, the inverse trace theorem, trace theorem, and Poincáre inequality, we obtain where is a piecewise bilinear harmonic operator, and we have used the minimal energy property of discrete harmonic functions.

5. Proof of Theorem 2

In the proof of Theorem 2 we use the abstract framework of ASM methods (see [13]); we have necessary to prove three assumptions. Assumption II follows from the standard coloring argument; now we need to prove Assumption I and Assumption III.

First we show the following stable decomposition.

Lemma 8 (Assumption I). For any , there is the following decomposition: that satisfies

Proof. First we show the decomposition (42). For any function , let , and , . From the definitions of and , we have by (22) and the definition of , we get Then and the equality (42) holds.
Now, we prove stable decomposition (43). We assume ; then using Lemma 3.5 in [14], Poincaré-Friedrichs' inequality, and scaling argument, we can derive From (46) and discrete equivalent norm, we deduce Meanwhile, from the fact that the harmonic function has minimal energy norm and (47), we get So (47) and (48) lead to (43), and the proof is completed.

Next we state the local stability as follows.

Lemma 9 (Assumption III). For any , we have And for any , one has

Proof. To prove (49) we first define associated with which satisfies and define a zero prolong operator as Then we can decompose as follows: here is the integral average interpolation operator on the interface , satisfying Note that the support of is contained in ; we denote , . From Lemma 7 and the definition of , we derive
Moreover, since is discrete harmonic in with for any , then from Lemma 3.3 in [12], we have Since the meshes on subdomain and align across the interface , using the above inequality yields where , and for any , ; for any , .
Using (23), the trace theorem, and Lemma 3, we obtain where , and for any , ; for any , .
From (57) and (58), we complete the proof of (49).
Using the similar techniques in (49) and summing over all subdomains, we can complete the proof of (50).

6. Numerical Results

In this section, we show numerical results of our method using the model problem where . The domain is composed of subsquares; their mesh sizes are , and the subsquares are divided into smaller ones with mesh sizes . The coefficient is either 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 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 1, we plot the condition numbers as the function of for 16 domains. From the results in Table 1 and Figure 1, we can see that the convergence of our method is quasioptimal since the number of iterations is independent of jumps in coefficients and almost independent of mesh sizes.

tab1
Table 1: The number of iterations and condition numbers.
859424.fig.001
Figure 1: Plot of the condition numbers as the function of .

Conflict of Interests

The author declares that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The author would like to thank the referee for many helpful comments and suggestions, which have greatly improved the presentation of the paper. The work is supported by the National Natural Science Foundation of China (Grant nos. 11371199 and 11301275), 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).

References

  1. C. R. Dohrmann, “A preconditioner for substructuring based on constrained energy minimization,” SIAM Journal on Scientific Computing, vol. 25, no. 1, pp. 246–258, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. J. Mandel and C. R. Dohrmann, “Convergence of a balancing domain decomposition by constraints and energy minimization,” Numerical Linear Algebra with Applications, vol. 10, no. 7, pp. 639–659, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. J. Li and O. B. Widlund, “FETI-DP, BDDC, and block Cholesky methods,” International Journal for Numerical Methods in Engineering, vol. 66, no. 2, pp. 250–271, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J. Mandel, C. R. Dohrmann, and R. Tezaur, “An algebraic theory for primal and dual substructuring methods by constraints,” Applied Numerical Mathematics, vol. 54, no. 2, pp. 167–193, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. H. H. Kim, “A BDDC algorithm for mortar discretization of elasticity problems,” SIAM Journal on Numerical Analysis, vol. 46, no. 4, pp. 2090–2111, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. H. H. Kim, “A FETI-DP formulation of three dimensional elasticity problems with mortar discretization,” SIAM Journal on Numerical Analysis, vol. 46, no. 5, pp. 2346–2370, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. H. H. Kim, C.-O. Lee, and E.-H. Park, “A FETI-DP formulation for the Stokes problem without primal pressure components,” SIAM Journal on Numerical Analysis, vol. 47, no. 6, pp. 4142–4162, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. P. le Tallec, J. Mandel, and M. Vidrascu, “A Neumann-Neumann domain decomposition algorithm for solving plate and shell problems,” SIAM Journal on Numerical Analysis, vol. 35, no. 2, pp. 836–867, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. R. Rannacher and S. Turek, “Simple nonconforming quadrilateral Stokes element,” Numerical Methods for Partial Differential Equations, vol. 8, no. 2, pp. 97–111, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. J. Xu, “Iterative methods by space decomposition and subspace correction,” SIAM Review A, vol. 34, no. 4, pp. 581–613, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. J. Xu and J. Zou, “Some nonoverlapping domain decomposition methods,” SIAM Review, vol. 40, no. 4, pp. 857–914, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. J.-r. Chen and X.-j. Xu, “The mortar element method for rotated Q1 element,” Journal of Computational Mathematics, vol. 20, no. 3, pp. 313–324, 2002. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. A. Toselli and O. Widlund, Domain Decomposition Methods: Algorithms and Theory, vol. 34, Springer, Berlin, Germany, 2005. View at MathSciNet
  14. F. Wang, J. Chen, W. Xu, and Z. Li, “An additive Schwarz preconditioner for the mortar-type rotated FEM for elliptic problems with discontinuous coefficients,” Applied Numerical Mathematics, vol. 59, no. 7, pp. 1657–1667, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet