Optimal estimation for the Fujino-Morley interpolation error constants
Shih-Kang Liao, Yu-Chen Shu, Xuefeng Liu

TL;DR
This paper develops a new finite element-based algorithm to accurately estimate the interpolation error constants for Fujino-Morley operators, providing concrete bounds and analyzing shape perturbations.
Contribution
It introduces a verified computational method for lower bounds of eigenvalues related to interpolation error constants, including shape variation analysis.
Findings
Provided concrete upper bounds for Fujino-Morley interpolation error constants.
Developed a new algorithm based on finite element methods with verified computation.
Analyzed how eigenvalues vary with shape perturbations of triangles.
Abstract
The quantitative estimation for the interpolation error constants of the Fujino-Morley interpolation operator is considered. To give concrete upper bounds for the constants, which is reduced to the problem of providing lower bounds for eigenvalues of bi-harmonic operators, a new algorithm based on the finite element method along with verified computation is proposed. In addition, the quantitative analysis for the variation of eigenvalues upon the perturbation of the shape of triangles is provided. Particularly, for triangles with longest edge length less than one, the optimal estimation for the constants is provided. An online demo with source codes of the constants calculation is available at http://www.xfliu.org/onlinelab/.
| 0.167349 | 0.488767 | |
| 0.117134 | 0.318457 | |
| 0.245388 | 1.187998 | |
| 0.108221 | 0.327955 |
| 0.090287 | 0.233708 | |
| 0.073583 | 0.174354 | |
| 0.093318 | 0.300773 | |
| 0.060474 | 0.188918 |
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
TopicsModel Reduction and Neural Networks · Advanced Numerical Methods in Computational Mathematics · Numerical Methods and Algorithms
∎
11institutetext: Shih-Kang Liao 22institutetext: Graduate School of Science and Technology, Niigata University, Japan; Department of Applied Mathematics, National Cheng Kung University, Tainan, Taiwan
22email: [email protected] 33institutetext:
Yu-Chen Shu44institutetext: Department of Mathematics, National Cheng Kung University, Tainan, Taiwan
44email: [email protected] 55institutetext:
Xuefeng Liu (corresponding author) 66institutetext: Graduate School of Science and Technology, Niigata University, Japan
66email: [email protected]
Optimal estimation for the Fujino–Morley interpolation error constants
Shih-Kang Liao
Yu-Chen Shu
Xuefeng Liu
(Received: date / Accepted: date)
Abstract
The quantitative estimation for the interpolation error constants of the Fujino–Morley interpolation operator is considered. To give concrete upper bounds for the constants, which is reduced to the problem of providing lower bounds for eigenvalues of bi-harmonic operators, a new algorithm based on the finite element method along with verified computation is proposed. In addition, the quantitative analysis for the variation of eigenvalues upon the perturbation of the shape of triangles is provided. Particularly, for triangles with longest edge length less than one, the optimal estimation for the constants is provided. An online demo with source codes of the constants calculation is available at http://www.xfliu.org/onlinelab/.
Keywords:
Fujino–Morley interpolation operatorfinite element methodverified computingeigenvalue problem
1 Introduction
The Fujino–Morley111The element discussed here is often called by “Morley element” in the existing literature. However, the same element is also proposed independently by T. Fujino in P.739 of Fujino1971 (proceedings of a conference on 1969), which is also cited by L.S.D. Morley in Morley1971 . finite element method (FEM) Fujino1971 ; Morley1968 ; Morley1971 provides a robust way to solve partial differential problems evolving bi-harmonic operators. Especially, in solving the eigenvalue problem of bi-harmonic operators, the Fujino–Morley FEM along with the Fujino–Morley interpolation operator can be utilized to find explicit lower bound for the eigenvalues; see the work of Carstensen–Gallistl Carstensen2013 and Liu Liu2015AMC . For the Fujino–Morley interpolation, there are two fundamental constants that are playing important roles in bounding the eigenvalues. In liu-you-amc-2018 , such constants are used to estimate the interpolation error constant for the quadratic Lagrange interpolation operator. Rough bounds of the two constants have been given in Carstensen2013 by using theoretical analysis. In this paper, we will propose a FEM based method to provide the optimal estimation of the constants.
Let be a triangle element with the largest edge length as . The vertices of are denoted by , and and the edges by ; see Fig. 1.
Over , we define the Fujino–Morley interpolation operator . For given , is a quadratic polynomial that satisfies
[TABLE]
For such an interpolation operator, the following error estimation is needed in numerical analysis, especially in solving the problem of bounding eigenvalues for bi-harmonic operators Carstensen2013 ; Liu2015AMC ; see, also, Theorem 3.1 for details of lower eigenvalue bounds evaluation:
[TABLE]
The definition of constants and can be found in (6). In carstensen2014guaranteed ; Carstensen2013 , to bound , the Crouzeix-Raviart constant is introduced. Using the fact , the rough bounds for the constants are given by
[TABLE]
In Liu2015AMC , the optimal estimation of is given as
[TABLE]
In this paper, we provide an algorithm to evaluate the constants directly and verify that the following estimation of the above two constants holds for element of arbitrary shapes.
[TABLE]
The lower bounds of these constants means there exists element such that cannot be smaller than the lower bound provided here. To have rigorous computation results, the INTLAB toolbox of interval arithmetic Ru99a is adopted for the evaluation of the constants. Particularly, the rigorous eigenvalue estimation for matrices is based on the algorithm of Behnke behnke1991calculation .
The method to be proposed in this paper for estimating constant and can also be used to estimate the constants of other interpolation operators. For example, let be the Lagrange interpolation operator or the Fujino–Morley interpolation operator defined over triangle , the following interpolation error estimation holds.
[TABLE]
In §6, sharp evaluation of constants and is provided; see detailed results in Table 1 and Table 2.
The rest of this paper is arranged as follows. In §2, constants and and the function space setting are introduced. The method to solve eigenvalue problems corresponding to constants is presented in §3. The theoretical analysis about the perturbation of eigenvalues on element shape variation is performed in §4. In §5, the algorithm to bound the constants for elements of arbitrary shapes is proposed and the optimal estimation is obtained. In §6, the optimal bound for and is applied in bounding error constants for other interpolation operators.
2 Preliminary
Function spaces
The standard notation for Sobolev space is used in this paper. That is, denotes the norm for space; denotes the th order semi-norm for functions in . In many cases, the subscript will be omitted if the domain is self-evident. The gradient operator is denoted by and the second order derivative is given by for . The inner product of or is denoted by .
Definition of constants
To give the definition of the interpolation constants and , let us introduce the kernel space of ,,denoted by , when the operator is applied to a triangle element . That is,
[TABLE]
Over space , the constants are defined by using the Rayleigh quotient.
[TABLE]
Given a reference triangle with , let be the triangle obtained through scaling by times, that is, . It is easy to see that , .
Below, we also introduce the Crouzeix-Raviart interpolation constant, which will help to find the optimal estimation of the constant .
Crouzeix-Raviart interpolation constant
Given , the Crouzeix-Raviart interpolation is a linear polynomial over such that
[TABLE]
The Crouzeix-Raviart constant associated to is defined as follows,
[TABLE]
where
[TABLE]
The Crouzeix-Raviart interpolation constant is well investigated in Liu2015AMC :
- a)
When vertices and of are fixed, the value of has monotonicity upon the coordinate of . 2. b)
For all triangles with diameter less than , the maximum value of has a rigorous bound as follows,
[TABLE] 3. c)
Numerical computation implies the maximum value is achieved when is a regular triangle.
For the relation between and , we have the following lemma (see, e.g., Carstensen2013 ).
Lemma 2.1
* for all triangle .*
Proof. One can draw the conclusion by noticing that for any and the inequalities , .
The task to obtain the optimal estimation of constants can be divided into two steps.
- Step 1.
Direct evaluation for and for several sample triangles by solving the corresponding eigenvalue problem along with the Fujino-Morley FEM; see the detail in §3. 2. Step 2.
Perturbation analysis of constant and upon the change of shape of triangle element, where the monotonicity of constant and will play an important role; see the detail in §4 and §5.
For the purpose of simplicity, the vertices of are located at , , , while and . Also, due to the symmetry of the position of , only the case that will be considered. As a summary, we will focus on triangles with inside the following area (see Fig. 2):
[TABLE]
3 Point-wise estimation of constants and
In this section, let us describe the algorithm to estimate constants and . The interpolation constants are determined by solving eigenvalue problems of bi-harmonic operators, and their upper bounds will be evaluated by applying the Fujino-Morley FEM. The lower bounds of the interpolation constants will be discussed in §5.3, where the conforming polynomial spaces are used.
The constants and are corresponding to the eigenvalues of the following eigenvalue problems.
Problem a)
Find and such that
[TABLE]
Problem b)
Find and such that
[TABLE]
The distribution of eigenpairs of Problem a) and Problem b) has been well investigated under the theories for compact self-adjoint differential operators; see, e.g., Barbuska1991 . Let and be the smallest eigenvalue of Problem a) and b), respectively. Then, it is easy to see that
[TABLE]
To give explicit bound of and , let introduce several finite element spaces. Let be a proper triangulation of domain . A general Fujino–Morley finite element space has the member function with the following properties.
- a)
is piece-wise quadratic polynomial on each element of ; 2. b)
is continuous on each vertex; 3. c)
is continuous across each interior edge .
To approximate (see definition at (5)), let us define a subspace of by introducing boundary conditions.
[TABLE]
[TABLE]
Next, let us define the approximate eigenvalue problems over . Since the function in may not have continuity across interior edges, the differential operators and are piece-wisely defined on the triangulation .
Problem a’)
Find and such that
[TABLE]
Problem b’)
Find and such that
[TABLE]
Denote the smallest eigenvalue of a’) and b’) by and , respectively.
Below, we quote Theorem 2.1 of Liu2015AMC for the purpose of bounding eigenvalues, where the spaces and bilinear forms are taken as follows.
[TABLE]
[TABLE]
Particularly, is an inner product for .
Theorem 3.1
Let be the projection with respect to inner product , i.e., for any
[TABLE]
Suppose there exist quantities and such that for any
[TABLE]
Then we have,
[TABLE]
Remark 1
The above theorem does not require . Thus, we can use non-conforming finite element methods to obtain lower eigenvalue bounds.
Due to the special setting of the nonconforming space , the projection here is nothing else but the Fujino–Morley interpolation defined over . That is,
[TABLE]
The error constants and are given by
[TABLE]
From existing estimation of and , as quoted in (3) and (4), we have
[TABLE]
Therefore, the explicit lower bounds of and are given as
[TABLE]
Remark 2
The technique of K. Kobayashi in Kobayashi-2015-CM can be applied here to provide upper bound of (lower bound of ) directly without a prior information of , i.e., the rough bound in (3) and (4).
4 Variation of constants upon perturbation of triangle
shape
In the last section, Theorem 3.1 provides a method to bound constants for a concrete triangle . To bound constant and for triangles of arbitrary shapes, we need to consider the variation of constants upon the perturbation of triangle shape.
Linear perturbation of triangle
Define linear mapping by
[TABLE]
where and . Apply to the point of by
[TABLE]
and is the triangle with vertices and . For the variation of norms of on under , we have the following lemma.
Lemma 4.2
Given and define , where Q=\left(\begin{array}[]{cc}1&\alpha\\ 0&\beta\end{array}\right), and . Define . Then
- (a)
For -norm, we have
[TABLE] 2. (b)
For -norm, we have
[TABLE] 3. (c)
For the -norm, we have
[TABLE]
Proof. The equality of (a) is evident. Let be the triangle with fixed vertices and . Let us introduce the linear transform of . Since , we have
[TABLE]
where and denoted the minimum and maximum eigenvalues of , respectively. Therefore
[TABLE]
The eigenvalues of are listed below:
[TABLE]
where .
For the second order derivatives, we have
[TABLE]
where
[TABLE]
We denote the minimum and maximum eigenvalues of by and , respectively. For the norm, we have
[TABLE]
where the minimum and maximum eigenvalues are
[TABLE]
Remark 3
Note that there are repeated eigenvalue of positive definite matrix with algebraic multiplicity 2. It’s easily to verify by using the fact
Below, we show several results for special values of and .
Lemma 4.3
Let , . For , we have
[TABLE]
and
[TABLE]
For , we have
[TABLE]
and
[TABLE]
Next lemma will be used in case of the perturbation of along the arc with center as and radius as .
Lemma 4.4
For , , define linear mapping with the following and ,
[TABLE]
Then, in case ,
[TABLE]
where and are defined by
[TABLE]
In case , the above inequalities hold by exchanging the value of and .
Proof
This lemma is a direct result of Lemma 4.2 by noticing the following relations.
[TABLE]
4.1 Properties of constant
Theorem 4.2
Let be the triangle with vertices , , , then monotonically increases as increases.
Proof
Take , () for transformation in (17). Then moves along y-direction and
[TABLE]
Then we can easily draw the conclusion from the definition of the constant.
Below we consider the perturbation of along direction. By using Lemma 4.2 and 4.4, we can easily obtain the following result.
Theorem 4.3
Let be the triangle with vertices , , () and be the triangle with vertices , and (). We have the following two inequalities:
[TABLE]
4.2 Properties of and
As shown in (4), an upper bound of is known already via the estimation of . For the purpose of a more accurate estimation for , the perturbation of respect to will be required in next section.
As a preparation, let us consider the perturbation analysis of upon moving along the direction.
Theorem 4.4
Let be the triangle with vertices , , () and be the triangle with vertices , and () with the condition . Then,
[TABLE]
Proof
Take , for transformation in (17). Since for , , from Lemma 4.2 , we have
[TABLE]
By using Eq. (8) and the above two equations, we have
[TABLE]
In case , we have
[TABLE]
and in case of and , we have
[TABLE]
Thus we can draw the conclusion.
Remark 4
In the above proof, we use polynomial of to simplify the expression in (20). The estimation of the constant has the exact order up to linear term , while the coefficients of quadratic term are overestimated for the purpose of a simple expression.
Theorem 4.5
Let be the triangle with vertices , , () and be the triangle with vertices , and (). Assume , we have
[TABLE]
[TABLE]
Proof
Let Q=\left(\begin{array}[]{cc}1&\alpha\\ 0&1+\epsilon\end{array}\right) be the linear mapping from to . Usually, varies under the transform . However, for , we still have . To see this, notice that the condition implies , where is the tangent vector of . From the condition , we have
[TABLE]
where is the unit norm vector on . Hence,
[TABLE]
From Lemma 4.2, we have, with ,
[TABLE]
Define
[TABLE]
By taking the Taylor expansion of at , we have, for ,
[TABLE]
[TABLE]
By the definition of constant , we can draw the conclusion.
Remark 5
In the estimation (23) and (24), the coefficients of and agree with the ones in Taylor expansion, while the coefficients of and are over-estimated for the purpose of simple expression.
5 Optimal estimation of constants
From the monotonicity of on -coordinate of as shown in Theorem 4.2, the maximum value of can only happens on the arc , . Since the value of depends on the - and -coordinate of , can be regarded as a function on , . Fig. 3 displays the contour lines of respect to in . Numerical estimation of implies that the maximum is taken when is the regular triangle.
5.1 Optimal estimation of
On arc , , we perform point-wise evaluation of on a subdivision of . Then the bound of on whole arc is obtained by applying perturbation theory in Theorem 4.3.
Define and by
[TABLE]
[TABLE]
For each , we evaluate the constant , then using the Theorem 4.3 to give a upper bound of on each sub-interval with perturbation
Fig. 4 displays the upper bound of , where -coordinate denote the size of with range as . The verified computing results show that
[TABLE]
5.2 Optimal estimation of
The estimation of is relatively easily done, which is thanks to the monotonicity of the constant with respect to the -coordinate of vertex of . However, such property of monotonicity is not available for . Thus, one has to consider the case of collapsed triangles (the vertex being close to -axis), which is difficult to process because the estimation of Theorem 4.5 has divergent bound for small -coordinate of vertex . To avoid such difficulties, we subdivide the area into two parts: (see Fig. 6). On , we can estimate directly; on , the estimation of is done through for collapsed triangles by using the relation .
The approximate numerical evaluation of and are displayed in Fig. 5, from which we have the following information.
The maximum value of happens when tends to 2. 2.
The maximum value of happens at . 3. 3.
when tends to . 4. 4.
The constant gives a nice bound (in the sense that the value of is less than ) for when is below .
The above properties of implies the optimal estimate value of can be done by following the strategy below:
- Step 1.
Separate the region into parts and as follows(see Fig. 6):
[TABLE]
- Step 2.
In , by evaluating the constant for several position of and apply the perturbation result in Theorem 4.5, we will have
[TABLE] 3. Step 3.
In , the upper bound of will be obtained through ,
[TABLE]
Below, we show the details to obtain (25) and (26).
Estimation of in
Let be the triangle with vertices at , , . Evaluation of upper bound of tells that . Notice that for all , and . By applying estimation (22) in Theorem 4.5 with and , we have
[TABLE]
Estimation of in
Numerical results implies and have the same supremum on , which is reached when tends to . Since holds strictly, we just focus on . Due to the monotonicity of on , the maximum value of is taken on either of the following two boundaries.
[TABLE]
- •
On , we subdivide into small closed intervals:
[TABLE]
Here, .
The estimation of on each is displayed in Fig. 7. The circles in Fig. 7 denote the point-wise evaluation of and the short bars denote the upper bound of based on Theorem 4.4. The computation results tell that
[TABLE]
- •
To estimation of on , we take the subdivision of as follows
[TABLE]
Define , . From the estimation in Theorem 4.2 of LiuLiu2015AMC , we can estimate for in each interval and . In Fig. 8, the point wise estimation of on and the upper bound of for each interval are displayed. Computation results indicate that the supremum of is reached when tends to . We have the following strict bound of
[TABLE]
The estimation (27), (28) and (29) validate the results in (25) and (26). Thus, we can draw the conclusion that
[TABLE]
Remark 6
The asymptotic value of when the vertex of tends to can be determined by theoretical analysis. Below is a sketch of determining . With the analogous argument as in Theorem 5 of LIU-Kikuchi , the eigenvalue corresponding to is determined by solving the following eigenvalue problem on one dimensional interval (0,1),
[TABLE]
The general solution of this ODE is given by utilizing hypergeometric function,
[TABLE]
Here, is the [math]-th order Bessel function of the first kind and are hypergeometric functions. By further applying the two boundary conditions, one can obtain the following equation with .
[TABLE]
The above equation has infinite solutions and simple computation tells that the smallest one, denoted by , is given by
[TABLE]
Thus, converges to when tends to .
5.3 Lower bound of constants
To confirm the precision of obtained estimation for and , we also calculate the lower bounds of constants. The task to provide lower bound is easy compared with the upper bound estimation. By evaluating and for a concrete element with conforming spaces, then we can have the lower bound for optimal constants.
Given a triangle , the conforming finite dimensional space over can be constructed by using polynomials.
[TABLE]
Here, denotes the space of polynomial over with degree up to .
For , we choose as the unit regular triangle and solve Problem a) in . Numerical computation tells that
[TABLE]
Similarly, for , by taking the triangle with and solving Problem b) in , we have
[TABLE]
6 Application to eigenvalue problems of Biharmonic operators
Let us apply the two fundamental constants and to estimate the error constants appearing in the Lagrange interpolation and the Fujino–Morley interpolation.
The Lagrange interpolation error constants
Given triangle element with vertices and . Let be the Lagrange interpolation over such that, for , is a linear polynomial and , .
Define subspace of by
[TABLE]
Define constants by
[TABLE]
[TABLE]
Thus, the interpolation error estimation of can be given as
[TABLE]
The constants are determined by solving the following eigenvalue problems:
Problem c) Find and such that
[TABLE]
Problem d) Find and such that
[TABLE]
Denote the smallest eigenvalue of each problem by and , respectively. Then and . Choose the subspace of Fujino–Morley finite element space defined over triangulation of ,
[TABLE]
Let and be the smallest eigenvalues of Problem c) and d), respectively, with replaced by .
Let us take the following setting for Theorem 2.1 of Liu2015AMC , which is similar to Theorem 3.1,
[TABLE]
With the newly obtained error constant estimation in §5, we obtain the lower bounds of and like (16).
[TABLE]
The Fujino–Morley interpolation error constants
For the Fujino–Morley interpolation , let us define the following constants
[TABLE]
[TABLE]
Notice that the minimizer function for and are both orthogonal to all polynomial functions with respect to . To see this, one can take the perturbation of the minimizer function with respect to any function in .
Let us introduce the space by
[TABLE]
Then and can be characterized by Rayleigh quotients over ,
[TABLE]
Notice that and are both positive definite bilinear forms on . Thus, we can apply Theorem 2.1 of Liu2015AMC to solve corresponding eigenvalue problems.
Concrete values of interpolation error constants
In Table 1 and 2, we list the estimation of upper bounds of and for different shapes of triangle . The underline in tables tells that the lower bound and upper bound evaluation of the constants agree with each other at the underlined digits.
Remark 7
The estimation of constants considered in this paper only concerns the largest edge length of a triangle element. By utilizing more geometric information of the element, i.e., the inner angle size and each edge length, one can have better upper bounds of interpolation constants over domain of different shapes; see the work of Liu-Kikuchi Kikuchi+Liu2007 ; LIU-Kikuchi and Kobayashi Kobayashi-2015-CM .
7 Summary
In this paper, we provide optimal estimation of two important error constants in bounding eigenvalues of bi-harmonic operators. As application of obtained estimation of the constants, the upper bounds for error constants of two interpolation operators are evaluated. Moreover, the algorithm proposed here along with the explicit constant values can be further used to give rigorous bounds for the eigenvalues of general bi-harmonic differential operators.
Acknowledgements.
The authors would like to thank for the support from the Ministry of Science and Technology, Taiwan, R.O.C. under Grant no. MOST 107-2911-M-006-506. This research is also supported by Japan Society for the Promotion of Science, Grand-in-Aid for Young Scientist (B) 26800090, Grant-in-Aid for Scientific Research (C) 18K03411 and Grant-in-Aid for Scientific Research (B) 16H03950 for the third author.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) Babuska, I., Osborn, J.: Eigenvalue problems. Handbook of Numerical Analysis 3 (1), 641–787 (1991)
- 2(2) Behnke, H.: The calculation of guaranteed bounds for eigenvalues using complementary variational principles. Computing 47 (1), 11–27 (1991)
- 3(3) Carstensen, C., Gallistl, D.: Guaranteed lower eigenvalue bounds for the biharmonic equation. Numer. Math. 126 (1), 33–51 (2014)
- 4(4) Carstensen, C., Gedicke, J.: Guaranteed lower bounds for eigenvalues. Mathematics of Computation 83 (290), 2605–2629 (2014)
- 5(5) Fujino, T.: The Triangular Equilibrium Element in the Solution of Plate Bending Problems. In: R.H. Gallagher, Y. Yamada, J. Tinsley Oden (eds.) Recent Adv. matrix methods Struct. Anal. Des., pp. 725–786. The University of Alabama Press (1971)
- 6(6) Kikuchi, F., Liu, X.: Estimation of interpolation error constants for the P 0 subscript 𝑃 0 P_{0} and P 1 subscript 𝑃 1 P_{1} triangular finite element. Comput. Methods Appl. Mech. Eng. 196 , 3750–3758 (2007)
- 7(7) Kobayashi, K.: On the interpolation constants over triangular elements. Institue of Mathematics, Czech Academy of Sciences (2015)
- 8(8) Liu, X.: A framework of verified eigenvalue bounds for self-adjoint differential operators. Appl. Math. Comput. 267 , 341–355 (2015)
