Superconvergence patch recovery for the gradient of the tensor-product linear triangular prism element

Jinghong Liu; Yinsuo Jia

doi:10.1186/1687-2770-2014-1

Research
Open Access
Published: 02 January 2014

Superconvergence patch recovery for the gradient of the tensor-product linear triangular prism element

Jinghong Liu¹ &
Yinsuo Jia²

Boundary Value Problems volume 2014, Article number: 1 (2014) Cite this article

1659 Accesses
22 Citations
Metrics details

Abstract

In this article, we study superconvergence of the finite element approximation to the solution of a general second-order elliptic boundary value problem in three dimensions over a fully uniform mesh of piecewise tensor-product linear triangular prism elements. First, we give the superclose property of the gradient between the finite element solution $u h$ and the interpolant Πu. Second, we introduce a superconvergence recovery scheme for the gradient of the finite element solution. Finally, superconvergence of the recovered gradient is derived.

1 Introduction

Superconvergence of the gradient for the finite element approximation is a phenomenon whereby the convergent order of the derivatives of the finite element solutions exceeds the optimal global rate. Up to now, superconvergence is still an active research topic (see [1–6]). Recently, we studied the superconvergence patch recovery (SPR) technique introduced by Zienkiewicz and Zhu [7–9] for the linear tetrahedral element and proved pointwise superconvergent property of the recovered gradient by SPR. For the linear tetrahedral element, Chen and Wang [10] also discussed superconvergent properties of the gradients by SPR and obtained superconvergence results of the recovered gradients in the average sense of the $L 2$ -norm. In addition, Chen [11] and Goodsell [12] derived superconvergence estimates of the recovered gradient by the $L 2$ -projection technique and the average technique, respectively. This article will use the SPR technique to obtain a superconvergence estimate for the gradient of the tensor-product linear triangular prism element. In this article, we shall use the letter C to denote a generic constant which may not be the same in each occurrence and also use the standard notations for the Sobolev spaces and their norms.

2 General elliptic boundary value problem and finite element discretization

We consider the model problem

L u ≡ − ∑ i, j = 1 3 ∂ j (a i j ∂ i u) + ∑ i = 1 3 a i ∂ i u + a 0 u = f in Ω, u = 0 on ∂ Ω .

(2.1)

Here $Ω = [0, 1] 2 × [0, 1] = Ω x y × Ω z ⊂ R 3$ is a rectangular block with boundary ∂ Ω consisting of faces parallel to the x-, y-, and z-axes. We also assume that the given functions $a i j, a i ∈ W 1, ∞ (Ω)$ , $a 0 ∈ L ∞ (Ω)$ , and $f ∈ L 2 (Ω)$ . In addition, we write $∂ 1 u = ∂ u ∂ x$ , $∂ 2 u = ∂ u ∂ y$ , and $∂ 3 u = ∂ u ∂ z$ , which are usual partial derivatives.

To discretize the problem, one proceeds as follows. The domain Ω is firstly partitioned into subcubes of side h, and each of these is then subdivided into two triangular prisms. We denote by ${T h}$ these uniform partitions as above. Thus $Ω ¯ = ⋃ e ∈ T h e ¯$ . Obviously, we can write $e = D × L$ (see Figure 1), where D and L represent a triangle parallel to the xy-plane and a one-dimensional interval parallel to the z-axes, respectively.

We introduce a tensor-product linear polynomial space denoted by , that is,

q (x, y, z) = ∑ (i, j, k) ∈ I a i j k x i y j z k, a i j k ∈ R, q ∈ P,

where $P = P x y ⊗ P z$ , $P x y$ stands for the linear polynomial space with respect to $(x, y)$ , and $P z$ is the linear polynomial space with respect to z. The indexing set ℐ satisfies $I = {(i, j, k) | i, j, k ≥ 0, i + j ≤ 1, k ≤ 1}$ . Let $Π x y e$ be the linear interpolation operator with respect to $(x, y) ∈ D$ , and let $Π z e$ be the linear interpolation operator with respect to $z ∈ L$ . Thus we may define the tensor-product linear interpolation operator by $Π e : H 01 (e) → P (e)$ . Obviously, $Π e = Π x y e ⊗ Π z e = Π z e ⊗ Π x y e$ . In addition, the weak form of problem (2.1) is

a (u, v) = (f, v) ∀ v ∈ H 01 (Ω),

(2.2)

where

a (u, v) ≡ ∫ Ω (∑ i, j = 1 3 a i j ∂ i u ∂ j v + ∑ i = 1 3 a i ∂ i u v + a 0 u v) d x d y d z,

and

(f, v) = ∫ Ω f v d x d y d z .

Define the tensor-product linear triangular prism finite element space by

S 0 h (Ω) = {v ∈ H 01 (Ω) : v | e ∈ P (e) ∀ e ∈ T h} .

Thus, the finite element method of problem (2.2) is to find $u h ∈ S 0 h (Ω)$ such that

a (u h, v) = (f, v) ∀ v ∈ S 0 h (Ω) .

Moreover, from the definitions of $Π e$ and $S 0 h (Ω)$ , we may define a global tensor-product linear interpolation operator $Π : H 01 (Ω) → S 0 h (Ω)$ . Here $(Π u) | e = Π e u$ . As for this interpolation operator, the following Lemma 2.1 holds (see [13]).

Lemma 2.1 For Πu and $u h$ , the tensor-product linear interpolant and the tensor-product linear triangular prism finite element approximation to u, respectively, we have the supercloseness estimate

| u h − Π u | 1, ∞, Ω ≤ C h 2 | ln h | 43 ∥ u ∥ 3, ∞, Ω .

(2.3)

3 Gradient recovery and superconvergence

For $v ∈ S 0 h (Ω)$ , we consider a SPR scheme of ∇v. We denote by $R h$ the SPR-recovery operator for ∇v and begin by defining the point values of $R h v$ at the element nodes. After the recovered values at all nodes are obtained, we construct a tensor-product linear interpolation by using these values, namely SPR-recovery gradient $R h v$ . Obviously, $R h v ∈ (S 0 h (Ω)) 3$ .

Let us first assume that N is an interior node of the partition $T h$ , and denote by ω the element patch around N containing 12 triangular prisms. Under the local coordinate system centered N, we let $Q i (x i, y i, z i)$ be the barycenter of a triangular prism $e i ⊂ ω$ , $i = 1, 2, …, 12$ . Obviously, $∑ i = 1 12 (x i, y i, z i) = (0, 0, 0)$ . SPR uses the discrete least-squares fitting to seek linear vector function $p ∈ (P 1 (ω)) 3$ such that

∑ i = 1 12 [p (Q i) − ∇ v (Q i)] q (Q i) = (0, 0, 0) ∀ q ∈ P 1 (ω),

(3.1)

where $v ∈ S 0 h (Ω)$ . We define $R h v (N) = p (0, 0, 0)$ . If N is a boundary node, we calculate $R h v (N)$ by linear extrapolation from the values of $R h v$ already obtained at two neighboring interior nodes, $N 1$ and $N 2$ (with diagonal directions being used for edge nodes and corner nodes) (see Figure 2). Namely,

R h v (N) = 2 R h v (N 1) − R h v (N 2) .

Lemma 3.1 Let ω be the element patch around an interior node N, and $u ∈ W 3, ∞ (ω)$ . For $Π u ∈ S 0 h (Ω)$ the interpolant to u, we have

| ∇ u (N) − R h Π u (N) | ≤ C h 2 ∥ u ∥ 3, ∞, ω .

(3.2)

Proof Choose $v = Π u$ and set $q = 1$ in (3.1) to obtain $∑ i = 1 12 p (Q i) = ∑ i = 1 12 ∇ Π u (Q i)$ . Therefore,

R h Π u (N) − 112 ∑ i = 1 12 ∇ Π u (Q i) = p (0, 0, 0) − 112 ∑ i = 1 12 p (x i, y i, z i) = − 112 ∑ i = 1 12 [∂ 1 p (0, 0, 0) x i + ∂ 2 p (0, 0, 0) y i + ∂ 3 p (0, 0, 0) z i] = (0, 0, 0) .

That is,

R h Π u (N) = 112 ∑ i = 1 12 ∇ Π u (Q i) .

(3.3)

Further,

112 ∑ i = 1 12 ∇ Π u (Q i) − ∇ u (N) = 112 ∑ i = 1 12 ∇ (Π u − u) (Q i) + 112 ∑ i = 1 12 [∇ u (Q i) − ∇ u (N)] = 112 ∑ i = 1 12 ∇ (Π u − u) (Q i) + 112 ∑ i = 1 12 [∂ 1 ∇ u (N) x i + ∂ 2 ∇ u (N) y i + ∂ 3 ∇ u (N) z i] + r (u),

(3.4)

where $112 ∑ i = 1 12 [∂ 1 ∇ u (N) x i + ∂ 2 ∇ u (N) y i + ∂ 3 ∇ u (N) z i] = (0, 0, 0)$ , and the high-order term $r (u)$ satisfies $| r (u) | ≤ C h 2 | u | 3, ∞, ω$ .

In (3.4), we write $f (u) = 112 ∑ i = 1 12 ∇ (Π u − u) (Q i)$ . For every $u ∈ P 2 (ω)$ , it is not difficult to verify $f (u) = (0, 0, 0)$ . Thus, by the Bramble-Hilbert lemma [14], we have $| f (u) | ≤ C h 2 | u | 3, ∞, ω$ . Therefore,

| 112 ∑ i = 1 12 ∇ Π u (Q i) − ∇ u (N) | ≤ C h 2 | u | 3, ∞, ω .

(3.5)

Combining (3.3) and (3.5), we obtain the result (3.2). □

Lemma 3.2 For $Π u ∈ S 0 h (Ω)$ the tensor-product linear interpolant to u, the solution of (2.2), and $R h$ the SPR recovery operator, we have the superconvergent estimate

| ∇ u − R h Π u | 0, ∞, Ω ≤ C h 2 ∥ u ∥ 3, ∞, Ω .

(3.6)

Proof Denote by $F : e ˆ → e$ an affine transformation. Obviously, there exists an element $e ∈ T h$ , using the triangle inequality and the Sobolev embedding theorem [15], and (3.3), such that

| ∇ u − R h Π u | 0, ∞, Ω = | ∇ u − R h Π u | 0, ∞, e ≤ C h − 1 | ∇ u ˆ − R h Π u ˆ | 0, ∞, e ˆ ≤ C h − 1 [| ∇ u ˆ | 0, ∞, e ˆ + | R h Π u ˆ | 0, ∞, e ˆ] ≤ C h − 1 [| ∇ u ˆ | 0, ∞, χ ˆ + | Π u ˆ | 1, ∞, χ ˆ] ≤ C h − 1 ∥ u ˆ ∥ 3, ∞, χ ˆ,

where $χ ˆ$ is a small patch of elements surrounding the triangular prism, $e ˆ$ . Due to the fact that for $u ˆ$ quadratic over $χ ˆ$ ,

∇ u ˆ − R h Π u ˆ = (0, 0, 0) in χ ˆ,

so, from the Bramble-Hilbert lemma [14],

| ∇ u − R h Π u | 0, ∞, Ω ≤ C h − 1 | u ˆ | 3, ∞, χ ˆ ≤ C h 2 | u | 3, ∞, Ω,

which completes the proof of the result (3.6). Finally, we give the main result in this article. □

Theorem 3.1 For $u h ∈ S 0 h (Ω)$ the tensor-product linear triangular prism finite element approximation to u, the solution of (2.2), and $R h$ the SPR recovery operator, we have the superconvergence estimate

| ∇ u − R h u h | 0, ∞, Ω ≤ C h 2 | ln h | 43 ∥ u ∥ 3, ∞, Ω .

(3.7)

Proof Using the triangle inequality, we have

| ∇ u − R h u h | 0, ∞, Ω ≤ | R h (u h − Π u) | 0, ∞, Ω + | ∇ u − R h Π u | 0, ∞, Ω ≤ | u h − Π u | 1, ∞, Ω + | ∇ u − R h Π u | 0, ∞, Ω,

which combined with (2.3) and (3.6) completes the proof of the result (3.7). □

References

1.
Babus̆ka I, Strouboulis T: The Finite Element Method and Its Reliability, Numerical Mathematics and Scientific Computation. Oxford Science Publications, Oxford; 2001.
Google Scholar
2.
Chen CM, Huang YQ: High Accuracy Theory of Finite Element Methods. Hunan Science and Technology Press, Changsha; 1995.
Google Scholar
3.
Chen CM: Construction Theory of Superconvergence of Finite Elements. Hunan Science and Technology Press, Changsha; 2001.
Google Scholar
4.
Lin Q, Yan NN: Construction and Analysis of High Efficient Finite Elements. Hebei University Press, Baoding; 1996.
Google Scholar
5.
Wahlbin L: Superconvergence in Galerkin Finite Element Methods. Springer, Berlin; 1995.
Google Scholar
6.
Zhu QD, Lin Q: Superconvergence Theory of the Finite Element Methods. Hunan Science and Technology Press, Changsha; 1989.
Google Scholar
7.
Zienkiewicz OC, Zhu JZ: A simple estimator and adaptive procedure for practical engineering analysis. Int. J. Numer. Methods Eng. 1987, 24: 337-357. 10.1002/nme.1620240206
MathSciNet Article Google Scholar
8.
Zienkiewicz OC, Zhu JZ: The superconvergence patch recovery and a posteriori error estimates. I. The recovery techniques. Int. J. Numer. Methods Eng. 1992, 33: 1331-1364. 10.1002/nme.1620330702
MathSciNet Article Google Scholar
9.
Zienkiewicz OC, Zhu JZ: The superconvergence patch recovery and a posteriori error estimates. II. Error estimates and adaptivity. Int. J. Numer. Methods Eng. 1992, 33: 1365-1382. 10.1002/nme.1620330703
MathSciNet Article Google Scholar
10.
Chen J, Wang DS: Three-dimensional finite element superconvergent gradient recovery on Par6 patterns. Numer. Math., Theory Methods Appl. 2010, 3: 178-194.
MathSciNet Google Scholar
11.
Chen L: Superconvergence of tetrahedral linear finite elements. Int. J. Numer. Anal. Model. 2006, 3: 273-282.
MathSciNet Google Scholar
12.
Goodsell G: Pointwise superconvergence of the gradient for the linear tetrahedral element. Numer. Methods Partial Differ. Equ. 1994, 10: 651-666. 10.1002/num.1690100511
MathSciNet Article Google Scholar
13.
Liu JH, Deng YJ, Zhu QD: High accuracy analysis of tensor-product linear pentahedral finite elements for variable coefficient elliptic equations. J. Syst. Sci. Complex. 2012, 25: 410-416. 10.1007/s11424-011-0045-6
MathSciNet Article Google Scholar
14.
Bramble JH, Hilbert SR: Estimation of linear functionals on Sobolev spaces with applications to Fourier transforms and spline interpolation. SIAM J. Numer. Anal. 1970, 7: 112-118. 10.1137/0707006
MathSciNet Article Google Scholar
15.
Adams RA: Sobolev Spaces. Academic Press, New York; 1975.
Google Scholar

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China Grant 11161039, the Zhejiang Provincial Natural Science Foundation of China Grant LY13A010007, and the Natural Science Foundation of Ningbo City Grant 2013A610104.

Author information

Affiliations

Department of Fundamental Courses, Ningbo Institute of Technology, Zhejiang University, Qianhu South Road, Ningbo, China
Jinghong Liu
School of Mathematics and Computer Science, Shangrao Normal University, Zhimin Road, Shangrao, 334001, China
Yinsuo Jia

Authors

Jinghong Liu
View author publications
You can also search for this author in PubMed Google Scholar
Yinsuo Jia
View author publications
You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinghong Liu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

The first author gave the idea of this article and the methods of proving the main results. He also proved Lemmas 3.1 and 3.2. The second author provided the proof of Theorem 3.1 and the correction of the English language.

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Authors’ original file for figure 2

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Liu, J., Jia, Y. Superconvergence patch recovery for the gradient of the tensor-product linear triangular prism element. Bound Value Probl 2014, 1 (2014). https://doi.org/10.1186/1687-2770-2014-1

Download citation

Received: 29 July 2013
Accepted: 06 December 2013
Published: 02 January 2014
DOI: https://doi.org/10.1186/1687-2770-2014-1

Keywords

superconvergence patch recovery
superclose property
triangular prism element