Optimal quadratic element on rectangular grids for $H^1$ problems
Huilan Zeng, Chensong Zhang, and Shuo Zhang

TL;DR
This paper introduces a new quadratic finite element method on rectangular grids for $H^1$ problems, achieving optimal convergence and providing lower bounds for eigenvalues, with promising numerical results.
Contribution
It presents a reduced quadratic rectangular Morley element with proven convergence rates and eigenvalue bounds, enhancing finite element analysis for $H^1$ problems.
Findings
Convergence rate of $O(h^2)$ in energy norm on uniform grids.
Lower bounds for eigenvalues are obtained.
Numerical results demonstrate the method's potential.
Abstract
In this paper, a piecewise quadratic finite element method on rectangular grids for the problems is presented. The proposed method can be viewed as a reduced rectangular Morley element. For the source problem, the convergence rate of this scheme is in the energy norm on uniform grids. Besides, a lower bound of the -norm error is also proved, which makes the capacity analysis of this scheme more clear. On the other hand, for the eigenvalue problem, the numerical eigenvalues by this element are shown to be the lower bounds of the exact ones. Some numerical results are presented, which show the potential of the proposed finite element.
| order | order | order | order | |||||||
| 17.178 | 38.419 | 39.047 | 47.604 | 65.324 | 78.711 | |||||
| 18.982 | 1.690 | 46.125 | 46.126 | 1.696,1.599 | 68.932 | 1.564 | 90.210 | 90.236 | 1.966,1.181 | |
| 19.539 | 1.892 | 48.437 | 48.437 | 1.768, 1.768 | 75.941 | 1.662 | 96.105 | 96.106 | 1.638,1.633 | |
| 19.688 | 1.969 | 49.112 | 49.112 | 1.928, 1.928 | 78.157 | 1.884 | 98.004 | 98.004 | 1.873,1.873 | |
| 19.726 | 1.992 | 49.288 | 49.288 | 1.980,1.980 | 78.754 | 1.968 | 98.520 | 98.520 | 1.964,1.964 | |
| 19.736 | 1.998 | 49.333 | 49.333 | 1.995,1.995 | 78.906 | 1.992 | 98.652 | 98.652 | 1.991,1.991 | |
| Trend | ||||||||||
| Exact | 19.739 | – | 49.348 | 49.348 | 78.957 | 98.696 | 98.696 |
| order | order | order | order | |||||||
| 18.559 | 44.961 | 45.655 | 63.427 | 90.249 | 95.913 | |||||
| 19.428 | 1.896 | 48.127 | 48.163 | 1.796,1.558 | 74.233 | 1.644 | 96.050 | 96.427 | 1.596,0.613 | |
| 19.660 | 1.973 | 49.034 | 49.036 | 1.944,1.899 | 77.711 | 1.896 | 97.996 | 98.016 | 1.890,1.670 | |
| 19.719 | 1.993 | 49.269 | 49.269 | 1.986, 1.975 | 78.641 | 1.973 | 98.519 | 98.520 | 1.972,1.928 | |
| 19.734 | 1.998 | 49.328 | 49.328 | 1.996,1.994 | 78.878 | 1.993 | 98.652 | 98.652 | 1.993,1.983 | |
| 19.738 | 2.000 | 49.343 | 49.343 | 2.000,1.996 | 78.937 | 1.998 | 98.685 | 98.685 | 1.998,1.996 | |
| Trend | ||||||||||
| Exact | 19.739 | 49.348 | 49.348 | 78.957 | 98.696 | 98.696 |
| order | |||||||
| 8.999 | 11.157 | 11.961 | 16.776 | 17.955 | 23.829 | ||
| 9.637 | 13.948 | 17.219 | 1.626 | 25.337 | 27.892 | 36.616 | |
| 9.708 | 14.840 | 18.984 | 1.739 | 28.190 | 30.865 | 40.131 | |
| 9.691 | 15.104 | 19.539 | 1.916 | 29.160 | 31.713 | 41.140 | |
| 9.667 | 15.174 | 19.688 | 1.977 | 29.429 | 31.897 | 41.412 | |
| 9.652 | 15.191 | 19.726 | 1.994 | 29.498 | 31.923 | 41.469 | |
| 9.645 | 15.196 | 19.736 | 1.999 | 29.516 | 31.921 | 41.477 | |
| Trend | |||||||
| 9.640 | 15.197 | 19.739 | 29.522 | 31.913 | 41.475 |
| order | |||||||
| 9.894 | 13.443 | 15.857 | 23.914 | 26.659 | 33.739 | ||
| 9.811 | 14.696 | 18.558 | 1.717 | 27.656 | 30.410 | 40.808 | |
| 9.743 | 15.068 | 19.428 | 1.923 | 29.015 | 31.687 | 41.262 | |
| 9.691 | 15.165 | 19.660 | 1.980 | 29.392 | 31.921 | 41.456 | |
| 9.663 | 15.189 | 19.719 | 1.995 | 29.489 | 31.941 | 41.488 | |
| 9.650 | 15.195 | 19.734 | 1.999 | 29.513 | 31.930 | 41.485 | |
| Trend | |||||||
| 9.640 | 15.197 | 19.739 | 29.522 | 31.913 | 41.475 |
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
TopicsAdvanced Numerical Methods in Computational Mathematics · Advanced Mathematical Modeling in Engineering · Numerical methods in engineering
Optimal quadratic element on rectangular grids for problems
Huilan Zeng
LSEC, ICMSEC, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100190, China; School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China
,
Chensong Zhang
LSEC, ICMSEC and NCMIS, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100190, China
and
Shuo Zhang
LSEC, ICMSEC and NCMIS, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, Beijing 100190, China
Abstract.
In this paper, a piecewise quadratic finite element method on rectangular grids for problems is presented. The proposed method can be viewed as a reduced rectangular Morley (RRM) element. For the source problem, the convergence rate of this scheme is proved to be in the energy norm on uniform grids over a convex domain. A lower bound of the -norm error is also proved, which makes the capacity of this scheme more clear. For the eigenvalue problem, the computed eigenvalues by this element are shown to be the lower bounds of the exact ones. Some numerical results are presented to verify the theoretical findings.
Key words and phrases:
optimal quadratic element, rectangular grids, boundary value problem, eigenvalue problem, lower bound
2000 Mathematics Subject Classification:
Primary 65N15, 65N22, 65N25, 65N30
Zeng and C.-S. Zhang are partially supported by National Key Research and Development Program 2016YFB0201304, China. C.-S. Zhang is also supported by the Key Research Program of Frontier Sciences of CAS. S. Zhang is partially supported by National Natural Science Foundation, 11471026 and 11871465, China
1. Introduction
The design and capacity analysis of the discretization schemes for the source problem (say, the boundary value problem) and the eigenvalue problem are key issues in numerical analysis and, in general, of approximation theory. When the approximation of functions in Sobolev spaces is performed using piecewise polynomials defined on a domain partition, lower-degree polynomials are often preferred in order to achieve a simpler interior structure. A finite element scheme with polynomials of the total degree no more than , denoted by , is called optimal if it achieves accuracy in the energy norm for elliptic problems. In this paper, we present an optimal quadratic element scheme for the problems, including the source problem and the eigenvalue problem, on rectangular grids, and present its error analysis.
The study of optimal finite element schemes has been attracting wide interests. For the case wherein the grid comprises simplexes, there are already some systematic results. It is known that the Lagrange finite elements of arbitrary degree on domains of arbitrary dimension are optimal conforming elements for second-order elliptic problems. At the same time, a systematic family of minimal-degree nonconforming finite elements is proposed by [27], where -th degree polynomials work for -th order elliptic problems in for any . Known as the Wang-Xu or Morley-Wang-Xu family, these elements are constructed based on the perfect matching between the dimension of -th degree polynomials and the dimension of -subsimplexes with . The generalisation to the cases where is attracting increasing research interest (see, e.g., [29]). These spaces can be naturally used for both the source problem and the eigenvalue problem. On the other hand, to clarify the capacity of the schemes clearly, some kinds of extremal analysis have also been conducted, including, e.g., lower bounds of the error estimates and guaranteed bounds of the computed eigenvalues. We refer to, e.g., [20] for a general analysis of the lower bounds of the discretization error for piecewise polynomials, and [22, 12, 11, 10] for specific analysis with certain finite element schemes. We refer to, e.g.,[18, 1, 37, 34, 33, 21, 17, 9, 4, 5] for the computed guaranteed bounds of certain eigenvalue problems. The extremal analysis is naturally used on or ready to be generalized to optimal schemes.
When the grid comprises shapes other than simplexes, the design of optimal schemes becomes more complicated. We would like to recall that, (rather than ) polynomials are used for -th order problems on rectangular grids by [14], which form minimal conforming element spaces. For biharmonic equation, some low-degree rectangular elements have been designed, including the rectangular Morley element and incomplete element. Very recently, a space, consisting of exactly piecewise quadratic polynomials, is constructed and shown convergent for the biharmonic equation on general quadrilateral grids, which forms a convergent scheme of the minimal degree [36]. Also, there have been several rectangle elements for problems in the literature [16, 13, 15, 28]. In [16], an enriched quadratic nonconforming element on rectangles is introduced, and second-order error is shown, which is generalized to higher orders by [13]. Another second-order quadratic element is given by [15], where the spline technique is used, but the shape function space on a cell is not exactly . The Wilson element [28] is the first quadratic quadrilateral nonconforming element. Despite its superior performance in practice, as shown in [25], its global asymptotic convergence rate is the same as that of the bilinear element, due to low internal continuity. Generally, this deficiency can be compensated by equipping the piecewise quadratic polynomial with second order moment-continuity across the internal edges. In this way, the moment-continuous (MC) element space is defined. However, it is proved in Appendix A, that the MC element space possesses essentially the same accuracy as that of the bilinear element space, and thus it fails to reach second-order convergence rate. To our best knowledge, it remains open whether an optimal scheme can be constructed with degrees higher than minimal even on rectangular grids and for problems.
In this paper, we study the optimal finite element construction for the problems, and present a finite element space comprising piecewise quadratic polynomials on uniform rectangular grids that can provide convergence in energy norm for the source and eigenvalue problems. The computed eigenvalues are lower bounds of the exact ones, which can be proved theoretically and verified numerically. Only rectangular grids are taken into consideration herein, but if a quadrilateral grid is only a sufficiently small perturbation of a uniform one, then an optimal convergence rate could be expected on it. Moreover, the finite element functions cannot be described with free rein cell by cell. Similar to the elements described in [7, 23, 36] and in many spline-type methods, the number of continuity restrictions of the finite element function is greater than the dimension of the local polynomial space. We believe this difficulty is not abnormal for low-degree schemes. In general, these cells can share interfaces with more neighbour cells, and more continuity restrictions will strengthen the requirement for higher-degree polynomials, generally higher than the order of the underlying Sobolev space. Thus, constructing consistent finite elements in the formulation of Ciarlet’s triple is difficult with -th degree polynomials for problems even on rectangular grids. Here we utilize some non-standard technical approaches to overcome the difficulty for both implementation and especially theoretical analysis.
The main difficulty is that the local interpolation is too difficult, if ever possible, to be established, which plays a fundamental role in the approximation error analysis for the source problem and the guaranteed bounds analysis for the eigenvalue problem. Notice that the space constructed herein can be viewed as a reduced rectangular Morley element space. Similar to the approach in [36] but with technical modifications, we can determine that the finite element functions are discrete stream functions of the discrete divergence-free functions constructed in a study [23]; using this exact relation, we can perform the approximation estimation indirectly. Also, the discretization of the eigenvalue problem can be viewed as an inner approximation of the rectangular Morley element scheme, and this helps avoid the direct dependence on an interpolation. This newly-designed routine method of theoretical analysis can be potentially used to find out other optimal schemes.
Finally, we remark that, two examples, namely the rectangular Morley (RM) element and the reduced rectangular Morley (RRM) element, are reported in this paper that when used for the eigenvalue problem, errors of the eigenvalues and eigenfunctions are of the same order. This unusual performance is due to the fact that no nontrivial conforming finite element subspace can be found contained in these two spaces.
The rest of the paper is organized as follows. In Section 2, some preliminaries are given and some related low-degree rectangle elements are reviewed. In Section 3, the rectangular Morley element is revisited. In Section 4, a reduced rectangular Morley element scheme is presented for both source problem and eigenvalue problem. In Section 5, the convergence analysis and lower bound properties are shown for the RRM element scheme. In Section 6, some concluding remarks and discussions are given. In contrast to a general implementation approach in Section 5, concise sets of basis functions of the MC element and the RRM element are presented in the appendix.
2. Preliminaries
2.1. Notations
Throughout this paper, we use for a simply-connected polygonal domain in . We use , , , and for the gradient operator, curl operator, divergence operator, and Hessian operator, respectively. As usual, we use , , , , and for certain Sobolev spaces. Specifically, we denote \displaystyle L^{2}_{0}(\Omega):=\Big{\{}w\in L^{2}(\Omega):\int_{\Omega}wdx=0\Big{\}}, \undertilde{H}{}^{1}_{0}(\Omega):=\big{(}H^{1}_{0}(\Omega)\big{)}^{2}, and \undertilde{H}{}^{1}_{\bf n}(\Omega):=\Big{\{}v\in\big{(}H^{1}(\Omega)\big{)}^{2}:v\cdot{\bf n}\big{|}_{\partial\Omega}=0\Big{\}}. Denote, by and , the dual spaces of and , respectively. We use for vector valued quantities in the present paper, and and for the two components of the function . We utilize the subscript to indicate the dependence on grids. Particularly, an operator with the subscript ’ implies the operation is done cell by cell. Finally, , , and respectively denote , , and up to a generic positive constant, which might depend on the shape-regularity of subdivisions, but not on the mesh-size [30].
Let be in a regular family of quadrilateral grids of domain . Let be the set of all vertices, , with and comprising the interior vertices and the boundary vertices, respectively. Similarly, let be the set of all the edges, with and comprising the interior edges and the boundary edges, respectively. For an edge , is a unit vector normal to and is a unit tangential vector of such that . On the edge , we use for the jump across . If , then is the evaluation on . The subscript can be dropped when there is no ambiguity brought in.
2.2. Some rectangular finite element spaces
Suppose that represents a rectangle with sides parallel to the two axis respectively. Let be the barycenter of . Let , be the length of in the and directions, respectively. Let and denote an vertex and an edge of K, respectively. Let be the mesh size of . When is uniform, we denote and . Let denote the space of polynomials on of total degree no bigger than . Let denote the space of polynomials of degree no bigger than in each variable. Similarly, we define spaces and on an edge .
2.2.1. The element
The element is defined by with the following properties:
- (a)
is a rectangle;
- (b)
;
- (c)
for any , D_{K}^{\text{BL}}=\big{\{}v(a_{i})\big{\}}_{i=1:4}.
Define the element space as
[TABLE]
Associated with , we define V_{h0}^{\text{BL}}:=\Big{\{}w_{h}\in V_{h}^{\text{BL}}:w_{h}(a)=0,\ \forall a\in\mathcal{N}_{h}^{b}\Big{\}}.
2.2.2. The Park–Sheen (PS) element
The PS element [23] is a piecewise linear nonconforming finite element space for problems. It is defined as
[TABLE]
Associated with , we define V_{h0}^{\rm{PS}}:=\Big{\{}w_{h}\in V_{h}^{\rm{PS}}:\fint_{e}w_{h}\,ds=0,\ \forall e\in\mathcal{E}_{h}^{b}\Big{\}}.
2.2.3. The rotated () element
The element is defined by with the following properties:
- (a)
is a rectangle;
- (b)
;
- (c)
for any , D_{K}^{\rm{rQ}}=\Big{\{}\fint_{e_{i}}v\,ds\Big{\}}_{i=1:4}.
Define the element space as
[TABLE]
Associated with , we define V_{h0}^{\text{rQ}}:=\Big{\{}w_{h}\in V_{h}^{\text{rQ}}:\fint_{e}w_{h}\,ds=0,\ \forall e\in\mathcal{E}_{h}^{b}\Big{\}}.
2.2.4. The Lin–Tobiska–Zhou (LTZ) element
The LTZ element([19, 35]) is defined by with the following properties:
- (a)
is a rectangle;
- (b)
;
- (c)
for any , D_{K}^{\rm{LTZ}}=\Big{\{}\fint_{K}v\,dxdy,\ \fint_{e_{1}}v\,ds,\ \ldots,\ \fint_{e_{4}}v\,ds\Big{\}}.
Define the LTZ element space as
[TABLE]
Associated with , we define V_{h0}^{\rm{LTZ}}:=\Big{\{}w_{h}\in V_{h}^{\rm{LTZ}}:\fint_{e}w_{h}\,ds=0,\ \forall e\in\mathcal{E}_{h}^{b}\Big{\}}, and associated with , we define \undertilde{V}{}_{h{\bf n}}^{\rm LTZ}:=\Big{\{}\undertilde{v}{}_{h}\in\big{(}V_{h}^{\rm LTZ}\big{)}^{2}:\int_{e}\undertilde{v}{}_{h}\cdot\mathbf{n}=0,\ \forall e\in\mathcal{E}_{h}^{b}\Big{\}}.
2.2.5. The Wilson element
The Wilson element is defined by with with the following properties:
- (a)
is a rectangle;
- (b)
;
- (c)
for any , D_{K}^{\rm{W}}=\Big{\{}v(a_{1}),\ \ldots,v(a_{4}),\ \fint_{K}\partial_{xx}v\,dxdy,\ \fint_{K}\partial_{yy}v\,dxdy\Big{\}}.
Define the Wilson element space as
[TABLE]
Associated with , we define V_{h0}^{\rm{W}}:=\Big{\{}w_{h}\in V_{h}^{\rm{W}}:w_{h}(a)=0,\ \forall a\in\mathcal{N}_{h}^{b}\Big{\}}.
2.2.6. The moment-continuous (MC) element
Associated with , the MC element space is defined as
[TABLE]
Associated with , we define
[TABLE]
A piecewise quadratic polynomial function is moment-continuous of second-order, if
[TABLE]
Moreover, is moment-homogeneous of second-order, if
A piecewise quadratic function belongs to if and only if is continuous at the second-order Gauss points of any and vanishes on the Gauss points of any .
Theorem 2.1**.**
If is a rectangular subdivision of , then .
Theorem 2.2**.**
If be a rectangular subdivision of , then .
Detailed proof of Theorems 2.1 and 2.2 are put in Appendix A, and available sets of basis functions of and are also presented there.
2.3. Some technical lemmas
In addition to these spaces above, we denote
[TABLE]
Let and be the nodal interpolation associated with and , respectively.
Lemma 2.3**.**
([24, Lemma 1],[36, Lemma 6])* For the element, we have*
- (1)
\big{|}\Pi^{\rm rQ}_{h}v\big{|}_{1,h}\lesssim|v|_{1,h},
- (2)
\big{\|}\Pi^{\rm rQ}_{h}v-v\big{\|}_{0,\Omega}+h\big{|}\Pi^{\rm rQ}_{h}v-v\big{|}_{1,h}\lesssim h^{2}|v|_{2,\Omega}, .
Lemma 2.4**.**
([36, Lemma 7])* The following relationships hold.*
[TABLE]
2.4. elliptic problems and nonconforming finite element approximation
In this paper, we consider the following model problems:
Source problem: with , , and ,
[TABLE]
Its weak form is given by: Find satisfying
[TABLE]
where and
Eigenvalue problem: with and ,
[TABLE]
Its weak form is given by: Find with , such that
[TABLE]
where defines a norm over equivalent to the usually norm.
From [2], the eigenvalue problem (2.3) has a sequence of eigenvalues
[TABLE]
and corresponding eigenfunctions
[TABLE]
For a certain eigenvalue of (2.4), we define
[TABLE]
Given an discrete space defined on , the discretization schemes are
for the source problem: Find , such that
[TABLE]
for the eigenvalue problem: Find with , such that
[TABLE]
Let . The discrete eigenvalue problem (2.6) has a sequence of eigenvalues
[TABLE]
and corresponding eigenfunctions
[TABLE]
Lemma 2.5**.**
([6, Theorem 4.1.7]) * Suppose that is a rectangular region and is smoothing enough. If is an eigen-pair of (2.3), then .*
3. The rectangular Morley (RM) element revisited
3.1. The RM element space
The RM element is defined by with the following properties:
- (1)
is a rectangle;
- (2)
;
- (3)
for any , D_{K}^{\rm{M}}=\big{\{}v(a_{i}),\fint_{e_{i}}\partial_{n_{e_{i}}}v\,ds\big{\}}_{i=1:4}.
Define the RM element space as
[TABLE]
Associated with , we define V_{hs}^{\rm{M}}:=\Big{\{}w_{h}\in V_{h}^{\rm{M}}:w_{h}(a)=0,\forall a\in\mathcal{N}_{h}^{b}\Big{\}}.
Lemma 3.1**.**
([22, Lemmas 3.2 and 3.5])* Denote with The following estimates hold.*
- (a)
For any shape-regular rectangular grid, it holds for any that
[TABLE]
- (b)
For any uniform rectangular grid, it holds for any that
[TABLE]
For the RM element, there is a refined property of the interpolation operator .
Lemma 3.2**.**
([22, Lemma 3.17])*
Assume that is uniform. For any with \big{\|}\frac{\partial^{2}w}{\partial x\partial y}\big{\|}_{0,\rho}\neq 0, if is small enough, then*
[TABLE]
where is a constant independent of .
Corollary 3.3**.**
Under the conditions in Lemma 3.2, there exists , such that
[TABLE]
Proof.
It follows from Lemma 3.2 and \big{|}w-\Pi_{h}^{\rm{M}}w\big{|}_{1,h}\lesssim h^{2} immediately. ∎
Hence we obtain an interesting and intuitive conclusion:
[TABLE]
By standard argument, we can prove the exact sequence which reads
[TABLE]
where .
3.2. The RM element scheme for the eigenvalue problem
3.2.1. Expanded representation of the difference between energy of states
Simple calculations yield
[TABLE]
[TABLE]
[TABLE]
Let be the solution of the source problem (2.2) or the eigenvalue problem (2.4) and be its approximation. Let , and , where is an interpolation operator. We use (3.6) to obtain an expansion of and (3.7) to obtain an expansion of .
For the source problem:
Let and be the solutions of (2.2) and (2.5), respectively. It holds that
[TABLE]
From the formula (3.6) becomes
[TABLE]
Analyze the items on the right-hand-side of (3.8). Suppose that . With the second term not considered, the rest items in (3.8) are of high order than . Therefore, becomes the dominant factor to determine whether is of higher order than .
For the eigenvalue problem:
Let and be the solutions of (2.4) and (2.6), which satisfy . It holds that
[TABLE]
Notice that . Thus we can obtain
[TABLE]
Based on these above, (3.7) becomes
[TABLE]
Analyze the items on the right-hand-side of (3.9). Similarly, is also the dominant factor to determine whether is of higher order than .
3.2.2. Analysis of the RM element for the eigenvalue problem.
Based on the error estimates of the rectangular Morley element scheme for the source problem (see [22]), the following estimates for the eigenvalue problem follows by standard argument.
Theorem 3.4**.**
Let be the -th eigenvalue of (2.4), and be the -th eigen-pair of (2.6) with . It holds that
- (a)
if , then there exists with , such that
[TABLE]
- (b)
if the mesh is uniform and , then there exists with , such that \big{|}u_{j}-u_{j,h}^{\rm{M}}\big{|}_{1,h}\lesssim h^{2}.
Moreover, we obtain the lower-bound property of eigenvalue approximations by the RM element.
Theorem 3.5**.**
Let and be an exact eigenvalue and its approximation by the RM element. Suppose that and the mesh is uniform. When is small enough, we have
[TABLE]
where is a positive constant independent of .
Proof.
We have the basic expansion by [34, 33], which generalizes the identity introduced by [1],
[TABLE]
From Theorem 3.4, the first two terms can be bounded as
[TABLE]
From a standard interpolation theory in [26], the assumption \big{\|}u_{j,h}^{\rm{M}}\big{\|}_{0,\rho}=1, and Theorem 3.4 (b), the third and last terms have the estimates below
[TABLE]
When is small enough, it follows from Lemma 3.2 that
[TABLE]
Thus, becomes the dominant term on the right-hand-side of (3.11). Hence the result. ∎
4. Reduced rectangular Morley element space for problems
4.1. Reduced rectangular Morley element space
We introduce an reduced rectangular Morley (RRM) element space by
[TABLE]
and, associated with , define
[TABLE]
Theorem 4.1**.**
If is a rectangular subdivision of , then .
Detailed proof of Theorems 4.1 and an available set of basis functions of are put in Appendix B.
For any function in the RRM element space, the number of continuity restrictions across internal edges is greater than {\rm dim}\big{(}P_{2}(K)\big{)}, which makes it a nontrivial task to find out a set of basis functions of , and it is not even easy to tell if the space contains non-zero functions. Actually, the proof of Theorem 4.1 in Appendix B ensures that the RRM element space is non-zero. From the analysis therein, the supports of the basis functions in are not completely local, making it complicated to construct an interpolation operator from to , which, however, plays a fundamental role in the approximation error analysis.
Remark 4.2**.**
Since a non-convex domain which can be covered by a rectangular subdivision can be considered as a combination of several rectangular regions, a nontrivial RRM element space can still be expected on it.
4.2. Approximation property of the RRM element space
The main result of this subsection is the theorem below.
Theorem 4.3**.**
Given , we have
[TABLE]
We postpone the proof of Theorem 4.3 after some technical lemmas. Let \undertilde{f}\in\big{(}\undertilde{H}{}^{1}_{\bf n}(\Omega)\big{)}^{\prime}. We firstly consider the regularity of the Stokes problem: Find , such that
[TABLE]
Lemma 4.4**.**
Let be a rectangle. If , then .
Proof.
As , there exists a unique , such that . Moreover, solves the biharmonic equation:
[TABLE]
By the regularity theory of the biharmonic equation (see [3, Theorem 2 ]), we have , and . Furthermore, , and . The proof is completed. ∎
A related finite element problem is to find , such that
[TABLE]
To ensure the convergence of the finite element scheme in Theorem 4.5, we need the following hypothesis:
Hypothesis RT
A rectangular grid is called to satisfy the hypothesis Hypothesis RT if and only if it is generated by refining a grid twice.
Theorem 4.5**.**
Let be a grid that satisfies Hypothesis RT. Let and be the solutions of (4.3) and (4.4), respectively. If , then
[TABLE]
and further
[TABLE]
Based on Lemma 4.4, the proof of Theorem 4.5 is just a duplication of the proofs of [8, Theorems 3.4–3.5 and Corollary 3.2], and we omit the details here.
Theorem 4.6**.**
Let be a grid that satisfies Hypothesis RT. Given satisfying . It holds that
[TABLE]
Proof.
Let be the exact velocity of (4.3). Denote . It can be verified directly that the pair solves the equation
[TABLE]
Let solve
[TABLE]
then Set , then, from Lemma 2.4, . Moreover, it is easy to verify that
[TABLE]
namely . Furthermore,
[TABLE]
and
[TABLE]
Hence the result. ∎
Lemma 4.7**.**
For the of space , it can be depicted as a special subspace of the vector Park–Sheen element space, i.e.,
[TABLE]
Proof.
Firstly, by standard argument, we can prove the exact sequence which reads
[TABLE]
where . This way, given with , there exists , such that . Since is piecewise linear polynomial, is piecewise quadratic, namely . On the other hand, it is evident that {\rm curl}_{h}V_{hs}^{\rm{R}}\subset\big{\{}\undertilde{z}{}_{h}\in\undertilde{V}{}^{\rm PS}_{h\bf n}:{\rm div}_{h}\undertilde{z}{}_{h}=0\big{\}}. Hence the result. ∎
Proof of Theorem 4.3
[TABLE]
The proof is completed. ∎
5. Convergence analysis of the RRM element schemes
5.1. Optimal convergence for the source problem
For the RM element space and the RRM element space , the discrete source problems are given as:
Find , such that
[TABLE]
Find , such that
[TABLE]
It is obvious that , and we infer that the RRM element is a quadratic nonconforming element on rectangles with a second-order convergence rate in the energy norm. We will verify this assertion strictly in this section.
Theorem 5.1**.**
Let be a grid that satisfies Hypothesis RT. Let and be the solutions of (2.2) and (5.2), respectively. It holds that
- (a)
if , then \big{|}u-u_{h}^{\rm{R}}\big{|}_{1,h}\lesssim h|u|_{2,\Omega}\;\text{and}\;\big{\|}u-u_{h}^{\rm{R}}\big{\|}_{0,\rho}\lesssim h^{2}|u|_{2,\Omega};
- (b)
if and the mesh is uniform, then \big{|}u-u_{h}^{\rm{R}}\big{|}_{1,h}\lesssim h^{2}|u|_{3,\Omega}.
Proof.
(a) By the Strang lemma, we have
[TABLE]
For the first term in the right hand side of (5.3), we have from Theorem 4.3 that
[TABLE]
For the second term, we have from Lemma 3.1 and that
[TABLE]
Submit (5.4) and (5.5) into (5.3), and we obtain \big{|}u-u_{h}^{\rm R}\big{|}_{1,h}\lesssim h|u|_{2,\Omega},\mbox{ where }u\in H_{0}^{1}(\Omega)\cap H^{2}(\Omega).
Given , let and be the solutions of the two problems below, respectively,
[TABLE]
By the Nitsche-Lascaux-Lesaint lemma (see e.g., [26, Theorem 5.3.1]), it holds that
[TABLE]
For the first term in the right side of (5.6), we have
[TABLE]
where we utilize the regularity of solution on a convex domain, namely, .
For the second term, we notice that
[TABLE]
Let be an average projection operator defined in [26]. From [26, Theorem 3.5.4], we have \big{|}u-\Pi_{h0}^{\rm p}u\big{|}_{1,K}\lesssim h_{K}|u|_{2,K} and \big{|}\Pi_{h0}^{\rm p}u\big{|}_{2,K}\lesssim|u|_{2,K}. Thus we obtain
[TABLE]
The last inequality holds due to the fact that \big{|}u-u_{h}^{\rm R}\big{|}_{1,h}\lesssim h|u|_{2,\Omega}. Submitting (5.9) into (5.8), it yields \big{|}E_{h}(\phi_{g},u_{h}^{\rm R})\big{|}\lesssim h^{2}|\phi_{g}|_{2,\Omega}|u|_{2,\Omega}\lesssim h^{2}||g||_{0,\rho}|u|_{2,\Omega}. Similarly, it holds that \big{|}E_{h}(u,\phi_{gh})\big{|}\lesssim h^{2}|u|_{2,\Omega}||g||_{0,\rho}. Thus we have
[TABLE]
Submit (5.7) and (5.10) into (5.6), and we obtain \big{\|}u-u_{h}^{\rm R}\big{\|}_{0,\rho}\lesssim h^{2}|u|_{2,\Omega},\mbox{ where }u\in H_{0}^{1}(\Omega)\cap H^{2}(\Omega).
(b) If and the mesh is uniform, then From Lemma 3.1, Hence we have ∎
It shows that the error estimate in the energy norm can be when the mesh is uniform. However, the convergence rate in -norm can not be improved on uniform grids. Actually, there exists a lower bound stated in the following Theorem 5.2.
Theorem 5.2**.**
Let be a uniform grid satisfying Hypothesis RT. Let and be the solutions of (2.2) and (5.2), respectively. If , then , provided that is small enough.
Proof.
Let be the solution of (5.1). Then
[TABLE]
given that is small enough, where is a constant independent of ; see [22, Lemma 3.18]. Noticing that , we obtain
[TABLE]
A simple division yields
[TABLE]
Owing to the orthogonality and \big{|}u_{h}^{\rm{M}}-u_{h}^{\rm{R}}\big{|}_{1,h}\leqslant\big{|}u_{h}^{\rm{M}}-u\big{|}_{1,h}+\big{|}u-u_{h}^{\rm{R}}\big{|}_{1,h}\lesssim h^{2}, it holds that
[TABLE]
A combination of (5.11), (5.13) and (5.14) leads to the following lower bound, provided that is small enough,
[TABLE]
where is a constant independent of . Therefore we have
[TABLE]
Hence the result. ∎
Remark 5.3**.**
[22, Remark 3.16]* For rectangle domain, the condition implies that \big{\|}\frac{\partial^{2}u}{\partial x\partial y}\big{\|}_{0,\rho}\neq 0. In fact, if \big{\|}\frac{\partial^{2}u}{\partial x\partial y}\big{\|}_{0,\rho}=0, then is of the form , for some function with respect to and with respect to . Then, the boundary condition, i.e., on , indicates , which contradicts .*
5.2. Analysis of the scheme for the eigenvalue problem
With the associated spaces and , the discrete eigenvalue problems are given as:
Find with \big{\|}u_{h}^{\rm{M}}\big{\|}_{0,\rho}=1, such that
[TABLE]
Find with \big{\|}u_{h}^{\rm{R}}\big{\|}_{0,\rho}=1, such that
[TABLE]
From Theorem 5.4, the convergence results of the eigenvalue problem is obtained by standard argument (see, e.g., [31, 9, 34, 32]).
Theorem 5.4**.**
Let be a grid satisfying Hypothesis RT. Let be the -th eigenvalue of (2.4), and be the -th eigen-pair of (5.16) with \big{\|}u_{j,h}^{\rm{R}}\big{\|}_{0,\rho}=1. It holds that
- (a)
if , then there exists with , such that
[TABLE]
- (b)
if the mesh is uniform and , then there exists with , such that \big{|}u_{j}-u_{j,h}^{\rm{R}}\big{|}_{1,h}\lesssim h^{2}.
Similar to the basic relation between and its conforming approximation for eigenvalue problems in [2], the following relation holds.
Lemma 5.5**.**
Let be an eigen-pair of (5.15) with \big{\|}u_{h}^{\rm{M}}\big{\|}_{0,\rho}=1. Denote, the Rayleigh quotient, by . For any with , it holds that
[TABLE]
Proof.
From \|v_{h}\|_{0,\rho}=\big{\|}u_{h}^{\rm{M}}\big{\|}_{0,\rho}=1 and , it is equivalent to prove that
[TABLE]
where we utilize again the assumption: .∎
Theorem 5.6**.**
Let , and be the -th exact eigen-pair and its discrete approximations with \|u_{j}\|_{0,\rho}=\big{\|}u_{j,h}^{\rm{R}}\big{\|}_{0,\rho}=\big{\|}u_{j,h}^{\rm{M}}\big{\|}_{0,\rho}=1. Assume that and the mesh is uniform. Provided that is small enough, we have
[TABLE]
where is a positive constant independent of .
Proof.
Since , the second inequality, or , holds from the minimum-maximum principle [2]. Let in Lemma 5.5. We obtain
[TABLE]
From Theorem 3.4, Theorem 5.4, and the triangle inequality, it holds that
[TABLE]
A combination of (3.10), (5.19), and (5.20) yields that
[TABLE]
Hence the result. ∎
Remark 5.7**.**
To the best of our knowledge, the RM element and the RRM element are the only two elements, by which eigenvalue approximations have the same convergence rates as that of eigenfunction approximations in the energy norm.**
5.3. Implementation and numerical results
5.3.1. Implementation
Since constructing clearly a basis functions of on an arbitrary grid is sophisticated, we now present an available approach how (5.2) and (5.16) can be implemented. We start with the fact that V_{hs}^{\rm{R}}=\Big{\{}w_{h}\in V_{h0}^{\rm{W}}:\int_{e}\llbracket{\partial_{n_{e}}w_{h}}\rrbracket=0,\forall e\in\mathcal{E}_{h}^{i}\Big{\}}. Define the space of piecewise constant functions defined on .
An equivalent formulation of (5.2) is to find , such that
[TABLE]
An equivalent formulation of (5.16) is to find with , such that
[TABLE]
Problem (5.21) admits a solution , where solves problem (5.2), and problem (5.22) admits a solution , where solves problem (5.16).
Remark 5.8**.**
It’s worth mentioning that formulations (5.21) and (5.22) can be applied to an arbitrary quadrilateral grid [36]. For the case wherein the grid comprises rectangles, a detailed construction process of basis functions of is given in Appendix B, based on which (5.2) and (5.16) can be implemented directly in elliptic formulation.**
5.3.2. Numerical experiments
Let . We consider nonuniform meshes (see Figure 1) with \frac{h_{x,K}}{h_{y,K}}\in\Big{\{}\frac{0.35}{0.65},\frac{0.65}{0.35},\frac{1}{1}\Big{\}}, and uniform meshes with . Numerical examples of the source problem and the eigenvalue problem are given below.
Example 1 for the source problem.
Consider (2.1) with . The exact solution is computed as . Apply (5.21) to get the discrete solutions on uniform and nonuniform meshes. From Figure 2, the convergence rate is in the energy norm, and in -norm, on a nonuniform mesh. Both rates reach order on uniform grids.
Example 2 for the eigenvalue problem.
Consider (2.3) with . Then we have the exact eigenfunctions and eigenvalues Arrange them by increasing order. Apply (5.22) to get the the smallest six discrete eigenvalues. From Figure 3, the convergence rates of eigenvalues almost reach order in both nonuniform and uniform cases. Moreover, from tables 1 and 2, the eigenvalue approximations by the RRM element converge monotonically from below to the exact ones.
6. Conclusions and discussions
6.1. Concluding remarks
In this paper, we present a reduced rectangular Morley element scheme for problems. Technically, the exactness relation between the RRM element and the PS element is figured out, and the approximation error estimate is established by an auxiliary Stokes problem. For the source problem, the convergence rate of this scheme is in the energy norm and in -norm, on general meshes. The error estimate in the energy norm reaches order on uniform grids. Besides, a lower bound of the -norm error is proved, and the best -norm error estimate is at most . For the eigenvalue problem, the discrete eigenvalues by the RM element and the RRM element are both proved to be lower bounds of the exact ones. In fact, the inequality (3.1), reads , or (3.2), reads , is the dominant factor for the RRM element to yield these lower bounds, where is the interpolation operator for the RM element.
Roughly speaking, for schemes which provide the lower bounds of the eigenvalues, a smaller space provides a better approximation. This can be viewed as a motivation for the optimal space.
6.2. Further discussions
In this paper, we mainly focus on the convex domain (rectangle domain) case. Also, for the eigenvalue problem, we pay special attention to the computation of eigenvalues. Some more numerical experiments illustrate that the schemes can perform even better than the theoretical description in this paper. These can stimulate further research, and we list part of them below.
(1) Consider the eigenvalue problem (2.3) with on . From Figure 4, right, the convergence rate of the first eigenfunction in -norm reaches order on uniform grids, while in Theorem 5.4 we can only derive \big{\|}u_{j}-u_{j,h}^{\rm R}\big{\|}_{0,\rho}\leqslant\big{|}u_{j}-u_{j,h}^{\rm R}\big{|}_{1,h}\lesssim h^{2}. Although, there exists a lower bound of the -norm error for the source problem, it may not holds for the eigenvalue problem, and it is possible that the convergence rate of the eigenfunctions in -norm may be higher than that in the energy norm.
(2) Consider the source problem (2.1) on L-shape domain: . From Figure 5, the convergence rates are consistent with the results derived on . Although Theorem 5.1 for the source problem is based on the assumption of convex domain, this example implies that the RRM element may also be applicable to non-convex regions.
(3) Consider the eigenvalue problem (2.3) with on L-shape domain. The eigenfunctions and eigenvalues are unknown, and eigenfunctions may have singularities around the reentrant corner. From [2], the third eigenfunction is analytic: . We present the errors of in Figure 6, and observe that the convergence rates for error on L-shape domain are the same as that on a rectangle region. Moreover, the third eigenvalue computed by the RRM scheme satisfies and the convergence rate is . The perfermance of the smallest six eigenvalues with nonuniform and uniform subdivisions are listed in Tables 3 and 4.
These examples suggest that the RRM element may have better numerical applications, and these will be studied in our future work.
Appendix A Construction of basis functions for the moment-continuous (MC) element space
Let be a polygonal region subdivided into a rectangular grid . Define the moment-continuous (MC) element spaces as
[TABLE]
[TABLE]
They have the following equivalent definitions:
[TABLE]
[TABLE]
In this section, we will present available sets of basis functions of and .
A.1. Compatibility conditions
Let be a rectangle with the vertices and the Gauss–Legendre points on the boundary (see Figure 7), where and . Let and be the coordinates of second-order Gauss-Legendre points on . By a pure linear algebra argument, we have the following description of .
Lemma A.1**.**
Given , , . There exists , such that , if and only if the following compatibility conditions are satisfied on ,
[TABLE]
Proof.
To prove (A.5), we connect the vertices and . Let and be the two Gauss points on . Then we obtain that (see [7, (2)])
[TABLE]
and
[TABLE]
Thus (A.5) follows. Since the two directional derivatives of belongs to , (A.6) and (A.7) hold. ∎
A set of basis functions of are listed below. Note that with being the bilinear functions and and being the bubbles in two directions, these six functions form a set of basis functions with respect to the Wilson element.
Local basis functions of :
[TABLE]
Lemma A.2**.**
Let . The following results hold.
- (1)
If , then 2. (2)
If , then 3. (3)
If , then .
Remark A.3**.**
A polynomial is uniquely determined by its evaluations on only up to multiplicated by a constant.**
A.2. Patterns of supports of basis functions in and
Suppose that the domain is divided into rectangles; see Figure 8. In direction, it is decomposed to rows, each being (), and in direction, it is decomposed to columns, each being (). The vertices are labeled by , and the cells by . That is, , and it has four vertices as , , , and .
We call the support set of a basis function a pattern. Below we present four kinds of patterns sequentially, namely, cell patterns in Lemma A.4, vertex patterns in Lemma A.5, column patterns and row patterns in Lemma A.6.
Lemma A.4**.**
Let be defined in Remark A.3 on , , . Then, .
Lemma A.5**.**
Let denote a function defined on the support patch associated with , which is bilinear on every element in . Then, , , and , .
Lemma A.6**.**
Let be a patch with boundaries , anticlockwise; see Figure 9. Let denote a moment-continuous space restricted on .
(a) Let be the union of elements in the -th column; see Figure 9 (Left). We define
[TABLE]
Let be a function defined on , which is equal to on every . Then , and furthermore, V_{{\rm col},i}^{\rm MC}={\rm{span}}\big{\{}\varphi_{i}^{x}\big{\}}\oplus{\rm{span}}\big{\{}\varphi_{0,K_{i}^{j}}\big{\}}_{j=1}^{n}.
(b) Let be the union of elements in the -th row; see Figure 9 (Right). We define
[TABLE]
Let be a function defined on , which is equal to on every . Then , and furthermore, V_{{\rm row},j}^{\rm MC}={\rm{span}}\big{\{}\varphi_{j}^{y}\big{\}}\oplus{\rm{span}}\big{\{}\varphi_{0,K_{i}^{j}}\big{\}}_{i=1}^{m}.
Proof.
We present the proof of (a), and omit the proof of (b), which can be obtained similarly. Suppose that . Let be a function in . Denote by the value of on a Gauss point in Figure 9. According to Lemma A.1, it holds on the element that
[TABLE]
It follows from (A.9) - (A.11) that Apply Lemma A.1 to on , and we obtain Repeat the process for the whole row, and we have By definition, it is obvious that . From Remark A.3, we derive that V_{{\rm col},i}^{\rm MC}=\text{span}\big{\{}\varphi_{i}^{x}\big{\}}\oplus\text{span}\big{\{}\varphi_{0,K_{i}^{j}}\big{\}}_{j=1}^{n}. ∎
Here and throughout this paper, we do not distinct , , , and their respective extension onto the whole domain by zero. Thus we also obtain and .
A.3. Structure of the MC element space
Here we will present the construction of basis functions in spaces and .
Theorem A.7**.**
Let be a rectangular subdivision of . Then,
Proof.
It is obvious that . We only have to show that , i.e., any function in the former is the combination of functions in the latter.
Here we use a sweeping procedure. Let . First, by Lemma A.2, we have that with some constants and . Therefore, with and vanishing on . Second, with and vanishing on and . Furthermore, repeat this process on all the cells of the first column, and we obtain that
[TABLE]
where and vanishes on the whole column . Finally, we repeat the process from to , and obtain that
[TABLE]
Hence the result. ∎
Theorem A.8**.**
Let be a rectangular subdivision of . Then, we have
[TABLE]
Proof.
It is obvious that . Here we have noted that, if with , , and , then . We only have to show the other direction. Let .
First, by (A.8), there exists unique constants , and , such that
[TABLE]
Thus, we have with and . Second, by Lemma A.2, we have Therefore, we obtain with and .
Furthermore, repeat this process on the column , and we obtain
[TABLE]
where and .
Similarly, repeat this process on the row , and we have
[TABLE]
with , and . Finally, by the same technique as used in the proof of Theorem A.7, we can prove that
[TABLE]
A combination of (A.12), (A.13), and (A.14) leads to
[TABLE]
Hence the result. ∎
Remark A.9**.**
From the above two theorems, it holds that and .**
Proposition A.10**.**
Define V^{(2)}_{h}:=\Big{\{}v_{h}\in H^{1}(\Omega):v_{h}|_{K}\in P_{2}(K),\forall K\in\mathcal{G}_{h}\Big{\}}, and . That is, and are conforming element spaces. Then,
- (1)
, and 2. (2)
, and
Proposition A.11**.**
Let be the Wilson element space and be its homogeneous subspace. Then
- (1)
, and 2. (2)
, , , and .
Appendix B Construction of basis functions for the reduced rectangular Morley (RRM) element space
Let be rectangle domain divided by rectangles. Define the reduced rectangular Morley element spaces as
[TABLE]
[TABLE]
In this section, we will present an available set of basis functions of .
B.1. Compatibility conditions
By a pure linear algebra argument, the following description holds for .
Lemma B.1**.**
([36, Lemma 15])* Let be a rectangle with vertices and edges (). Denote its length and width by and , respectively; see Figure 13 (Left). Then, given , there exists a uniquely satisfying*
[TABLE]
if and only if the following compatibility conditions are satisfied on ,
[TABLE]
Recall the definitions of , , and in Appendix A. Also, the vertices are labeled by , the midpoints on any edge by and , and the cells by ; see Figure 13 (Right). Next we present some local or global functions in by giving their value on and derivative on the midpoint of .
B.2. Patterns of supports of basis functions in
Associated with , we present some patterns, i.e., the support sets of basis functions in the RRM element space. To begin with, we introduce some notations. An interior edge, denoted by , is called a bottom interior edge if its two endpoints are interior points, and its lower opposite edge is on the bottom of . A top interior edge , a left interior edge , and a right interior edge are defined in a similar way .
In the following lemmas, we always denote, by , a generic patch with boundaries (), anticlockwise.
Lemma B.2**.**
Let () be a bottom interior edge with endpoints and . Let be a cells patch as shown in Figure 14, left. Define
[TABLE]
Likewise, we can define (see Figure 14, right), , and (see Figure 15, left and right), where and . Then we have .
Proof.
First, we consider . Let the geometric features of be represented as in Figure 14, left. Given , denote by , , and . Apply conditions (B.3) and (B.4) on every element, we have, row by row,
[TABLE]
Rewrite the system after adjusting the order,
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
It is straightforward to verify that \eqref{eq:3}-\eqref{eq:1}-\eqref{eq:5}-\big{[}\eqref{eq:9}-\eqref{eq:7}-\eqref{eq:11}\big{]}=0. The system admits a one-dimension solution space. Thus we obtain . Likewise, we have ). ∎
With similar procedures in Lemma B.3, the following two lemmas can be obtained.
Lemma B.3**.**
Let be an interior node in the northeast corner. Let be a patch as shown in Figure 16, left. Define V_{X}^{\rm R}:=\Big{\{}v_{h}\in V_{hs}^{\rm{R}}(\omega):\fint_{e}\partial_{n_{e}}v_{h}\,ds=0,\ \forall e\subset\Gamma_{l}\ (l=1,2)\Big{\}}. Then .
Lemma B.4**.**
([36, Lemma 15])* Let be a patch as shown in Figure 16, right. Define V_{K_{i}^{j}}^{\rm R}:=\Big{\{}v_{h}\in V_{hs}^{\rm{R}}(\omega):\fint_{e}\partial_{n_{e}}v_{h}\,ds=0,\ \forall e\subset\Gamma_{i}\ (1\leqslant l\leqslant 4)\Big{\}}, where and . Then .*
Lemma B.5**.**
Let be a or patch in Figure 17, left and right, respectively. Define
[TABLE]
Then, and implies on
Lemma B.6**.**
If we denote the union of elements in the -th column with boundaries (see Figure 18, left), and define
[TABLE]
then . If (see Figure 18, right), and define
[TABLE]
then .
Proof.
Obviously, . Assume that . We denote , where ; see Figure 18 (Left). Apply (B.3) and (B.4) to on each element in , and we obtain . It proves that . Similarly, assume that and denote . We have ; see Figure 18 (Right). Thus we obtain . ∎
Remark B.7**.**
Here and throughout this paper, we do not distinct between V_{X}^{\rm R},$$V_{K_{i}^{j}}^{\rm R}, and their respective extension onto the whole domain by zero. Each of them is a subspace in .**
B.3. Structure of the RRM element space
Theorem B.8**.**
Let be a rectangular subdivision of . Define V_{btlr}^{\rm R}:=\oplus_{i,j}\Big{(}V_{{\rm bot},i}^{\rm R}\oplus V_{{\rm top},i}^{\rm R}\oplus V_{{\rm lef},j}^{\rm R}\oplus V_{{\rm rig},j}^{\rm R}\Big{)}, , and , where , and . Then we have .
Proof.
Here we utilize the sweeping procedure again, and divide the proof process into four steps.
Step 1. Given . We begin with the boundaries of ; see Figure 19. Recall the definition of , , , and . Associated with , is a subspace of defined in Lemma B.2. There exists a unique function , such that . Then, with on the bottom edge of . Repeat the procedure for , …, , and we obtain with vanishing on the first edges on the bottom boundary of . Similarly, we obtain functions , , and . Therefore, with vanishing on the dotted edges; see Figure 19 (Middle).
Step 2. There exists uniquely in and in , which satisfy , and , respectively. Then with vanishing on the dotted edges; see Figure 19 (Right).
Step 3. Consider elements in the first column ; see Figure 17. Note that is the only interior element whose patch contains . There exists uniquely , such that . Therefore, vanishes on . Next, there exists a unique , such that vanishes on on . Repeating the procedure for , we obtain , which vanishes on . Notice that is a patch stated in Lemma B.5; see Figure 20 (Left). Since vanishes on , it vanishes on and further .
By repeating the procedure along the column , we derive , which vanishes on . Especially, (). Since forms a patch (see Figure 20, middle) and , thus it vanishes on . Find other or patch , which satisfies the conditions in Lemma B.5, in columns , , and . Therefore, we derive that vanishes on except for a patch in the northeast corner; see Figure 20 (Right).
Step 4. From Lemma B.3, there exists a unique function and . This way, we have verified that , and this representation by these functions is unique. ∎
Remark B.9**.**
From Theorem B.8, it holds that .**
Proposition B.10**.**
It holds for , , , , , and that
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. G. Armentano and R. G. Durán. Asymptotic lower bounds for eigenvalues by nonconforming finite element methods. Electronic Transactions on Numerical Analysis , 17(2):93–101, 2004.
- 2[2] I. Babuška and J. Osborn. Eigenvalue problems. In Finite Element Methods (Part I) , volume 2 of Handbook of Numerical Analysis , pages 641–787. Elsevier, 1991.
- 3[3] H. Blum, R. Rannacher, and R. Leis. On the boundary value problem of the biharmonic operator on domains with angular corners. Mathematical Methods in the Applied Sciences , 2(4):556–581, 1980.
- 4[4] C. Carstensen and D. Gallistl. Guaranteed lower eigenvalue bounds for the biharmonic equation. Numerische Mathematik , 126(1):33–51, 2014.
- 5[5] C. Carstensen and J. Gedicke. Guaranteed lower bounds for eigenvalues. Mathematics of Computation , 83(290):2605–2629, 2014.
- 6[6] C. Chen. Finite element superconvergence structure theory . Hunan Science and Technology Press, Hunan, 2001.
- 7[7] M. Fortin and M. Soulie. A non-conforming piecewise quadratic finite element on triangles. International Journal for Numerical Methods in Engineering , 19(4):505–520, 1983.
- 8[8] V. Girault and P. A. Raviart. Finite element methods for Navier-Stokes equations: theory and algorithms , volume 5. Springer Science & Business Media, 2012.
