Uniform error analysis of a rectangular Morley finite element method on a Shishkin mesh for a 4th-order singularly perturbed boundary value problem
Xiangyun Meng, Martin Stynes

TL;DR
This paper analyzes the error of a rectangular Morley finite element method on a Shishkin mesh for a 4th-order singularly perturbed boundary value problem, showing optimal convergence rates in challenging regimes.
Contribution
It provides a uniform error analysis and sharp convergence estimates for the Morley finite element method on Shishkin meshes for a complex singularly perturbed problem.
Findings
Achieves an $O(N^{-3/2})$ convergence rate in the most difficult regime.
Demonstrates the method's superiority over Adini finite elements in similar settings.
Validates theoretical results with numerical experiments.
Abstract
The singularly perturbed reaction-diffusion problem is considered on the unit square in with homogenous Dirichlet boundary conditions. Its solution typically contains boundary layers on all sides of~. It is discretised by a finite element method that uses rectangular Morley elements on a Shishkin mesh. In an associated energy-type norm that is natural for this problem, we prove an rate of convergence for the error in the computed solution, where ~is the number of mesh intervals in each coordinate direction. Thus in the most troublesome regime when , our method is proved to attain an rate of convergence, which is shown to be sharp by our numerical experiments and is superior to the…
| = 16 | = 32 | = 64 | = 128 | |
| 1.0e-00 | 2.08e-03 | 1.02e-03 | 5.07e-04 | 2.52e-04 |
| 1.02 | 1.01 | 1.00 | ||
| 1.0e-01 | 2.46e-02 | 1.12e-02 | 5.33e-03 | 2.59e-03 |
| 1.13 | 1.07 | 1.03 | ||
| 1.0e-02 | 3.79e-02 | 1.19e-02 | 4.46e-03 | 1.90e-03 |
| 1.66 | 1.42 | 1.23 | ||
| 1.0e-03 | 3.52e-02 | 1.01e-02 | 3.23e-03 | 1.14e-03 |
| 1.79 | 1.65 | 1.50 | ||
| 1.0e-04 | 3.14e-02 | 8.44e-03 | 2.34e-03 | 7.05e-04 |
| 1.89 | 1.84 | 1.73 | ||
| 1.0e-05 | 2.99e-02 | 7.77e-03 | 2.02e-03 | 5.43e-04 |
| 1.94 | 1.94 | 1.89 | ||
| 1.0e-06 | 2.94e-02 | 7.54e-03 | 1.91e-03 | 4.92e-04 |
| 1.96 | 1.97 | 1.96 | ||
| 1.0e-07 | 2.92e-02 | 7.47e-03 | 1.88e-03 | 4.75e-04 |
| 1.96 | 1.98 | 1.98 | ||
| 1.0e-08 | 2.92e-02 | 7.45e-03 | 1.87e-03 | 4.70e-04 |
| 1.97 | 1.99 | 1.99 |
| = 16 | = 32 | = 64 | = 128 | = 256 |
| 2.66e-02 | 1.18e-02 | 4.76e-03 | 1.79e-03 | 6.50e-04 |
| 1.16 | 1.31 | 1.41 | 1.46 |
| = 16 | = 32 | = 64 | = 128 | |
| 1.0e-00 | 1.45e-02 | 7.15e-03 | 3.54e-03 | 1.76e-03 |
| 1.02 | 1.01 | 1.00 | ||
| 1.0e-01 | 6.17e-02 | 3.13e-02 | 1.55e-02 | 7.67e-03 |
| 0.97 | 1.01 | 1.01 | ||
| 1.0e-02 | 3.94e-02 | 1.71e-02 | 8.66e-03 | 4.75e-03 |
| 1.20 | 0.98 | 0.86 | ||
| 1.0e-03 | 3.05e-02 | 1.01e-02 | 3.99e-03 | 1.81e-03 |
| 1.58 | 1.35 | 1.13 | ||
| 1.0e-04 | 2.69e-02 | 7.61e-03 | 2.36e-03 | 8.53e-04 |
| 1.82 | 1.68 | 1.47 | ||
| 1.0e-05 | 2.57e-02 | 6.78e-03 | 1.84e-03 | 5.45e-04 |
| 1.92 | 1.87 | 1.76 | ||
| 1.0e-06 | 2.53e-02 | 6.52e-03 | 1.68e-03 | 4.47e-04 |
| 1.95 | 1.95 | 1.91 | ||
| 1.0e-07 | 2.52e-02 | 6.44e-03 | 1.63e-03 | 4.16e-04 |
| 1.96 | 1.98 | 1.96 | ||
| 1.0e-08 | 2.51e-02 | 6.41e-03 | 1.61e-03 | 4.07e-04 |
| 1.97 | 1.98 | 1.98 |
| = 16 | = 32 | = 64 | = 128 | |
| 1.0e-00 | 1.22e-02 | 6.01e-03 | 2.98e-03 | 1.48e-03 |
| 1.02 | 1.01 | 1.00 | ||
| 1.0e-01 | 1.00e-01 | 4.65e-02 | 2.21e-02 | 1.07e-02 |
| 1.11 | 1.07 | 1.03 | ||
| 1.0e-02 | 1.59e-01 | 4.48e-02 | 1.69e-02 | 7.95e-03 |
| 1.82 | 1.40 | 1.08 | ||
| 1.0e-03 | 1.82e-01 | 5.08e-02 | 1.50e-02 | 4.96e-03 |
| 1.84 | 1.76 | 1.59 | ||
| 1.0e-04 | 1.79-01 | 4.77e-02 | 1.27e-02 | 3.59e-03 |
| 1.90 | 1.90 | 1.82 | ||
| 1.0e-05 | 1.77e-01 | 4.65e-02 | 1.20e-02 | 3.13e-03 |
| 1.93 | 1.95 | 1.93 | ||
| 1.0e-06 | 1.76e-01 | 4.61e-02 | 1.17e-02 | 2.99e-03 |
| 1.93 | 1.97 | 1.97 | ||
| 1.0e-07 | 1.76e-01 | 4.60e-02 | 1.16e-02 | 2.94e-03 |
| 1.93 | 1.97 | 1.98 | ||
| 1.0e-08 | 1.76e-01 | 4.60e-02 | 1.16e-02 | 2.93e-03 |
| 1.94 | 1.97 | 1.99 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDifferential Equations and Numerical Methods · Advanced Numerical Methods in Computational Mathematics · Numerical methods for differential equations
Uniform error analysis of a rectangular Morley finite element method on a Shishkin mesh for a 4th-order singularly perturbed boundary value problem
Xiangyun Meng†, Martin Stynes∗
† School of Mathematics and Statistics, Beijing Jiaotong University,
Beijing 100044, China
∗ Applied and Computational Mathematics Division, Beijing Computational Science Research Center,
Beijing 100193, China
email: [email protected]; [email protected](corresponding author)
Abstract
The singularly perturbed reaction-diffusion problem is considered on the unit square in with homogenous Dirichlet boundary conditions. Its solution typically contains boundary layers on all sides of . It is discretised by a finite element method that uses rectangular Morley elements on a Shishkin mesh. In an associated energy-type norm that is natural for this problem, we prove an rate of convergence for the error in the computed solution, where is the number of mesh intervals in each coordinate direction. Thus in the most troublesome regime when , our method is proved to attain an rate of convergence, which is shown to be sharp by our numerical experiments and is superior to the rate that is proved in Meng & Stynes, Adv. Comput. Math. 2019 when Adini finite elements are used to solve the same problem on the same mesh.
1 Introduction
Set , with closure and boundary . The bending of a simply supported plate is modelled [10, 15, 26] by the following 4th-order singularly perturbed boundary value problem in which represents the deflection of the plate under the transverse loading :
[TABLE]
where the parameter (which is the ratio of bending rigidity to tensile stiffness of the plate) satisfies , the function lies in with for some constant and lies in . The vector is the outward-pointing unit normal vector to the boundary of , so denotes the normal derivative on .
During the past two decades, various finite element methods (FEMs) have ben proposed for the numerical solution of 4th-order singularly perturbed problems. Error analyses on quasi-uniform meshes using nonconforming FEMs are discussed in [5, 15, 19, 20, 24, 31, 33], and a interior penalty method in [2]. Because it is troublesome to impose global continuity on the computed solution in the 2D domain for 4th-order problems, the interior penalty method relaxes the global continuity by adding penalty terms [2, eq.(2.3)] to a globally finite element space. Similarly, the discontinuous Galerkin method adds stabilisation terms [9, (3.4) and (3.13)] to the finite element space without imposing global continuity. Compared with these two approaches, nonconforming FEMs discard the global continuity condition but do not usually add any stabilisation terms.
The well-known nonconforming triangular Morley element for 4th-order problems was constructed in [23] and appears in many textbooks [3, 6, 13, 29]. This element does not however yield convergence for 2nd-order boundary value problems and is therefore unsuitable for our singularly perturbed problem (1.1); this issue is discussed in [24, Section 1]. Thus to solve (1.1), various modifications of the triangular Morley element have been proposed [24, 33].
An alternative departure from the triangular Morley element is the rectangular Morley element which was introduced in [32] and [29, Section 2.7.1]. It uses the same degrees of freedom as the triangular Morley element, viz., the point value at each node and the integral mean of the outer normal derivative on each edge. But unlike its triangular counterpart, the rectangular Morley element is convergent for both 4th-order and 2nd-order problems, so it is reasonable to consider it for solving (1.1), as has already been pointed out in [31].
Note also that the rectangular Morley element has only eight degrees of freedom in each element, which compares well with the twelve degrees of freedom of the nonconforming Adini element and the sixteen d.o.f. of the conforming Bogner-Fox-Schmit element (these two finite elements are also suitable for solving the problem (1.1)). We shall use the rectangular Morley element method to solve (1.1).
To solve (1.1) effectively, one must also use an appropriate mesh. Since the exact solution of (1.1) exhibits boundary layers (see Assumption 1.1 below), the mesh should be refined near . Suitable meshes were used with an Adini nonconforming FEM in [21], a interior penalty method in [12], a mixed FEM in [11] and a mixed -FEM in [7]. One sees easily that the meshes most suitable for (1.1) are severely anisotropic, so one cannot use results from the literature that assume quasi-uniformity of the mesh, but mesh quasi-uniformity is assumed in many of the earlier papers that we mentioned earlier. Consequently, for example, while Lemmas 3.2 and 3.4 below were proved previously assuming mesh quasi-uniformity, we have to prove them on meshes without this assumption.
We shall use a tensor-product Shishkin mesh when solving (1.1). In an energy-type norm that is natural for this problem, we prove convergence, where is the number of mesh elements in each coordinate direction and this convergence is uniform in the small parameter . This result is much better than the rate that is attained on quasi-uniform meshes [31, Corollary 4.1].
Furthermore, comparing our Morley result with the nonconforming Adini element studied in [21], in the most troublesome regime when , our method achieves optimal convergence, which is better than the attained in [21]; see Remark 4.16.
The paper is structured as follows. Section 1.1 gives a decomposition of the solution of (1.1) that is needed for the entire analysis. The rectangular Morley element is defined in Section 2. In Section 3 we define the discrete analogue of (1.1) that is solved by our FEM, and we derive various preliminary results for this discretisation. The analysis in this section is valid on arbitrary tensor-product meshes. The Shishkin mesh is defined in Section 4, then we continue our earlier analysis of the numerical method, finally proving its convergence in Theorem 4.14. The paper is completed by numerical experiments in Section 5.
Notation. Throughout the paper, denotes a generic constant that is independent of and of the mesh. Standard Lebesgue spaces and Sobolev spaces are used, where is any measurable subset of . Their associated norms are , and the associated semi-norm is . The inner product in is denoted by , but we omit the subscript when .
1.1 A decomposition of the solution
If and , then (cf. [13, Theorem 5.1]) one can use the Lax-Milgram lemma to show that (1.1) has a unique solution in , but for our analysis we need more precise information about the behaviour of , especially near the boundary .
Number the sides of in clockwise order as , where is associated with the interval on the -axis. Then denote the corner where the sides and meet by with . As in the papers [11, 21], we make the following assumption.
Assumption 1.1**.**
The solution of the boundary value problem (1.1) can be decomposed as
[TABLE]
for , where is a smooth function, each is a boundary layer component associated with the side of , and each is a corner layer component associated with the corner , i.e., there exists a constant such that for all and one has
[TABLE]
with analogous bounds for the remaining components of the decomposition.
2 The rectangular Morley element on anisotropic meshes
For the moment we use an arbitrary tensor product mesh on . In Section 4 we shall specialise our analysis to a suitable Shishkin mesh.
Let be a positive integer. Let and be arbitrary meshes in the interval on the and axes respectively. Draw vertical and horizontal lines through these points to partition into mesh rectangular elements with vertices . We write for the union of these mesh rectangles, so is a partition of .
Let be a typical mesh rectangle as shown in Figure 1. Its vertices are and its edges are with unit normal vectors for .
Let be the center of and suppose has dimensions . Then the coordinates of the vertices are , , , . For , let denote the length of edge and write for the outward-pointing unit normal to .
We now describe the rectangular Morley element of [28, 29, 32]. For each mesh rectangle , let denote the span of .
Define a set of 8 functions in as follows:
[TABLE]
One can verify (see [22, eq.(2.5)]) that
[TABLE]
where is the Kronecker symbol. Hence the and are linearly independent and form a basis for .
The rectangular Morley element space is now defined to be the set of functions such that for each mesh rectangle , is continuous at all mesh vertices in as one moves from one mesh rectangle to another, vanishes at all vertices in , and for all one has for all edges of where is the unit normal to that points out of ; here denotes the jump in as one moves from one side of to the other side (i.e., from one mesh rectangle to another) if , while if .
3 The discrete problem and its error analysis
In this section we discretise (1.1) using a finite element method based on the rectangular Morley element and begin the error analysis of this method.
3.1 Discretisation of (1.1)
Any function may be only piecewise continuous on so one cannot apply differential operators (such as and ) to globally. Thus, we apply these operators only piecewise on the interiors of the elements and indicate this modification by writing and instead of and , e.g., . For , define the bilinear forms and . We shall also use expressions like and , which are defined in the same way.
One can write (1.1) in the equivalent weak form
[TABLE]
where as usual H_{0}^{2}(\Omega)=\big{\{}g\in H^{2}(\Omega):g|_{\partial\Omega}=\frac{\partial g}{\partial n}|_{\partial\Omega}=0\big{\}}.
Then our discretisation of (1.1) is: Find such that
[TABLE]
Existence and uniqueness of the solution of (3.1) follows readily from the Lax-Milgram lemma.
3.2 Preliminaries
For each , let be the space of constant functions defined on and let be the projector, viz.,
[TABLE]
From [14, Lemma 7.5], for all one has the anisotropic error bound
[TABLE]
with independent of and .
Let denote the usual space of polynomials of the form defined on . Set Q_{N}=\big{\{}v_{N}\in H^{1}(\Omega):v_{N}|_{K}\in Q_{1}(K)\,\forall K\in\mathcal{T}_{N}\big{\}}. Let denote the standard piecewise bilinear nodal interpolation operator, viz., given , for each vertex of we set . Then for each and all , by [1, Theorem 2.7] one has
[TABLE]
and
[TABLE]
By applying a standard scaling argument to the and variables separately, one can modify the proof of [3, Lemma 4.5.3] to obtain the following anisotropic inverse inequalities: for each and any , one has
[TABLE]
where the constants are independent of and .
3.3 The error equation
Let be arbitrary. Set and . Then (3.1) and (1.1) yield
[TABLE]
Integrating by parts and using on , as in [18, (3.4)] we get
[TABLE]
Integration by parts on each gives, like [18, (3.5)],
[TABLE]
where and are, respectively, the tangential and outward-pointing normal derivatives along the boundary . From these calculcations we get the error equation
[TABLE]
Remark 3.1**.**
The error equation (3.6) is closely related to [31, (3.7)]; see also [18, (3.6)]. The analysis of (3.6) that we now develop has some similarity to the analysis in [31], but our work is greatly complicated (compared with [31]) by the extreme anisotropy of the Shishkin mesh and by our aim of proving error bounds that show convergence even when is very small; in [31] the mesh is shape-regular and the bounds established in Theorems 4.1 and 4.2 blow up if one takes the limit as , while the bound of [31, Theorem 4.3] (which remains valid as ) is only , which is inferior to the bound that we shall prove in Theorem 4.14.
3.4 Bounds on error equation integrals along
In this subsection we bound the terms and from the error equation (3.6).
For all , define and the norm . One can define and in the same way.
Let the edges of each be labelled for as in Figure 1. For each define
[TABLE]
The argument used in the next lemma imitates in part the proof of [18, Lemma 3.2], where only a uniform mesh was considered.
Lemma 3.2**.**
Assume that . Then there exists a constant such that for all , one has
[TABLE]
Proof.
For any internal edge , the edge-jump condition in the definition of implies that has the same magnitude but different signs when calculated on the two adjacent mesh rectangles that share . Consequently , as in these integrals depends on on each internal edge but not on the associated , while if then . Hence
[TABLE]
We now imitate the proof of [27, Theorem 4.1] by considering and also borrow some techniques from [18, Lemma 3.2]. For any , from Figure 1 one sees that on , on and on and . Thus
[TABLE]
As , it is easy to see that
[TABLE]
and the definition of implies that Hence
[TABLE]
A Cauchy-Schwarz inequality now yields
[TABLE]
In the second integral here, one has
[TABLE]
so another Cauchy-Schwarz inequality gives
[TABLE]
where we used the property that is independent of , which follows quickly from the definition of the Morley shape function space in Section 2. Hence
[TABLE]
For the first integrand in (3.11), one has
[TABLE]
Again appealing to Cauchy-Schwarz, we get
[TABLE]
hence
[TABLE]
Substituting (3.12) and (3.13) into (3.11) then taking a square root yields
[TABLE]
One can show similarly that
[TABLE]
Combining (3.9), (3.14) and (3.15), a Cauchy-Schwarz inequality gives
[TABLE]
Thus, we have proved (3.7).
Applying the anisotropic inverse inequalities (3.5a) to (3.14) and (3.5b) to (3.15) gives
[TABLE]
Then, like the above derivation of (3.7), one obtains (3.8):
[TABLE]
∎
Remark 3.3**.**
At first sight (3.7), which bounds with factors and , looks more attractive than (3.8), which yields factors and . But to continue the analysis with (3.7) means working with and using the inequality , which introduces an undesirable factor into our error bounds. Consequently we shall use (3.8) in our subsequent analysis, for then we have available , which causes no difficulties.
The next result was proved in [18, Lemma 3.3] while assuming that the mesh was quasi-uniform, but here we remove this restriction.
Lemma 3.4**.**
Assume that . Then there exists a constant such that for all , one has
[TABLE]
Proof.
The definition of implies that on each edge that is shared by two mesh rectangles and (say), is the same in both and ; but on the derivative will have opposite signs in these two rectangles, so
[TABLE]
Similarly to the derivation of (3.10), in the notation of Figure 1 we have
[TABLE]
As , it is easy to see that
[TABLE]
and the definition of implies that . Hence
[TABLE]
By a Cauchy-Schwarz inequality we get
[TABLE]
Replacing by in the derivation of (3.13) yields
[TABLE]
while similarly to the derivation of (3.12), one has
[TABLE]
Hence (3.19) implies that
[TABLE]
One can show similarly that
[TABLE]
From (3.18), (3.20) and (3.21) and some Cauchy-Schwarz inequalities, we can derive
[TABLE]
which proves (3.16).
Invoking the anisotropic inverse inequalities (3.5a)–(3.5b), from (3.20) and (3.21) one has
[TABLE]
Then one obtains (3.17) by imitating the above derivation of (3.16). ∎
Lemmas 3.2 and 3.4 are anisotropic generalisations on nonuniform meshes of the consistency error bounds proved in [17, 18] for discretisations of a classical biharmonic problem ( and in (1.1)) on uniform meshes.
4 Error analysis on a Shishkin mesh
All our analysis so far is valid on the general tensor-product mesh defined at the start of Section 2, but to obtain good accuracy in our numerical solution of (1.1) one should use a mesh that is designed to handle boundary layers in singularly perturbed problems. We now restrict our attention to a well-known tensor-product mesh of this type: the Shishkin mesh.
4.1 The Shishkin mesh
Recall that is the number of mesh intervals in each coordinate direction. Assume from now on that is divisible by . Define the transition parameter
[TABLE]
We assume that as otherwise would be exponentially large compared with , and then the problem can be solved accurately using a uniform mesh. In practice is small, so it is extremely unlikely that .
Partition the interval by a piecewise uniform mesh that is obtained by dividing into equal subintervals, into equal subintervals and into equal subintervals. The tensor product of two such 1D meshes is our 2D Shishkin mesh for the problem (1.1); it is shown in Figure 2. (See [25, 30] for further discussion of Shishkin meshes.) We continue to write for the 2D mesh. For any mesh sub-domain of , denote the mesh on by .
In our error analysis, we use the Shishkin mesh subdomains ,…, that are displayed in Figure 3. For convenience, define , and .
We shall now derive an error bound for the numerical solution of (3.1) by specialising our earlier results to the Shishkin mesh. To do this we analyse the consistency error of the discretisation of each term in the PDE (1.1a) in several lemmas, then combine these bounds in the proof of Theorem 4.14 to give the final convergence result.
4.2 Consistency error of
Lemma 4.1**.**
Suppose that satisfies Assumption 1.1. Then there exists a constant such that for all , one has
[TABLE]
Proof.
We apply the bound (3.8) of Lemma 3.2 to each of the components of that are provided by Assumption 1.1.
For the smooth component , the bound (1.2a) and yield
[TABLE]
For the layer component , using (1.2b) on we get
[TABLE]
and on
[TABLE]
Combining this pair of estimates and recalling that , we obtain
[TABLE]
The estimates for , and are similar.
For the layer component , using (1.2c) on gives
[TABLE]
and on
[TABLE]
Thus,
[TABLE]
The estimates for , and are similar.
Adding (4.1), (4.2) and (4.3), we get
[TABLE]
Similarly,
[TABLE]
Now the bound (3.7) of Lemma 3.2 and yield
[TABLE]
∎
Lemma 4.2**.**
Suppose that satisfies Assumption 1.1. Then there exists a constant such that for all , one has
[TABLE]
Proof.
Imitate the proof of Lemma 4.1 but invoke Lemma 3.4 instead of Lemma 3.2. To be specific, Lemma 3.4 gives bounds on the smooth and corner layer components that are the same as (4.1) and (4.3), while for the boundary layer components, the bound of (4.2) is replaced by the smaller bound . ∎
Remark 4.3**.**
[Comparison with Adini element] For the highest-order term of (1.1a), the consistency error of the rectangular Morley element on the Shishkin mesh is better than the corresponding bound for the rectangular Adini element, which was discussed in [21]. For in [21, eq.(4.27)], the consistency error of the Adini element is bounded by
[TABLE]
or
[TABLE]
after using an inverse inequality. In the above bounds, terms such as or are troublesome because of the mismatch where derivatives in one variable are multiplied by mesh widths in the other variable—this is problematic for example on mesh rectangles where by (1.2b) but , leading to bounds involving negative powers of . Remarkably, the rectangular Morley element does not have this drawback; the estimates of Lemmas 3.2 and 3.4 do not have similar mismatches and consequently we are able to prove the error bounds of Lemmas 4.1 and 4.2 in which no negative powers of appear.
Recall the piecewise bilinear interpolation operator of Section 3.1 and the piecewise constant projector of Section 3.2.
Lemma 4.4**.**
Suppose that satisfies Assumption 1.1. Then there exists a constant such that for all , one has
[TABLE]
Proof.
Let and . Similarly to the proof of [17, Lemma 3.1], one sees that
[TABLE]
by verifying this property for each of the functions . Hence
[TABLE]
where we used (3.4) and Cauchy-Schwarz inequalities. But the anisotropic projection error bound (3.2) yields
[TABLE]
Here the worst-behaved terms are and . These terms can be bounded like (4.4), obtaining
[TABLE]
The lemma now follows since . ∎
4.3 Consistency error of
In this subsection we consider the consistency error of the lower-order term in the PDE (1.1a). The components and of that were defined in Assumption 1.1 are handled separately.
Lemma 4.5**.**
There exists a constant such that for all , one has
[TABLE]
Proof.
Recall that . Similarly to the proof of Lemma 4.4, one has
[TABLE]
as on by Assumption 1.1 and . These two terms have a similar structure, but is well behaved so we give a detailed analysis only for the term containing .
The anisotropic projection error estimate (3.2) yields
[TABLE]
The boundary layer and corner layer components of are handled as in the proof of Lemma 4.1. The worst-behaved terms are and , whereas in Lemma 4.1 one has ; that is, here there are two fewer orders of derivative but this is balanced by the additional factor that is present in Lemma 4.1. Thus, like (4.2), we get finally
[TABLE]
and like (4.3) we get
[TABLE]
These estimates yield
[TABLE]
Combining these bounds, we are done. ∎
It now remains only to bound the smooth component term , but obtaining a sharp estimate for this term turns out to be troublesome.
For the rectangular Shishkin mesh , let be an edge of some mesh element . If , then there are two elements and in that share as a common edge. Let denote the patch associated with . Let and denote the areas of and respectively. If , then we call the patch uniform.
Let be the set of all edges of elements in , where contains the internal edges with uniform patches, contains the internal edges with nonuniform patches, and contains the edges in .
Recall the properties (2.1) of the Morley basis. Let denote the set of nodes of . For each , we shall treat separately the components of that correspond to nodes or edges. Thus, set and .
We decompose further. For each , define
[TABLE]
Set , where the were defined in Section 2. For each mesh element and each edge of , set
[TABLE]
If is an internal edge with patch , set
[TABLE]
The next two lemmas establish special properties of the rectangular Morley element.
Lemma 4.6**.**
Let be a mesh element. Let and . Then
[TABLE]
Proof.
Recall that is the center of and has dimensions . To simplify the presentation, set and . One can deduce from the definitions of the in Section 2 that for any , one has
[TABLE]
Hence
[TABLE]
and similarly for . But
[TABLE]
so follows. The other identity in (4.6) is proved similarly. ∎
Let denote the space of polynomials of the form defined on and let denote the space of constant functions defined on .
Lemma 4.7**.**
Let be an edge.
- (i)
If , its associated patch is uniform, and , then
[TABLE] 2. (ii)
If , its associated patch is nonuniform, and , then
[TABLE] 3. (iii)
If with , and , then
[TABLE]
Proof.
Assume that the edge is parallel to the -coordinate axis. (The case where is parallel to the -coordinate axis is similar.) Let the center of be the point and let the half-lengths of and in the direction be and respectively. Then and
[TABLE]
On , take increasing as the positive direction. Then (see Section 2) the basis function associated with is like in and in :
[TABLE]
Clearly on the right and left edges of and of . Hence and one gets
[TABLE]
and
[TABLE]
from which (4.8) and (4.9) follow.
One also has , so . Moreover, if then from
[TABLE]
we get , which yields (4.7). ∎
Let denote the bilinear nodal interpolation operator on the patch that, given , satisfies for each of the four vertices of that do not lie on . Let be the projector on patch , viz.,
[TABLE]
Lemma 4.8**.**
There exists a constant such that for all , one has
[TABLE]
Proof.
For each , by [22, Lemma 3.6] there exist and such that and
[TABLE]
Consequently
[TABLE]
We will deal with the right-hand side terms one by one. First, using (4.6), Cauchy-Schwarz inequalities and (1.2a) one has
[TABLE]
For the terms in in (4.11), consider the three cases , and . The definition of implies that if , so we need only consider and .
Using (4.7), Cauchy-Schwarz inequalities and (1.2a) we get
[TABLE]
Using (4.8), (1.2a), (3.2) and (3.3), we obtain
[TABLE]
as and there are edges in .
Combining (4.11)–(4.14) then recalling (4.10) gives . ∎
Lemma 4.9**.**
There exists a constant such that for all one has
[TABLE]
Proof.
Using the decomposition of in (4.10), we have
[TABLE]
We will deal with these terms one by one.
Integrating by parts in (4.6), one sees that on each element , for every and every one has . Hence we have
[TABLE]
where we used (3.2) and (3.3).
Similarly, integrating by parts in (4.7), we find that if , its associated patch is uniform, and , then . Hence
[TABLE]
using a variant of (3.2) to bound and the definition of to deduce that .
Using Cauchy-Schwarz inequalities and (3.3) we have
[TABLE]
as and there are edges in .
Combining (4.16), (4.17) and (4.18) with (4.15) and using (4.10) we could get
[TABLE]
∎
Lemma 4.10**.**
Let be arbitrary and set . Then there exists a constant , which is independent of and , such that
[TABLE]
Proof.
Two Cauchy-Schwarz inequalities and the definition of give
[TABLE]
The result now follows from the definition of . ∎
Lemma 4.11**.**
Let be arbitrary and set . Then there exists a constant , which is independent of and , such that
[TABLE]
Proof.
Two Cauchy-Schwarz inequalities and the definition of give
[TABLE]
∎
4.4 Reduced Morley interpolation
To finish the convergence analysis, we define an interpolation operator that uses reduced forms of the basis functions of Section 2. One does not use the full basis functions because anisotropic equivalents of Lemmas 4.12 and 4.13 are not known for them.
As in [28], on each mesh rectangle as in Figure 1 and each , define the reduced Morley interpolant for by
[TABLE]
where we set
[TABLE]
for . This set of functions is obtained by removing all the cubic polynomials from the basis functions of the standard rectangular Morley basis of Section 2. For each mesh rectangle , let denote the space spanned by .
Lemma 4.12**.**
For each and any , there exist constants (which are independent of and ) such that
[TABLE]
and
[TABLE]
For each and any , there exist constants (which are independent of and ) such that
[TABLE]
and
[TABLE]
Proof.
We combine [4, Theorem 2.3] with a standard scaling argument to prove (4.19) and (4.20), imitating the analysis of the Wilson element in [4, Section 3]. Let be the standard reference element. Define the nodes and edges of analogously to Figure 1. Given any , its reduced rectangular Morley interpolant is defined by
[TABLE]
where we set
[TABLE]
We check that satisfies the hypotheses of [4, Theorem 2.3] for , , and . Let denote or . It is easy to see that and is a continuous linear mapping from to . We must verify [4, eqs.(2.14) and (2.15)]. We shall do this for the case (that is, ); the other case is similar. A computation yields
[TABLE]
where for with ,
[TABLE]
and . Clearly is a basis for , so we have now verified [4, eq.(2.14)]. To verify [4, eq.(2.15)] is straightforward: Cauchy-Schwarz inequalities yield for .
One can now invoke [4, Theorem 2.3] for , , and . Then a standard scaling argument gives (4.19) and (4.20).
The interpolation error estimates (4.21) and (4.22) can be proved similarly, except that now (we had for (4.19) and (4.20)), while the other parameters are unchanged: , , and . It is easy to see that and is a continuous linear mapping from to . The verification of [4, eq.(2.14)] is same as before and the verification of [4, eq.(2.15)] is similar since for . Then we invoke [4, Theorem 2.3], followed by a standard scaling argument, thereby obtaining (4.21) and (4.22). ∎
The next result is the analogue of Lemma 4.12 for 2nd-order derivatives.
Lemma 4.13**.**
For each and any , there exist constants (independent of and ) such that
[TABLE]
[TABLE]
and
[TABLE]
Proof.
Apply the first inequality of [28, eq.(12)] on the reference element , then use a standard scaling argument. ∎
4.5 Error bound on the Shishkin mesh
We can now complete the error analysis of our numerical method.
Theorem 4.14**.**
Let be the solution of (1.1) and the solution of (3.1). Let Assumption 1.1 be satisfied. Then there exists a constant (which is independent of and ) such that
[TABLE]
Proof.
We imitate the argument of [28, Theorem 1]. Define by on each . Set . and . Recalling the error equation (3.6), we estimate the terms on its right-hand side using Lemmas 4.1, 4.2 and 4.4, 4.5, 4.8 and the definitions of and : this gives
[TABLE]
for some constants . But , so
[TABLE]
from the definitions of and .
The bounds of Lemma 4.13 yield
[TABLE]
To estimate each of these terms, one can proceed similarly to the proof of Lemma 4.1 above. Specifically, the worst-behaved terms are and . Comparing with the term in Lemma 4.1, here the order of the derivative is one less, which effectively removes a factor from the calculation leading to (4.4), so instead of (4.4) one obtains
[TABLE]
Next, for the boundary and corner layer components, the bounds of Lemma 4.12 give
[TABLE]
by (4.3). For the smooth component, by (4.21) and (4.22) we have
[TABLE]
Substituting (4.27), (4.28) and (4.29) into (4.26), we are done. ∎
It is well known that in the analysis of singularly perturbed problems on layer-adapted meshes such as the Shishkin mesh, the most troublesome regime is when . For this regime, Theorem 4.14 gives the following result.
Corollary 4.15**.**
Let be the solution of (1.1) and the solution of (3.1). Let Assumption 1.1 be satisfied. If , then there exists a constant (which is independent of and ) such that
[TABLE]
Remark 4.16** (Adini versus Morley).**
The Adini element is a well-known example of a nonconforming finite element that is suitable for our singularly perturbed problem (1.1). For the Adini element on an appropriate Shishkin mesh, one has the error bound [21, Corollary 4.1]
[TABLE]
Thus in the most challenging regime when , the Adini element obtains convergence, but Corollary 4.15 shows that the rectangular Morley element attains convergence.
Remark 4.17**.**
An inspection of the entire analysis leading to the result of Theorem 4.14 shows that we are close to proving the sharper error bound
[TABLE]
which would agree with our numerical results in Section 5. The weaker term in Theorem 4.14 appears only because of the two inequalities (4.14) and (4.18)—all other steps of the analysis yield terms in (4.30). Unfortunately we are unable at present to improve (4.14) and (4.18).
5 Numerical experiments
To test the accuracy of our finite element method we present three numerical examples, one with a known solution that displays typical layer behaviour and two others with unknown solutions.
Example 5.1**.**
In (1.1) choose and choose such that the exact solution is , where
[TABLE]
and
[TABLE]
with , and .
The derivatives of in this example match the bounds of Assumption 1.1. The solution computed by our finite element method (3.1) is . Table 1 displays the errors for various values of and , and the corresponding convergence rates
[TABLE]
where the convergence is assumed to be for each fixed value of , i.e., the convergence rate is measured along each row of the table.
To test the case that was discussed in Remark 4.16, we choose in Example 5.1. Table 2 displays the errors for various values of , and the corresponding convergence rates
[TABLE]
where the convergence is assumed to be . The table shows that our method attains convergence, in agreement with Corollary 4.15.
Example 5.2**.**
In (1.1) we impose the transverse loading , which is the same as the numerical example of [11, equation (15)], and choose . The exact solution of this problem is unknown.
Example 5.3**.**
In (1.1) we impose the transverse loading and choose ; this numerical example was tested in [31, Example 5.3] and [16, Example 5.3]. Its exact solution is unknown.
Numerical results for Example 5.2 and 5.3 are shown in Table 3 and 4. As the exact solution is unknown, we use the double mesh principle [8, Chapter 8] to estimate the errors and rates of convergence. To be specific, in the table is replaced by , where is the solution computed by the same method on a Shishkin-type mesh that is constructed by bisecting each element in the and directions, i.e., dividing each into 4 rectangles of equal size. Similarly, in the above formula for estimating the numerical rate of convergence, we replace by for .
Tables 1, 3 and 4 seem to indicate that the errors in the computed solutions obey the bound
[TABLE]
of equation (4.30). Thus Theorem 4.14 above appears not to be sharp; this weakness in the analysis was discussed in Remark 4.17.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Thomas Apel. Anisotropic finite elements: local estimates and applications . Advances in Numerical Mathematics. B. G. Teubner, Stuttgart, 1999.
- 2[2] Susanne C. Brenner and Michael Neilan. A 𝒞 0 \mathscr{C}^{0} interior penalty method for a fourth order elliptic singular perturbation problem. SIAM J. Numer. Anal. , 49(2):869–892, 2011.
- 3[3] Susanne C. Brenner and L. Ridgway Scott. The mathematical theory of finite element methods , volume 15 of Texts in Applied Mathematics . Springer, New York, third edition, 2008.
- 4[4] Shaochun Chen, Yongcheng Zhao, and Dongyang Shi. Anisotropic interpolations with application to nonconforming elements. Appl. Numer. Math. , 49(2):135–152, 2004.
- 5[5] Shaochun Chen, Yongcheng Zhao, and Dongyang Shi. Non C 0 C^{0} nonconforming elements for elliptic fourth order singular perturbation problem. J. Comput. Math. , 23(2):185–198, 2005.
- 6[6] Philippe G. Ciarlet. The finite element method for elliptic problems , volume 40 of Classics in Applied Mathematics . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2002. Reprint of the 1978 original [North-Holland, Amsterdam; MR 0520174 (58 #25001)].
- 7[7] Philippos Constantinou, Sebastian Franz, Lars Ludwig, and Christos Xenophontos. A mixed h p hp FEM for the approximation of fourth-order singularly perturbed problem on smooth domains. Numer. Methods Partial Differential Equations , 35(1):114–127, 2019.
- 8[8] Paul Farrell, Alan Hegarty, John Miller, Eugene O’Riordan, and Grigory Shishkin. Robust computational techniques for boundary layers , volume 16 of Applied Mathematics (Boca Raton) . Chapman & Hall/CRC, Boca Raton, FL, 2000.
