New error estimates of linear triangle finite elements for the Steklov eigenvalue problem
Hai Bi, Yidu Yang, Yuanyuan Yu

TL;DR
This paper develops new, optimal error estimates for linear finite element methods applied to the Steklov eigenvalue problem on concave polygons, improving existing theoretical results with supporting numerical experiments.
Contribution
It introduces a novel proof approach leveraging regularity estimates and edge average interpolation, providing sharper error bounds for both conforming and nonconforming finite elements.
Findings
Optimal error estimates in boundary norm for eigenfunctions
Improved theoretical bounds over previous results
Numerical experiments confirm theoretical predictions
Abstract
In this paper we make a further discussion on the finite elements approximation for the Steklov eigenvalue problem on concave polygonal domain. We make full use of the regularity estimate and the characteristic of edge average interpolation operator of nonconforming Crouzeix-Raviart element, which is different from the existing proof argument, and prove a new and optimal error estimate in for the eigenfunction of linear conforming finite element and the nonconforming Crouzeix-Raviart element, which is an improvement of the current results. Finally, we present some numerical experiments to support the theoretical analysis.
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
NEW ERROR ESTIMATES OF LINEAR TRIANGLE FINITE ELEMENTS FOR THE STEKLOV EIGENVALUE PROBLEM
Hai Bi, Yidu Yang, Yuanyuan Yu
School of Mathematical Sciences, Guizhou Normal University,
Guiyang, , China
[email protected], [email protected], [email protected]
Abstract
In this paper we make a further discussion on the finite elements approximation for the Steklov eigenvalue problem on concave polygonal domain. We make full use of the regularity estimate and the characteristic of edge average interpolation operator of nonconforming Crouzeix-Raviart element, which is different from the existing proof argument, and prove a new and optimal error estimate in for the eigenfunction of linear conforming finite element and the nonconforming Crouzeix-Raviart element, which is an improvement of the current results. Finally, we present some numerical experiments to support the theoretical analysis.
Key words. Steklov eigenvalue problem, Concave polygonal domain, Linear conforming finite element, Nonconforming Crouzeix-Raviart element, Error estimates.
1 Introduction
Steklov eigenvalue problems have important physical background and many applications. For instance, they appear in the analysis of stability of mechanical oscillators immersed in a viscous fluid (see [12] and the references therein), in the study of surface waves (see [7]), in the study of the vibration modes of a structure in contact with an incompressible fluid (see [6]), in the analysis of the antiplane shearing on a system of collinear faults under slip-dependent friction law (see [10]), etc. Thus the numerical methods for solving these problems have attracted more and more scholars’ attention. Till now, systematical and profound studies on the conforming finite elements approximation for Steklov eigenvalue problems have been made on polygonal domain such as [2, 3, 4, 6, 9, 15, 16, 20, 21]). Recently, the nonconforming finite elements for Steklov problems have also been considered, e.g., see [1, 8, 17, 18, 22]. The aim of this paper is to discuss the error estimates of linear triangle finite elements, including the linear conforming finite element and the nonconforming Crouzeix-Raviart element, approximation for Steklov eigenvalue problems with variable coefficients on concave polygonal domain.
We consider the following Steklov eigenvalue problem
[TABLE]
where is a polygonal domain with being the largest inner angle of , and is the outward normal derivative.
Having in mind that denotes the Sobolev space with real order on , is the norm on and , and denotes the Sobolev space with real order on with the norm .
Suppose that the coefficients and are bounded by above and below by positive constants. We assume that .
The weak form of (1.1) is given by: Find , , such that
[TABLE]
where
[TABLE]
It is easy to know that is a symmetric, continuous and -elliptic bilinear form on .
In the existing literatures, the error estimate of linear triangle elements eigenfunction, including conforming element and nonconforming Crouzeix-Raviart element (hereafter termed C-R element for simplicity), in is all where is the regularity exponent of the eigenfunction (see Lemma 2.1). It is obvious that this estimate is not optimal since it doesn’t achieve the order of interpolation error. In this paper, we improve this estimate when eigenfunctions are singular (i.e., ) and prove that in this case the error estimate of linear triangle elements eigenfunction can achieve . Comparing the proof arguments of existing estimates (e.g., see [3, 9, 17, 22]), we make full use of the regularity estimate and the characteristic of edge average interpolation operator of C-R element, especially in the analysis for conforming finite elements, and obtain the improved error estimates (2.25) and (3.6) which are optimal.
Throughout this paper, denotes a positive constant independent of , which may not be the same constant in different places.
2 The nonconforming Crouzeix-Raviart element approximation for the Steklov eigenvalue problem
Consider the source problem (2.1) associated with (1.1): Find , such that
[TABLE]
As for the source problem (2.1), there hold the following regularity results.
Lemma 2.1**.**
If , then and
[TABLE]
if , then and
[TABLE]
if , , then and
[TABLE]
Here when , and which can be arbitrarily close to when , and is a priori constant.
Proof. See [14].
Note that is coercive, using the source problem (2.1) associated with (1.2) we can define the operator , satisfying
[TABLE]
Define the operator satisfying
[TABLE]
where ′ denotes the restriction to .
Bramble and Osborn [9] proved that (1.2) has the operator form:
[TABLE]
Namely, if is an eigenpair of (2.5), then is an eigenpair of (1.2), . Conversely, if is an eigenpair of (1.2), then is an eigenpair of (2.5), .
Let be the -th eigenvalue of . We arrange eigenvalues by the increasing order with each eigenvalue counted according to its algebraic multiplicity. And let denote the space spanned by eigenfunctions of (1.2) corresponding to the eigenvalue .
Let be a regular triangulation of in the sense of the minimal internal angle condition (see [11], pp. 131). We denote where is the diameter of element . Let be the C-R element space (see [13]) defined on :
, is continuous at the midpoints of the edges of elements.
The C-R element approximation of (1.2) is: Find , , such that
[TABLE]
where
[TABLE]
Define , . Evidently, is the norm on and it is simple to show that is uniformly -elliptic.
The C-R element approximation of (2.1) is: Find , such that
[TABLE]
Denote the consistency term of the C-R element by
[TABLE]
And based on the standard method (see, for example [1, 8, 17]), the following consistency error estimate can be proved.
Lemma 2.2**.**
Suppose that with is the weak solution of (2.1), then
[TABLE]
Proof. See, e.g., Lemma 2.2 in [8], or Theorem 2.1 in [17].
Define the interpolation operator :
[TABLE]
where is an edge of arbitrary element in .
According to the interpolation theory (see [11]), we have
[TABLE]
Theorem 2.3**.**
Let with be the weak solution of (2.1), then
[TABLE]
where if , , and if .
Proof. For each , let be the unique solution of the following variational problem:
[TABLE]
From (2.4) we know that . Let be the interpolation of , then
[TABLE]
By the definition of consistency term we have
[TABLE]
Combining the above two relationships, we get
[TABLE]
then
[TABLE]
From (2.9), (2.3), (2.4), (2.10) and the error estimate of interpolation, we can deduce that
[TABLE]
And substituting the above three estimates into (2), we obtain
[TABLE]
By the definition of negative norm, we have
[TABLE]
namely, (2.15) is true.
Let us denote by the functions defined on , which are restriction of functions in to . From [1], pp.189 we know that
[TABLE]
Since is uniformly elliptic with respect to , the approximate source problem (2.7) associated with (2.6) is uniquely solvable. Thus, we can define the operator , satisfying
[TABLE]
Define , satisfying
[TABLE]
[22] proved that (2.6) has the operator form:
[TABLE]
Namely, if is an eigenpair of (2.19), then is an eigenpair of (2.6), . Conversely, if is an eigenpair of (2.6), then is an eigenpair of (2.19), .
We prove the following interpolation estimates.
Lemma 2.4**.**
Let , then the following estimates hold:
[TABLE]
Proof. Let be the edge of the element , then by the trace inequality ( see Lemma 7.1.1 in [19]) we have
[TABLE]
thus (2.20) is valid.
For any , let be the piecewise constant interpolation of on . From the definition of and the interpolation estimates we have
[TABLE]
and using the definition of negative norm we know that (2.21) holds.
Lemma 2.5**.**
Suppose that and be the -th eigenvalue of (1.2). Let be the -th eigenvalue of (2.6) and be an eigenfunction corresponding to with . Then there exists with , such that
[TABLE]
Lemma 2.5 is an existing conclusion. Next we will improve the estimate (2.24).
Theorem 2.6**.**
Under the conditions of Lemma 2.5, further assume that is a quasi-uniform mesh (see pp.135 in [11]), then
[TABLE]
Proof. Since and are solutions of (2.1) and (2.7) with , respectively, then from (2.15) we know that
[TABLE]
Using (2.21) we obtain
[TABLE]
From (2.26) and (2.27), we have
[TABLE]
By the definition of negative norm and the inverse estimates, we have
[TABLE]
thus
[TABLE]
By using (2.29) and (2.20), we get
[TABLE]
It has been proved in [17, 8] that , thus, from Theorem 7.4 in [5] we get
[TABLE]
Substituting (2.30) into (2.31), we obtain (2.25).
Remark 2.1. If , i.e., is concave, it is clear that the estimate (2.25) is better than (2.24).
3 The conforming element approximation for the Steklov eigenvalue problem
Let be a space of piecewise linear polynomials defined on . The conforming element approximation of (1.2) is: Find , with , such that
[TABLE]
As for the conforming finite element approximation (3.1), the following results are valid (see [3, 9]).
Lemma 3.1**.**
Let be the -th eigenpair of (3.1), be the -th eigenvalue of (1.2), and . Then there exists such that
[TABLE]
where the principle to determine see Lemma 2.1.
Now, let be the Ritz projection defined by
[TABLE]
We can define the operator , satisfying
[TABLE]
It is easy to know that .
Let be the space of functions defined on , which are restriction of functions in to . Define , satisfying
[TABLE]
It has been proved in [5, 9] that , and (3.1) has the operator form:
[TABLE]
Next we will give a new error estimate for the conforming finite element.
Theorem 3.2**.**
Under the conditions of Lemma 3.1, further assume that is quasi-uniform mesh, then
[TABLE]
Proof. For each , let be the unique solution of the following variational problem:
[TABLE]
From (2.4) we know that , and
[TABLE]
thus, by the definition of negative norm, we have
[TABLE]
Let be the interpolation of defined by (2.12). By using the inverse estimates, (3.7), (2.21) and (2.20), we get
[TABLE]
By using the spectral approximation theory, we get
[TABLE]
Substituting (3) into (3.9), we obtain (3.6).
Remark 3.1. Comparing (3.4) and (3.6), we can see that when eigenfunctions are singular, i.e., , the error estimate in is improved.
When we prove the improved estimates (2.25) and (3.6), we make full use of the regularity estimate (2.4) to analyze the negative norm estimate, then use the negative norm estimate and the interpolation of C-R element, especially in the analysis for conforming elements, to obtain the optimal estimates in ; while the existing work is to analyze directly the error in by using (2.2) which leads to the lost of error order.
Remark 3.2. We prove the estimates (2.25) and (3.6) under the condition that is quasi-uniform. In fact, this condition is not a restriction. Since when is a regular partition derived from by local refinement, the approximate eigenfunction computed on generally satisfies , then, for such regular meshes (2.25) and (3.6) are still valid.
4 Numerical Experiments
Consider the problem (1.1), where , , is a L-shaped domain with the largest inner angle , or is the unit square with a slit which the largest inner angle .
We adopt a uniform isosceles right triangulation . We use the formula and to compute the convergence order of approximations of linear conforming element to validate our analysis.
By calculation we find that the eigenfunction associated with is singular. So in our numerical experiments we compute the approximation of the second eigenvalue and the corresponding eigenfunction . Since the exact eigenpairs of the problem (1.1) are unknown, we use the adaptive method to compute a high-precision approximation for the L-shaped domain and for the unit square with a slit, and use them as the exact values, and the corresponding eigenfunction is taken as the approximation computed on the uniform mesh with the mesh diameter . The numerical results on the L-shaped domain and the slit domain are listed in Table 1 and Table 2, respectively.
Table 1: The results by using linear conforming element on the L-shaped domain
[TABLE]
Table 2: The results by using linear conforming element on the unit square with a slit
[TABLE]
For the L-shaped domain , . From Table 1 we can see that the convergence order of is approximately equal to . It also can be seen from Table 1 that the convergence order of is very close to , which is coincide with the theoretical result (3.6); while the convergence order of according to the previous conclusion (3.4) should be .
For the unit square with a slit . From Table 2 we can see that the convergence order of is approximately equal to . We can also see from Table 2 that the convergence order of is very close to , which is coincide with the theoretical result (3.6); while the previous conclusion (3.4) states that the convergence order of is .
Acknowledgments. This work was supported by the National Natural Science Foundation of China (Grant Nos. 11201093, 10761003).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Alonso and A. D. Russo, Spectral approximation of variationally-posed eigen-value problems by nonconforming methods, J. Comput. Appl. Math. , 223 (2009), 177-197.
- 2[2] A. B. Andreev and T. D. Todorov, Isoparametric finite element approximation of a Steklov eigenvalue problem, IMA. J. Numer. Anal. , 24 (2004), 309-322.
- 3[3] M. G. Armentano, The effect of reduced integration in the Steklov eigenvalue problem, Math. Mod. and Numer. Anal. ( M 2 A N ) superscript 𝑀 2 𝐴 𝑁 (M^{2}AN) , 38 (2004), 27-36.
- 4[4] M. G. Armentano and C. Padra, A posteriori error estimates for the Steklov eigenvalue problem, Appl. Numer. Math. , 58 (2008), 593-601.
- 5[5] I. Babuska and J. E. Osborn, Eigenvalue Problems, in: P. G. Ciarlet, J. L. Lions(Eds), Finite Element Methods (Part I), in: Handbook of Numerical Analysis, Vol. 2, North-Holand: Elsevier Science Publishers, 1991, pp. 641-787.
- 6[6] A. Bermudez, R. Rodriguez and D. Santamarina, A finite element solution of an added mass formulation for coupled fluid-solid vibrations, Numer. Math. , 87 (2000), 201-227.
- 7[7] S. Bergman, M. Schiffer, Kernel Functions and Elliptic Differential Equations in Mathematical Physics, New York: Academic Press, 1953.
- 8[8] H. Bi and Y. Yang, A two-grid method of the non-conforming Crouzeix-Raviart element for the Steklov eigenvalue problem, Appl. Math. Comput. , 217 (2011), 9669-9678.
