The superconvergence in the finite element method is a phenomenon in which the finite element approximation converges to the exact solution at a rate higher than the optimal order error estimate. Wang proposed and analyzed superconvergence of the conforming finite element method by L 2-projections. The goal of this paper is to perform numerical experiments using MATLAB to support and to verify the theoretical results in Wang for the superconvergence of the conforming finite element method (CFEM) for the second order elliptic problems by L 2-projection methods. MATLAB codes are published at https://github.com/annaleeharris/Superconvergence-CFEM for anyone to use and to study.

Conforming Finite Element Methods Superconvergence <em>L<sup>2</sup></em>-Projection Second Order Elliptic Equationm MATLAB
1. Introduction

Finite element method (FEM) is based on the premise that an approximation to any complex engineering problem can be reached by subdividing the problem into smaller and more manageable elements. Using FEMs partial differential equations that describe the behavior of structures can be reduced to a set of linear equations that can easily be solved using the standard techniques of matrix algebra. FEM is used in virtually every engineering discipline. The aerospace, automotive, biomedical, chemicals, electronics, energy, geotechnical, manufacturing, and plastics industries routinely apply finite element analysis. In addition, it is used not only for analyzing classical static structural problems, but also for such diverse areas as mass transport, heat transfer, dynamics, stability, and radiation problems.

The main objective of the superconvergence using various FEMs is to improve the accuracy of the existing approximation solution by applying certain post-processing techniques that are easy to implement. To obtain the superconvergence of FEMs, several methods have been proposed in the literature in the last thirty years. The method of local averaging has been a popular and useful technique in the study of superconvergence  -  . The underlying assumption of the existing superconvergence technique is that the finite element mesh has some special properties such as uniformity  , local point-symmetry   , local translation-invariance   , or orthogonality     .

Zienkiewicz and Zhu   introduced the patch recovery technique which provides some superconvergence for the gradient of the finite element solution by using a discrete least-squares fitting on a local patch with high order polynomials. The method of Zienkiewicz and Zhu has been computationally proved to be robust and efficient and to produce some superconvergence for the gradient of the finite element solution.

Wang proposed and analyzed superconvergence of the conforming finite element method (CFEM) by L2-projections. The main idea behind the L2-projections is to project the finite element solution to another finite element space with a coarse mesh and a higher order of polynomials.

The objective of this paper is to investigate the theoretical results in  for the conforming finite element approximations for second-order elliptic problems by L2-projection methods and to support the theoretical results with numerical experiments using MATLAB.

This paper is organized as follows. In Section 2, we present a review for the conforming finite element method for the second-order elliptic problem. In Section 3, we investigate the theoretical results in  , the superconvergence of CFEM for the second-order elliptic problem by L2-projection methods. In section 4, we perform numerical experiments to support the theoretical results in  . Numerical experiments of superconvergence of CFEM are performed in MATLAB and its codes are posted at https://github.com/annaleeharris/Superconvergence-CFEM for anyone to use and to study.

2. CFEM for the Second-Order Elliptic Problem

Consider the second-order elliptic problem with the homogeneous Dirichlet boundary condition which seeks u ∈ H 1 ( Ω ) satisfying

Δ u = f   in   Ω , u = 0   on   ∂ Ω , (1)

where Δ is the Laplacian operator, Ω is a bounded, connected, and open subset of R2, ∂ Ω is a Lipschitz continuous boundary, and a given function f is the external force.

A variational formulation of (1) seeks u ∈ H 0 1 ( Ω ) such that

a ( u , v ) = ( f , v ) ,   ∀ v ∈ H 0 1 ( Ω ) , (2)

where

a ( u , v ) = ( ∇ u , ∇ v ) = ∫ Ω ∇ u ⋅ ∇ v d Ω

Let T h be a quasi-uniform, i.e., it is regular and satisfies the inverse assumption  , triangulation of Ω with d i a m ( K ) ≤ h ,   K ∈ T h and let P r ( K ) be the space of polynomials of degree at most r with r ≥ 0 on K. Assume that the polynomial space in the construction of V h contains P k ( K ) ,   k ≥ 1 . Define the finite element space V h associated with T h as

V h = { v ∈ H 0 1 ( Ω ) : v | K ∈ P k ( K ) , ∀   K ∈ T h } .

The finite element space V h is assumed to satisfy the following approximation property for any u ∈ H m + 1 ( Ω ) :

i n f v ∈ V h ( ‖ u − v ‖ + h ‖ u − v ‖ 1 ) ≤ C h m + 1 ‖ u ‖ m + 1 ,   0 ≤ m ≤ k . (3)

The finite element approximation problem (2) seeks u h ∈ V h such that

a ( u h , v ) = ( f , v ) ,   ∀   v ∈ V h , (4)

where

a ( u h , v ) = ( ∇ u h , ∇ v ) = ∫ Ω ∇ u h ⋅ ∇ v d x .

A well known error estimate for the finite element approximation solution u h is the following:

| u − u h | 1 ≤ C i n f v ∈ V h ‖ u − v ‖ 1 , (5)

where C is a constant independent of the mesh size h.

Then from (3) and (5) we arrive at the following error estimate:

| u − u h | 1 ≤ C h k ‖ u ‖ k + 1 .

To apply the superconvergence of finite element approximation, we assume that domain Ω is so regular that it ensures a H s ,   s ≥ 1 , regularity for the solution of (2). In other words, for any f ∈ H s − 2 ( Ω ) the problem (2) has a unique solution u ∈ H 0 1 ( Ω ) satisfying the following a priori estimate:

‖ u ‖ s ≤ C ‖ f ‖ s − 2 ,   ∀   f ∈ H s − 2 ( Ω ) ,   s ≥ 1. (6)

where C is a constant independent of data g.

3. Superconvergence of CFEM

Let T τ be another finite element partition with coarse mesh size τ where h ≪ τ . Assume that τ and h have the following relation:

τ = h α ,       α ∈ ( 0 , 1 ) .

Let V τ be any finite element space consisting of piecewise polynomial of degree r associated with the partition T τ . Define Q τ to be the L2-projection from L 2 ( Ω ) onto the finite element space V τ . The finite element space V τ is defined by

V τ = { v ∈ L 2 ( Ω ) : v | K ∈ P r ( K ) , ∀   K ∈ T τ } .

For the superconvergence of CFEM, the following theoretical results can be found in  .

Lemma 1 Assume that the second-order elliptic problems (2) holds (6) with 1 ≤ s ≤ k + 1 and V τ ⊂ H s − 2 ( Ω ) . Then there exists a constant C independent of h and τ such that

‖ Q τ u − Q τ u h ‖ ≤ C h σ ‖ u − u h ‖ 1 , (7)

where σ = s − 1 + α min ( 0 , 2 − s ) ,   α ∈ ( 0 , 1 ) and τ ≫ h .

Theorem 1 Assume that (6) holds true with 1 ≤ s ≤ k + 1 and V τ ⊂ H s − 2 ( Ω ) . If u h = u h ( x , y ) is the finite element approximation of the exact solution u = u ( x , y ) of (2), then there exists a constant C independent of h and τ such that

‖ u − Q τ u h ‖ ≤ C h α ( r + 1 ) ‖ u ‖ r + 1 + C h k + σ ‖ u ‖ k + 1 , (8)

where σ = s − 1 + α min ( 0 , 2 − s ) .

Theorem 2 Assume that (6) holds true with 1 ≤ s ≤ k + 1 and V τ ⊂ H s − 2 ( Ω ) . If u h is the finite element approximation of the exact solution u ∈ H k + 1 ( Ω ) ∩ H r + 1 ( Ω ) ∩ H 0 1 ( Ω ) of (2), then there exists a constant C independent of h and τ such that

‖ ∇ ( u − Q τ u h ) ‖ ≤ C h α r ‖ u ‖ r + 1 + C h k + σ − α ‖ u ‖ k + 1 , (9)

where σ = s − 1 + α min ( 0 , 2 − s ) .

From (8) and (9) α is selected to optimize the error estimates:

α = k + s − 1 r + 1 − min ( 0 , 2 − s ) . (10)

4. Numerical Experiments of Superconvergence of CFEM by L<sup>2</sup>-Projection Methods

In this section, we confirm the theoretical results in  with numerical experiments for second-order elliptic problems. Assume that the exact solution of the second-order elliptic problem has H s regularity for some 1 ≤ s ≤ 2 and for simplicity, assume k = 1 , s = 2 , and r = 2 which gives α = 2 3 using the α Formula (10).

Then according to the theoretical results in  , the best possible error estimates using the results (8) and (9) are given by

‖ u − Q τ u h ‖ ≤ C h α ( r + 1 ) ‖ u ‖ r + 1 + C h k + s − 1 + α m i n ( 0,2 − s ) ‖ u ‖ k + 1 ≤ C h 2 ‖ u ‖ 3 (11)

and

‖ ∇ ( u − Q τ u h ) ‖ ≤ C h α r ‖ u ‖ r + 1 + C h k + s − 1 − α + α m i n ( 0,2 − s ) ‖ u ‖ k + 1 ≤ C h 4 3 ‖ u ‖ 3 . (12)

From the result (11), we do not see any superconvergence in L2 norm. However, from the result (12), we have some superconvergence for the gradient error estimate.

The finite element partition T h is constructed by dividing the domain into an n 3 × n 3 rectangular mesh then dividing the rectangular mesh with the positive slope to form two triangles. The coarse finite element partition T τ is also constructed by dividing the domain into an n 2 × n 2 rectangular mesh then dividing the rectangular mesh with the positive slope to form two triangles. The finite element space V h consists of the space of the linear polynomials P 1 ( K ) associated with the partition T h and the dual finite element space V τ consists of the space of the quadratic polynomials P 2 ( K ) associated with the partition T τ . The finite element spaces V h and V τ are defined by

V h = { v ∈ H 0 1 ( Ω ) : v | K ∈ P 1 ( K ) , ∀   K ∈ T h }

and

V τ = { v ∈ L 2 ( Ω ) : v | K ∈ P 2 ( K ) , ∀   K ∈ T τ } .

The numerical approximation is refined as h = n − 3 , where n = 2 , 3 , ⋯ , 6 . Thus, the length of τ = n ⋅ h ,   n = 2 , ⋯ , 6 and each τ element contains n 2 h elements. Using the difference in mesh size and a higher degree of polynomials we shall produce some superconvergence of CFEM for the second-order elliptic problems.

Example 1 Let the domain Ω = [ 0 , 1 ] × [ 0 , 1 ] and the exact solution is assumed to be

u = y cos ( 0.5 π y ) sin ( π x ) .

From Table 1, we observe that applying L2-projections to the existing numerical solution reduced the errors in L2 norm and in H1 norm. Surface plots of numerical solutions, u h in fine meshes and Q τ u h in coarse meshes, are shown in Figure 1. In L2 norm the error convergence rate of ‖ u − Q τ u h ‖ and the error convergence rate of ‖ u − u h ‖ are similar to the theoretical convergence rate, which is shown as O ( h 2 ) (see Figure 2). However, in H1 norm the error convergence rate of | u − Q τ u h | 1 is higher than the optimal error convergence rate of | u − u h | 1 and the error convergence rate of the numerical example, O ( h 1.42 ) ,

Numerical error approximation results using CFEM in Example 1, u = y c o s ( 0.5 π y ) s i n ( π x )
iterh‖ ∇ ( u − u h ) ‖‖ u − u h ‖‖ ∇ τ ( u − Q τ u h ) ‖‖ u − Q τ u h ‖
12−30.1196e−00.7787e−20.5207e−10.7456e−2
2330.3555e−10.6966e−30.8137e−20.6649e−3
3430.0150e−10.1241e−30.2481e−20.1184e−3
4530.7680e−20.3255e−40.1014e−20.3108e−4
5630.4445e−20.1090e−40.4906e−30.1040e−4
O ( h r )0.99901.99411.41171.9953

exceeds its theoretical error convergence rate, which is shown as O ( h 1.33 ) . As we expect from the theoretical results (11) and (12), the numerical example shows some superconvergence in H1 norm but not in L2 norm. The numerical Example 1 supports the theoretical results in  and confirms the superconvergence of CFEM for second-order elliptic problems.

Example 2 Let the domain Ω = [ 0 , 1 ] × [ 0 , 1 ] and the analytical solution to the problem is given as

u = x ( 1 − x ) y ( y − 1 ) .

From Table 2, we confirm that the numerical Example 2 supports the theoretical results in  . In L2 norm the error convergence rate of ‖ u − Q τ u h ‖ is similar to the error convergence rate of ‖ u − u h ‖ which is about the same as the theoretical result in (11), which is shown as O ( h 2 ) in Figure 3. The error convergence rate of | u − Q τ u h | 1 is about O ( h 1.42 ) and the error convergence rate of | u − u h | 1 is about O ( h ) . In H1 norm the exact solution u clearly has some superconvergence. Figure 4 shows the surface plot of Q τ u h in coarse meshes and the surface plot of u h in fine meshes. The numerical Example 2

Numerical error approximation results using CFEM in Example 2, u = x ( 1 − x ) y c o s ( 1.5 π y )
iterh‖ ∇ ( u − u h ) ‖‖ u − u h ‖‖ ∇ τ ( u − Q τ u h ) ‖‖ u − Q τ u h ‖
1230.2227e−10.1441e−20.9193e−20.1378e−2
2330.6632e−20.1287e−30.1427e−20.1227e−3
3430.2799e−20.2295e−40.4332e−30.2185e−4
4530.1433e−20.6017e−50.1763e−30.5732e−4
5630.8294e−30.2015e−50.8504e−40.1919e−5
O ( h r )0.99851.99451.41731.9958

also supports the theoretical results in  and confirms the superconvergence of CFEM for second-order elliptic problems.

Example 3 Let the domain Ω = [ 0 , 1 ] × [ 0 , 1 ] and the analytical solution to the problem is given as

u = y ( 1 − y ) ( 1 − x ) sin ( 2 π x ) .

From Table 3, the numerical approximation results show that after the post-processing all the errors are reduced. The exact solution in L2 norm of ‖ u − Q τ u h ‖ has the similar error convergence rate as ‖ u − u h ‖ , which shown as O ( h 2 ) . In L2 norm, there is no improvement with the post-processing technique. See Figure 5, in H1 norm L2-projection method improved the convergence rate, which is shown as O ( h 1.3 ) for ‖ ∇ τ ( u − Q τ u h ) ‖ . Figure 6 shows surface plots of Q τ u h and u h . The numerical Example 3 confirms the theoretical results in  .

Example 4 Let the domain Ω = [ 0 , 1 ] × [ 0 , 1 ] and the exact solution is assumed to be

u = x sin ( 2 π x ) y cos ( 1.5 π y ) .

From Table 4, we confirm that the numerical Example 4 supports the theoretical results in  . In L2 norm the error convergence rate of ‖ u − Q τ u h ‖ is similar to the error convergence rate of ‖ u − u h ‖ which is about the same as the theoretical result, O ( h 2 ) . However, in H1 norm the exact solution u has some

superconvergence. The error convergence rate of | u − Q τ u h | 1 is about 34% faster than the error convergence rate of | u − u h | 1 and meets the theoretical minimum error convergence rate, O ( h 1.33 ) . See Figure 7, in L2 norm there is no difference in error convergence rates but in H1 norm applying L2-projection methods to the existing numerical approximations improved the errors and produced some superconvergence. Figure 8 shows surface plots of the numerical approximations of (2) before and after the post-processing.

Numerical error approximation results using CFEM in Example 3, u = y ( 1 − y ) ( 1 − x ) sin ( 2 π x )
iterh‖ ∇ ( u − u h ) ‖‖ u − u h ‖‖ ∇ τ ( u − Q τ u h ) ‖‖ u − Q τ u h ‖
1230.1162e−00.7440e−20.8059e−10.7070e−2
2330.3444e−10.6787e−30.1389e−10.6415e−3
3430.1452e−10.1211e−30.4342e−20.1144e−3
4530.7439e−20.3178e−40.1787e−20.3000e−4
5630.4305e−20.1064e−40.8670e−30.1005e−4
O ( h r )0.99991.98801.37261.9899
Numerical error approximation results using CFEM in Example 4, u = x s i n ( 2 π x ) y c o s ( 1.5 π y )
iterh‖ ∇ ( u − u h ) ‖‖ u − u h ‖‖ ∇ τ ( u − Q τ u h ) ‖‖ u − Q τ u h ‖
1230.3537e−00.2256e−10.2900e−00.2165e−1
2330.1069e−00.2138e−20.5074e−10.2042e−2
3430.4480e−10.3828e−30.1585e−10.3654e−3
4530.2294e−10.1004e−30.6526e−20.9585e−4
5630.1327e−10.3365e−40.3165e−20.3210e−4
O ( h r )0.99621.97621.36861.9779

With numerical experiments we support the theoretical results in  and confirm the superconvergence of CFEM for second-order elliptic problems.

5. Conclusion

The L2-projection to the existing numerical approximation u h produced some superconvergence in H1 norm, convergence rate ≥ 1.3 , but did not affect the convergence rate in L2 norm. With the numerical experiments we can conclusively support the theoretical result and confirm the superconvergence of CFEM for second-order elliptic problems by L2-projection method.

Acknowledgements

We thank the Editor and the peer-reviewers for their comments. Research of Anna Harris is funded by the National Science Foundation Historical Black Colleges and Universities Undergraduate Program Research Initiative Award grant (#1505119). This support is greatly appreciated.

Cite this paper

Harris, A., Harris, S., Gardner, C. and Brock, T. (2018) Numerical Experiments Using MATLAB: Superconvergence of Conforming Finite, Element Approximation for Second Order, Elliptic Problems. Applied Mathematics, 9, 691-701. https://doi.org/10.4236/am.2018.96047

ReferencesBramble, J.H. and Schatz, A.H. (1977) Higher Order Local Accuracy by Averaging in the Finite Element Method. Mathematics of Computation, 31, 94-111. https://doi.org/10.1090/S0025-5718-1977-0431744-9Douglas Jr., J. and Wang, J. (1989) A Superconvergence for Mixed Finite Element Methods on Rectangular Domains. Calcolo, 26, 121-134. https://doi.org/10.1007/BF02575724Ewing, R.E., Lazarov, R. and Wang, J. (1991) Superconvergence of the Velocity along the Gauss Lines in Mixed Finite Element Methods. SIAM Journal on Numerical Analysis, 28, 1015-1029. https://doi.org/10.1137/0728054Krizek, M. and Neittaanmaki, P. (1984) Superconvergence Phenomenon in the Finite Element Method Arising from Averaging Gradient. Numerische Mathematik, 45, 105-116. https://doi.org/10.1007/BF01379664Lazarov, R., Andreev, A.B. and Hatri, M. (1984) Superconvergence of the Gradients in the Finite Element Method for Some Elliptic and Parabolic Problems. In: Variational-Difference Methods in Mathematical Physics, Part II, Moscow, 13-25.Lin Q. ,et al. (1992)Global Error Expansion and Superconvergence for Higher Order Interpolation of Finite Element Journal of Computational Mathematics 10, 286-289.Oganesyan, I.A. and Rukhovetz, L.A. (1969) Study of the Rate of Convergence of Variational Difference Scheme for Second-Order Elliptic Equations in Two-Dimensional Field with a Smooth Boundary. USSR Computational Mathematics and Mathematical Physics, 9, 158-183. https://doi.org/10.1016/0041-5553(69)90159-1Wahlbin, L.B. (1995) Superconvergence in Galerkin Finite Element Methods. Springer, New York. https://doi.org/10.1007/BFb0096835Zlamal, M. (1978) Superconvergence and Reduced Integration in the Finite Element Method. Mathematics of Computation, 32, 663-685. https://doi.org/10.2307/2006479Schatz, A.H., Sloan, I.H. and Wahlbin, L.B. (1996) Superconvergence in Finite Element Methods and Meshes That Are Symmetric with Respect to a Point. SIAM Journal on Numerical Analysis, 33, 505-521. https://doi.org/10.1137/0733027Douglas, J., Dupont, T. and Wheeler, M.F. (1974) An Estimate and a Superconvergence Result for a Galerkin Method for Elliptic Equations Based on Tensor Products of Piecewise Polynomials. RAIRO: Analyse Numérique, 8, 61-66.Douglas, J. and Dupont, T. (1973) Some Superconvergence Results for Galerkin Methods for the Approximation Solution of Two-Point Boundary Value Problems. Topics in Numerical Analysis, 89-92.Wang, J. (1991) Superconvergence and Extrapolation for Mixed Finite Element Methods on Rectangular Domains. Mathematics of Computation, 56, 477-503. https://doi.org/10.1090/S0025-5718-1991-1068807-0Zienkiewicz, O.C. and Zhu, J.Z. (1992) The Superconvergent Patch Recovery and a Posteriori Error Estimates. Parts 1: The Recovery Technique. International Journal for Numerical Methods in Engineering, 33, 1331-1364. https://doi.org/10.1002/nme.1620330702Zienkiewicz, O.C. and Zhu, J.Z. (1992) The Superconvergent Patch Recovery and a Posteriori Error Estimates. Parts 2: Error Estimates and Adaptivity. International Journal for Numerical Methods in Engineering, 33, 1365-1382. https://doi.org/10.1002/nme.1620330703Wang J. ,et al. (2000)A Superconvergence Analysis for Finite Element Solutions by the Least-Square Surface Fitting on Irregular Meshes for Smooth Problems Journal of Mathematical Study 33, 229-243.Ciarlet, P.G. (1978) The Finite Element Method for Elliptic Problems. Elsevier, New York.