Polynomial Preserving Recovery for Quadratic Elements on Anisotropic Meshes
|
|
- Marylou Sparks
- 5 years ago
- Views:
Transcription
1 Polynomial Preserving Recovery for Quadratic Elements on Anisotropic Meshes Can Huang, 1 Zhimin Zhang 1, 1 Department of Mathematics, Wayne State University, Detroit, Michigan 480 College of Mathematics and Computational Science, Sun-Yat-Sen University, Guangzhou, Guangdong 51075, China Received 1 November 010; accepted 15 November 010 Published online in Wiley Online Library (wileyonlinelibrary.com. DOI /num.0669 Polynomial preserving gradient recovery technique under anisotropic meshes is further studied for quadratic elements. The analysis is performed for highly anisotropic meshes where the aspect ratios of element sides are unbounded. When the mesh is adapted to the solution that has significant changes in one direction but very little, if any, in another direction, the recovered gradient can be superconvergent. The results further explain why recovery type error estimator is robust even under nonstandard and highly distorted meshes. 011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 000: , 011 Keywords: anisotropic mesh; finite element; recovery; superconvergence I. INTRODUCTION Finite element recovery techniques are postprocessing methods that reconstruct numerical approximations from finite element solutions to achieve better results. Recent years witness a revitalization of this field, especially those years when Zieniewicz-Zhu introduced their estimator based on superconvergence patch recovery (SPR, where they applied least squares fitting over a set of elements surrounding the vertex to smooth the stress (gradient computed from finite element method [1, ]. Later, another gradient recovery method, called polynomial preserving recovery (PPR was proposed [3, 4]. Both theoretical analysis and numerical tests reveal that PPR has better or at least the same properties as SPR [5]. In this article, we study PPR for quadratic elements under anisotropic meshes. This is the further extension of a recent study for linear element [6]. Nevertheless, this extension is by no means straightforward. A newly developed tool by Huang Xu [7] has to be adopted in order to carry on the needed analysis. Correspondence to: Can Huang, Department of Mathematics, Wayne State University, Detroit, MI 480, USA ( canhuang007@gmail.com Contract grant sponsor: US National Science Foundation; contract grant number: DMS (to Z.Z. Contract grant sponsor: Guangdong Provincial Government of China ( Computational Science Innovative Research Team program (to Z.Z. 011 Wiley Periodicals, Inc.
2 HUANG AND ZHANG In this article, we consider superconvergence for quadratic elements. We now that the optimal convergence rate of gradient approximation by quadratic element is O(h. Our theoretical results shows the convergence rate can reach O(h 3 for mildly structured meshes as well as anisotropic meshes with high aspect ratio in -D. As for references regarding a posteriori error estimates and superconvergence related to this article, the reader is referred to [1,, 8 19]. II. PRELIMINARY KNOWLEDGE A. Model Problem On a bounded polytopic domain R n, we consider the boundary value problem: To find u H 1 ( that satisfies some well-posed boundary conditions and for linear continuous functional f over H 1 B(u, v = f(v, v H 1 (, with bilinear form defined by B(u, v = = n i,j=1 a ij (x u v dx + x i x j n i=1 u A(x vdx + (u, b v + (cu, v. b i (xu v dx + cuvdx x i We assume the usual strong elliptic condition on A = A(x and sufficient regularity on all input data, which will be specified later when needed. Let T h be a simplicial partition of. The quadratic finite element space is then defined by S h ={v : v H 1 (, v P, T h }, where P is the set of polynomials of degree no more than. Then the finite element approximation u h S h satisfies B(u h, v = f(v, v S h. B. Simplification Let A 0 be a piecewise constant function such that each element T h A 0 = 1 A(xdx. Now we define a(u, v = u A(x vdx, a (u, v = u A 0 vdx, e h = u h h, Assume that a ij C 0,α (, it is easy to show that a(e h, v a (e h, v Ch α e h 1, v 1,, α>0.
3 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 3 Therefore, we shift our analysis to a (e h, v. Since A(x is symmetric positive definite, so is A 0. Then there exists an orthogonal matrix Q such that A 0 = Q T D Q with D = diag(d1,..., d n. By changing of variable x = Q z, wehave a (e h, v = z e h D z v detq z dz. z Note that z = Q z x, detq z =±1, and z is obtained by rotating. Therefore, without loss of generality, we may concentrate on the second-order form and estimate the bilinear form e h D vdx = B(e h, v = Th n i=1 d i e h v dx, d i > 0. x i x i e h D vdx + e h (b v + cvdx. Now, let s focus on domain variation. Following [6], we assume that T h can be separated into two parts T h = T 0,h T 1,h, = i,h, = 0,h 1,h, T i,h such that we have the following ɛ-σ condition: 1. Any two triangles that share a common edge in T 0,h form a convex quadrilateral which is an ɛ-perturbation from a parallelogram.. 1,h has a small measure: 1,h =O(h σ (σ > 0. Moreover, in the y-coordinate system, the image of 0,h under the triangulation T 0,h is formed by triangles, where each pair of adjacent elements forms a parallelogram. Under this y-coordinate system, we define a broen norm u, y = T 0,h u,y. By a similar argument as in [6], we have the following theorem. Theorem.1. Let u H 4 ( W 3 ( and u I S h be the solution of the model problem and its quadratic finite element interpolant, respectively. Then e I D vdx (h5/ ( u 4, 0,h + ɛ + h ɛ( u 3, 0,h + ɛ v 1,. (.1 T 0,h Proof. Let e I = u u I, then, we have e I D vdx = I 0 (r + εi 1 (r + ε I (r. (.
4 4 HUANG AND ZHANG Here, I 0 ( = I 1 ( = I ( = n i=1 d i n i=1 n i=1 d i y y d i y e I v dy = y e I D y vdy; y i y i y ( e I v div x η + e n I v η l + v y i y i y i y l=1 l x i y i ( n e I η n v η l e n I y x i l=1 y l x i y i =1 l=1 n e I η dy; y x i n e I η dy; y x i =1 v y l η l x i div x η v y i =1 ɛ is involved in the conformal transformation of domain variation y = x + ɛη(x, where η is a piecewise linear function such that x η is bounded uniformly in ɛ and h. Then, by the standard finite element superconvergence analysis, we are able to derive I 0 ( T 0,h h5/ u 4, y v 1, y h 5/ ( u 4, 0,h + ɛ v 1,, (.3 due to cancellations between parallel sides of adjacent triangles. For the term I 1 (, wehave I 1 ( T 0,h h u 3, y v 1, y h ( u 3, 0,h + ɛ v 1,. (.4 Combining (.3 (.4, we obtain e I D vdx (h5/ ( u 4, 0,h + ɛ + h ɛ( u 3, 0,h + ɛ v 1,. (.5 T 0,h Polynomial Preserving Gradient Recovery. Following [3, 4], we introduce a gradient recovery operator G h : S h S h S h, which has the two properties below: 1. Polynomial preserving: G h (p I = p, p P 3. Consequently, it owns the approximation property u G h u I h 3 u 4,, u H 4 (.. Boundedness: When there are no two adjacent angles on an element patch adding up to exceed π, wehave G h v v 1,, v S h.
5 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 5 Theorem.. Let u H 4 ( W 3 ( and u h S h be the solution of the model problem and its quadratic finite element approximation respectively. Assume (a the ɛ-σ mesh condition, (b the maximum angle condition, and (c the discrete inf-sup condition. Then the polynomial preserving gradient recovery operator G h leads to superconvergence in the sense that: u G h u h h 3 u 4, + h 5/ ( u 4, 0,h + ɛ + h ɛ( u 3, 0,h + ɛ + h +σ/ u 3,,. Proof. By the triangle inequality and the polynomial preserving property, u G h u h u G h u I + G h (u I u h h 3 u 4, + u h u I 1,. (.6 The analysis for the second term on the right-hand side under conditions (a and (b is proceeded as the following: e I D vdx h u 3,, v dx h +σ/ u 3,, v 0,, (.7 T 1,h T 1,h and (by the standard approximation theory e I (b v + cvdx h3 u 3, v 1,. (.8 Based on (.5, (.7, and (.8, we derive B(e I, v (h 5/ ( u 4, 0,h + ɛ + h ɛ( u 3, + ɛ + h +σ/ u 3,, v 1,. (.9 Using the discrete inf-sup condition and the strong elliptic assumption, we then have B(u h u I, v B(e I, v u I u h 1, sup = sup v S h v 1, v S h v 1, h 5/ ( u 4, 0,h + ɛ + h ɛ( u 3, + ɛ + h +σ/ u 3,,. (.10 The conclusion follows by substituting (.10 into (.6. III. ERROR ESTIMATES UNDER ANISOTROPIC MESHES We analyze errors under triangulation of the regular and Union-Jac patterns. We consider the worst case for the regular pattern where the maximum angle condition is violated at the extremal case θ 0, where a patch is compressed at a fixed ratio, i.e., θ = θ, θ 3 = 3 θ, and, 3 > 0. To simplify the matter, we analyze the case b = 0 and c = 0. We need the following integral identity [7] for v Q P (, (u u I v Q = 3 3 (a 3 s ( +b s ( u =1 s=0 l n s t + O(h 4 j u 4,p, v Q j,q,, j = 0, 1.
6 6 HUANG AND ZHANG where is modulo 3, angle θ is opposite of side l (with length l, t (n is the counter-clocwise unit tangential (outer-normal vector on side l. Denote We can express M = sin θ sin θ 1 + sin θ + sin θ 3. and a 0 ( = M ( l 1 l 180 cos θ +1 + l 1l l 3 10 cos θ 1 cos θ +1 l l cos θ 1 l +1 l 1 cos θ 1 cos θ +1, 180 ( a 1 ( = M l 1 l 90 sin θ +1 cos θ +1 l 1l l 3 10 cos θ 1 sin θ +1 a ( = M cos θ 1 sin θ 1 cos θ +1 + l 1l l 3 10 cos θ +1 sin θ sin θ 1 + l +1 l 1 cos θ 1 sin θ +1, 180 l +1 l 1 90 l l +1 ( l 1 l 180 sin θ +1 l 1l l 3 10 sin θ 1 sin θ +1 + l +1 l 1 90 cos θ 1 sin θ 1 sin θ +1 l +1 l a 3 ( = M l+1 l 1 sin θ 1 sin θ +1, 180 sin θ 1 cos θ +1, ( b 0 ( = 1 ( l 4 l +1 l 1 + l4 1 cos3 θ +1 l4 +1 cos3 θ 1, 1440 sin θ +1 sin θ 1 b 1 ( = b ( = b 3 ( = ( 3l 4 1 cos θ +1 3l 4 +1 cos θ 1, ( 3l 4 1 cos θ +1 sin θ +1 3l 4 +1 cos θ 1 sin θ 1, ( l 4 +1 sin θ 1 l 4 1 sin θ +1. In Fig. 1, we let θ = θ, θ 3 = 3 θ. It is straightforward to verify t t = 3 u 3 1 x, 3 = cos 3 t 3 3 θ 3 u x + (3 3 cos 3 θ sin 3 θ 3 u x y (3 cos 3 θ sin 3 θ 3 u x y + sin3 3 θ 3 u y, 3
7 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 7 FIG. 1. Anisotropic mesh. t t 3 = (cos3 θ 3 u 3 x 3 3(sin θ(cos θ 3 u x y 3(sin θ(cos θ 3 u x y (sin3 θ 3 u y, 3 n n 1 t t = 3 u 1 x y, n n t t = (cos 3 θ(sin 3 θ 3 u x 3 +[(cos3 3 θ ( cos 3 θ(sin 3 θ] x y [(cos 3 θ(sin 3 θ (sin 3 3 θ] x y + (sin 3 θ(cos 3 θ 3 u y, 3 n n 3 t t = (cos θ(sin θ 3 u 3 x 3 +[(cos3 θ (sin θ(cos θ] x y +[(cos θ(sin θ (sin 3 θ] x y + (sin θ(cos θ 3 u y, 3 Note that sin θ 1 = sin(π θ θ 3 = sin( + 3 θ. Let l 1 = h, l h, l 3 h. Therefore, as θ 0, for = 1,, 3, we have 1 :a 0 h3 θ, :a 1 h3 θ 1, 3 :a h3, 4 :a 3 h3 θ, 5 :b 0 h4 θ 1, 6 :b 1 h4 7 :b h4 θ, 8 :b 3 h4 θ. (3.1 To balance a 0, a1 and b0, we need following conditions: x 3 = C(u, θ, 0, x 3 = C(u, θ, 0, x y = C(u, θ. (3. 0, Here and hereafter, C(u, (C(u, means a generic constant that depends on u and (, but independent of h and θ. Lemma 3.1. If a 0, a1, b0, = 1,, 3, are balanced, then the coefficients as ( and bs ( given in above have the following properties: (1 a s ( = O(h3, b s ( = O(h4 ;
8 8 HUANG AND ZHANG ( Assume that and are two adjacent equivalent triangles. Then a s ( = as (, b s ( = bs ( ; (3 If and form a pair of O(h approximate equivalent triangles (namely the lengths of any two opposite edges differ only by O(h, then a s ( as ( = O(h 4, b s ( bs ( = O(h 5. Also, by direct computation, one easily get t 1 = v Q x, t = v Q x cos θ 3 v Q x y cos θ 3 sin θ 3 + v Q y sin θ 3, t 3 = v Q x cos θ + v Q x y cos θ sin θ + v Q y sin θ. Noting that the scale in the x-direction is h while in the y-direction, the scale is hθ, one gets v Q y sin θ i = O ( vq, v Q x y sin θ i = O ( Therefore, under the regular partition of anisotropic mesh, see Fig. 1, x. 1, = 1,, 3. (3.3 h Similarly, v Q 1, = 1,, 3. (3.4 t h Thus, L ( h 1 v Q t L (, = 1,, 3. (3.5 Hence, by Lemma 3.1, Hölder s inequality and (3.3 (3.5, we have (a 3 01 ( a 0 1 ( u h 3 θ C(u, θ v t Q 1, h 3 C(u, v Q 1,. 1 t 3 1 Similarly, we obtain the estimate for other cases. Hence, for = 1,, 3 and s = 0, 1,, we have (a 3 s ( a s ( u n s t h 3 C(u, v Q 1,.
9 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 9 However, we can not obtain a similar estimate for boundary terms under such conditions as above because v Q t h 1/ θ 1/ v Q L (γ t. (3.6 L ( To get rid of θ 1/, condition (3. is refined to x 3 = C(u, θ, 0, x y = C(u, θ, 0, x 3 = C(u, θ 3/, 0, x y = C(u, θ 1/. (3.7 0, Thus, assume condition (3.7, and (3.3 (3.5, we obtain: ( 3 b 0 1 ( b0 1 ( u h 5 θ 1 C(u, l t 1 θ 3/ (By (3.1 1 t1 l 1 t 3 1 h 9/ C(u, l 1 t 1 L ( L (l 1 (By (3.6 h 7/ C(u, l 1 v Q 1, (By (3.5 h 7/ C(u, l 1 v Q 1,. By following the same method, we can obtain the estimate for the rest of cases. For the sae of demonstration, we provide the proof of one more case here. ( 3 b 1 ( b1 ( u h 5 C(u, l l n t t θ 1/ t (By (3.1 L (l 1 h 9/ C(u, l (By (3.6 t Hence, for any = 1,, 3 and s = 0, 1,, we have ( 3 b s ( bs ( u l h 7/ C(u, l v Q 1, h 7/ C(u, l v Q 1,. n s t L ( h 7/ C(u, γ v Q 1,, (By(3.5 where γ is the common edge of and. In addition, due to cancellations between parallel sides of adjacent triangles, we have the following identity [7]: ( (u u I, v h = e= s=0 3 (a se ( a s e ( + [ b s e ( bs e ( ] + O(h 4 s u e n s t t 4,p, v h s,q,. Following the above identity, we derive the following theorem.
10 10 HUANG AND ZHANG FIG.. Union-Jac Pattern. Theorem 3.1. Let u H 4 ( a and let a contain anisotropic uniform triangles of type in Fig. 1 with θ (0, π/4] (θ (π/4, π/ can be treated similarly by shifting the focus directions. Assume that x 3 = C(u, θ, 0, x y = C(u, θ, 0, x 3 = C(u, θ 3/, 0, x y = C(u, θ 1/. 0, Then we have e I D v h h 3 v h 1, a, a v h S 0 h ( a. Remar 1. From Theorem 3.1, we see that if u has very little activity in the x-direction, the degenerating limit θ = 0 in a sample triangle can be allowed, which is equivalent to allow the maximum angle in be as close as possible to π. The rate of convergence is maintained at O(h 3. Remar. In this case, two adjacent triangles form a parallelogram or a quasi-parallelogram, so cancellation instead of doubling between parallel sides occurs. Remar 3. In the result, the constant depends on u and a, but it is independent of h and θ. Next, let us consider the model problem under Union-Jac Patch, see Fig.. In this case, we can not analyze the problem in a similar fashion as we did in the previous case since some two adjacent triangles, say 1 and 8 does not form a quasi-parallelogram. The integral on the side shared by these two triangles doubles instead of canceling. However, if we group triangles 1 and 5, and 6, 3 and 7, 4, and 8, cancelations also happens under certain conditions. Here we only focus on 1 and 5 and we allow them to form a pair of O(h equivalent triangles, but we restrict θ = π. For other pairs, we can analyze them in exactly the same way (Fig. 3. From the graph above, we now that θ 1, θ, and θ 3 of these two triangles are almost the same. Moreover, both of these pairs are in count-clocwise order. Hence, a s ( 1 a s ( 5 = O(h 4, b s ( 1 b s ( 5 = O(h 5, = 1,, 3; s = 0, 1,, 3. Also, both the unit tangent and out-normal vectors on the corresponding sides are opposite.
11 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 11 FIG. 3. A group: 1 and 5. We also assume that the patch is compressed at a fixed ratio as in the case of regular mesh, i.e., θ 3 = θ. Hence, l 1 = h, l = O(h, l 3 = O(hθ,asθ 0. By simple computation, we obtain 1 :a1 0 h3, a 0 = 0, a0 3 h3 θ 3, :a1 1 h3 θ, a 1 = 0, a1 3 h3 θ, 3 :a1 h3 θ, a = 0, a 3 h3 θ, 4 :a1 3 h3 θ 3, a 3 = 0, a3 3 h3, 5 :b1 0 h4 θ 1, b 0 h4 θ 1, b3 0 h4 θ 3, 6 :b1 1 h4, b 1 h4, b3 1 h4 θ, 7 :b1 h4 θ, b h4 θ, b3 h4 θ, 8 :b1 3 h4 θ, b 3 h4 θ, b3 3 h4. (3.8 On the other hand, t t = 3 u 3 1 x, 3 u n n 3 = 3 3 x, 3 = cos 3 θ 3 u t 3 x + (3 3 cos θ sin θ 3 u x y (3 cos θ sin θ 3 u x y + sin3 θ 3 u y, 3 n n t = cos θ sin θ 3 u x + 3 (cos3 θ sin θ cos θ 3 u x y + (sin 3 θ cos θ sin θ 3 u x y + sin3 θ cos θ 3 u y, 3 It follows that if x 3 = C(u, θ, (3.9
12 1 HUANG AND ZHANG then b1 0 and b0 are balanced. From Appendix, we see that under the Union-Jac mesh, v t h 1 θ 1 v 1, h 1 θ 1 v 1,, = 1,, 3; L ( v h 3/ θ 1 v 1, h 3/ θ 1 v 1,, = 1,, 3. (3.10 L (γ Thus, we require condition (3.9 to be refined to x 3 = C(u, θ, 0, x 3 = C(u, θ, 0, x y = C(u, θ. (3.11 0, Hence, if u W 4,p ( and condition (3.11 holds, then we obtain ( { a s ( 1 + a s ( n s t = a s t t t ( v Q 1 1 n s t t t t + + ( a s ( 5 a s ( 1 5 n s t t = I 1 + I. 5 t } n s t t t t Since n and t of corresponding sides of 1 and 5 are opposite, we conclude that the sign of v Q 1 n s t t t t and 5 n s t t are opposite. Therefore, for = 1 and s = 0, we obtain I 1 h a 0 1 ( C(u, 1 5 θ (By (3.8 and (3.11 t 0, 1 5 h 4 C(u, 1 5 θ t 0, 1 5 t h 3 C(u, 1 5 v 1,1 5. (By (3.10 I h 4 C(u, 1 5 θ (By (3.8 and (3.11 0, 1 5 h 4 C(u, 1 5 θ 0, 1 5 h 3 C(u, 1 5 v 1,1 5. (By (3.10 By following the same argument, we can obtain the same estimate for all other s and s s. Hence, I i h 3 C(u, 1 5 v 1,1 5, = 1,, 3, s = 0, 1,, 3, i = 1,. t
13 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 13 Summing up I 1 and I, we obtain, ( a s ( 1 + a s ( n s t h 3 C(u, 1 5 v 1,1 5. Now, let s consider terms involving integration on the boundary. ( b s ( 1 + b s ( 5 l 1 l 5 nn n s t t t t { = b s ( 1 l 1 nn n s t t v Q t t + + ( b s ( 5 b s ( 1 l 5 n n s tt = L 1 + L. l 5 t n n s tt t t t } t t By the same analysis as I 1, we now that the sign of l 1 n s t and l 5 n s t are opposite. Hence, for = 1 and s = 0, L 1 h b 0 1 ( C(u, l1 l 5 θ, (By (3.8 and (3.11 t1 0, l 1 l 5 h 7/ C(u, l 1 l 5, (By (3.10 t1 0, h 7/ C(u, l 1 l 5 v Q 1,. L h 5 θ 1 C(u, l 1 l 5 θ, (By (3.8 and (3.11 t1 0, l 1 l 5 h 7/ v Q C(u, l 1 l 5, (By (3.10 0, t 1 h 7/ C(u, l 1 l 5 v Q 1,. Thus, ( b 0 1 ( 1 + b 0 1 ( 5 l 1 l 5 t 3 t 1 h 7/ C(u, l 1 l 5 v Q 1,. By the same argument as above, we can obtain ( b s ( 1 + b s ( 5 l 1 l 5 n s 3 t h 7/ C(u, l 1 l 5 v Q 1,1 5 = 1,, 3, s = 0, 1,, 3.
14 14 HUANG AND ZHANG Again, we provide the proof of one more case for demonstration. For =, s = 1, L 1 h b 1 ( C(u, l 1 l 5 θ, (By (3.8 and (3.11 t 0, l 1 l 5 h 7/ C(u, l 1 l 5, (By (3.10 t 0, h 7/ C(u, l 1 l 5 v Q 1,. L h 5 C(u, l 1 l 5 θ, (By (3.8 and (3.11 0, l 1 l 5 h 7/ C(u, l 1 l 5 t t h 7/ C(u, l 1 l 5 v Q 1,. 0,, (By (3.10 Our result can be concluded as the following theorem: Theorem 3.. Let u H 5 ( a and let contain anisotropic uniform triangles of type in Figure with θ (0, π/4] (θ (π/4, π/ can be treated similarly by shifting the focus directions. Assume that x 3 = C(u, θ, 0, x 3 = C(u, θ, 0, x y = C(u, θ. 0, Then we have e I D v h h 3 v h 1, a, a v h S 0 h ( a. By the similar argument as in Theorem., we have following theorems. Theorem 3.3. Let u H 4 ( W 3 ( and u h S h be the solution of the model problem and its quadratic finite element approximation, respectively. Assume (a ɛ-σ mesh condition, (b a 0,h contains anisotropic uniform triangles of type in Fig. 1 with θ (0, π/4] and elements in \ a satisfy the maximum angle condition, and (c the discrete inf-sup condition. Furthermore, assume that the condition in Theorem 3.1 is satisfied. Then the polynomial preserving gradient recovery operator G h has the following error bound: u G h u h h 3 C 1 (u, + h 5/ (C (u, 0,h + ɛ + h ɛ(c 3 (u, ɛ + ɛ + h +σ/ C 4 (u,. Theorem 3.4. Let u H 5 ( W 3 ( and u h S h be the solution of the model problem and its quadratic finite element approximation, respectively. Assume (a ɛ-σ mesh condition, (b a 0,h contains anisotropic uniform triangles of type in Fig. with θ (0, π/4] and elements in \ a satisfy the maximum angle condition, and (c the discrete inf-sup condition. Furthermore, assume that the condition in Theorem 3. is satisfied. Then the polynomial preserving gradient recovery operator G h has the following error bound: u G h u h h 3 C 1 (u, + h 5/ (C (u, 0,h + ɛ + h ɛ(c 3 (u, ɛ + ɛ + h +σ/ C 4 (u,.
15 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 15 TABLE I. L errors for both meshes on [0,1]. Partition Regular Union-Jac 0.60e e e e e e e e e e 003 FIG. 4. L error for regular meshes and L error for Union-Jac meshes. IV. NUMERICAL EXPERIMENT We compute the Neumann boundary equation below on the unit square domain: u + u = f, u µ = g. (4.1 Here, we choose proper functions f and g such that u = sin(πx sin(10πy. The L Error on the whole domain under regular and Union-Jac patterns are shown in Table I: Corresponding graph is in Fig. 4. APPENDIX: INVERSE INEQUALITY FOR UNION-JACK ANISOTROPIC MESHES Let us focus on one in Fig. A1 since we can obtain the results for regular mesh in a similar way. We observe that h = θh as θ 0. Theorem. Let γ be the boundary of, and v S h, then v 1 Hθ v 1, L (
16 16 HUANG AND ZHANG FIG. A1. One element of Union-Jac pattern. and v L (γ 1 H 3/ θ v 1, Proof. Without loss of generality, we assume that vertexes of are A(0, 0, B(H,0, and C(0, h. Then v is of the form ( x ( x ( y ( y x v = a + b + c + d H H h h H + e y h + f, where a, b, c, d, e, f are constants. The results are obvious if v is a constant or a linear function, then the results follow from the classic inverse inequality. From now on, we assume that the coefficient of y term is not 0, i.e., c = 0. v x = ax H + by Hh + d H, v xx = a H, v xy = b hh, v t 1 v y = cy h v yy = c h, + bx Hh + e h, = v x, v = v t3 y, v = cos θ v t x cos θ sin θ v x y + sin θ v y. Therefore, v t1 v t1 v t L ( L (l 1 L ( H hh = h1/ H 3/, H H 1/ = H 3/, v x + θ v L ( x y + v L ( y θ H hh + θ L ( 1 hh hh + 1 h θ hh h1/ H 3/,
17 POLYNOMIAL PRESERVING RECOVERY FOR QUADRATIC ELEMENTS 17 v t v t3 v t 3 L (l L ( L (ł 3 v x + θ v L (l x y + v L (l y θ H H + θ 1 H, 3/ = v y = v y Now, let s compute v 1,. [ (ax v 1, = H + by hh + d H [ (ax = 1 H h h H x 0 0 H h 0 0 H [ (ax H = 4a H 3 h + b h 3 H H 4 3 h H 3 + 4c h 4 h H + H h h 3 H 3 + b L ( L (ł 3 1 hh H + 1 h θ H h hh H 1/ h 3/, h h 1 h 3/. ( cy + + bx h hh + e ] dxdy h L (l + by hh + d ( cy + + bx H h hh + e ] dxdy h + by hh + d ( cy + + bx H h hh + e ] dxdy h + d 4ab H h hh + + 4ad H h + bd h H H hh 3 4 H 3 hh H 3 h + e h H 3 H ( h H 0asθ 0 4bc h H hh + h 3 H 4 + 4ec h 3 h H + be H h h H = H h Hence, v L ( h H. we obtain v t v L ( L γ 1 h v 1, 1 Hθ v 1,, = 1,, 3. 1 h H v 1, 1 H 3/ θ v 1,, = 1,, 3. References 1. O. C. Zieniewicz and J. Z. Zhu, The superconvergence patch recovery and a posteriori error estimates, Part 1: the recovery technique, Int J Numer Methods Eng 33 (199,
18 18 HUANG AND ZHANG. O. C. Zieniewicz and J. Z. Zhu, The superconvergence patch recovery and a posteriori error estimates. Part : error estimates and adaptivity, Int J Numer Methods Eng 33 (199, Z. Zhang and A. Naga, A new finite element gradient recovery method: Superconvergence property, SIAM J Sci Comput 6 (005, A. Naga and Z. Zhang, The polynomial-preserving recovery for higher order finite element methods in D and 3D, Discrete Cont Dyn Syst B 5 (005, A. Naga and Z. Zhang, The polynomial-preserving recovery for higher order finite element methods in D and 3D, Discrete Cont Dyn Syst, Series B 5 (005, Z. Zhang, Polynomial preserving recovery for meshes from Delaunay triangulation or with high aspect ratio, Numer Methods Partial Differential Eq 4 (008, Y. Huang and J. Xu, Superconvergence of quadratic finite elements on mildly structured grids, Math Comput 77 (008, M. Ainsworth and J. T. Oden, A posteriori error estimation in finite element analysis, Wiley, New Yor, I. Babuša and A. K. Aziz, On the angle condition in the finite element method, SIAM J Numer Anal 13 (1976, I. Babuša and W. C. Rheinboldt, A posteriori error estimates for the finite element method, Int J Numer Methods Eng 1 (1978, J. Brandts and M. Kříže, Superconvergence of tetraherral quadratic finite elements, J Comp Math 3 (005, J. Dompierre, M.-G. Vallet, Y. Bourgault, M. Fortin, and W. G. Habashi, Anisotropic mesh adaptation: towards user-independent, mesh-independent and solver-independent CFD. Part III. Unstructured meshes, Int J Numer Meth Fluids 39 (00, W. Hoffmann, A. H. Schatz, L. B. Wahlbin, and G. Wittum, Asymptotically exact a posteriori estimators for the pointwise gradient error on each element in irregular meshes I: a smooth problem and globally quasi-uniform meshes, Math Comput 70 (001, M. Kříže, On semiregular families of triangulations and linear interpolation, Math Appl 36 (1991, M. Kříže, P. Neittaanmäi, and Stenberg R., editors, Finite element methods: superconvergence, postprocessing, and a posteriori estimates, Lecture Notes in Pure and Applied Mathematics, 196, Marcel Deer, New Yor, Q. Lin and N. Yan, Construction and analysis of high efficient finite elements (in Chinese, Hebei University Press, P. R. China, R. Verfürth, A posteriori error estimation and adaptive mesh refinement techniques, Teubner Sripten zur Numeri, B. G. Teubner, Stuttgart, J. Z. Zhu and Z. Zhang, The relationship of some a posteriori error estimators, Comput Methods Appl Mech Eng 176 (1999, O. C. Zieniewicz and J. Z. Zhu, A simple error estimator and adaptive procedure for practical engineering analysis, Int J Numer Methods Eng 4 (1987,
arxiv: v2 [math.na] 23 Apr 2016
Improved ZZ A Posteriori Error Estimators for Diffusion Problems: Conforming Linear Elements arxiv:508.009v2 [math.na] 23 Apr 206 Zhiqiang Cai Cuiyu He Shun Zhang May 2, 208 Abstract. In [8], we introduced
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 37, pp. 166-172, 2010. Copyright 2010,. ISSN 1068-9613. ETNA A GRADIENT RECOVERY OPERATOR BASED ON AN OBLIQUE PROJECTION BISHNU P. LAMICHHANE Abstract.
More informationTHE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER QUADRILATERAL MESHES. Zhong-Ci Shi and Xuejun Xu.
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS SERIES B Volume 9, Number, January 2008 pp. 63 82 THE PATCH RECOVERY FOR FINITE ELEMENT APPROXIMATION OF ELASTICITY PROBLEMS UNDER
More informationEnhancing eigenvalue approximation by gradient recovery on adaptive meshes
IMA Journal of Numerical Analysis Advance Access published October 29, 2008 IMA Journal of Numerical Analysis Page 1 of 15 doi:10.1093/imanum/drn050 Enhancing eigenvalue approximation by gradient recovery
More informationarxiv: v1 [math.na] 1 May 2013
arxiv:3050089v [mathna] May 03 Approximation Properties of a Gradient Recovery Operator Using a Biorthogonal System Bishnu P Lamichhane and Adam McNeilly May, 03 Abstract A gradient recovery operator based
More informationPOLYNOMIAL PRESERVING GRADIENT RECOVERY AND A POSTERIORI ESTIMATE FOR BILINEAR ELEMENT ON IRREGULAR QUADRILATERALS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume, Number, Pages 24 c 2004 Institute for Scientific Computing and Information POLYNOMIAL PRESERVING GRADIENT RECOVERY AND A POSTERIORI ESTIMATE
More informationASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE
MATEMATICS OF COMPUTATION Volume 73, Number 246, Pages 517 523 S 0025-5718(0301570-9 Article electronically published on June 17, 2003 ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR TE POINTWISE GRADIENT
More informationc 2004 Society for Industrial and Applied Mathematics
SIAM J. NUMER. ANAL. Vol. 42, No. 4, pp. 1780 1800 c 2004 Society for Industrial and Applied Mathematics A POSTERIORI ERROR ESTIMATES BASED ON THE POLYNOMIAL PRESERVING RECOVERY AHMED NAGA AND ZHIMIN ZHANG
More informationUltraconvergence of ZZ Patch Recovery at Mesh Symmetry Points
Ultraconvergence of ZZ Patch Recovery at Mesh Symmetry Points Zhimin Zhang and Runchang Lin Department of Mathematics, Wayne State University Abstract. The ultraconvergence property of the Zienkiewicz-Zhu
More informationPIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED
PIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED ALAN DEMLOW Abstract. Recent results of Schatz show that standard Galerkin finite element methods employing piecewise polynomial elements of degree
More informationOn angle conditions in the finite element method. Institute of Mathematics, Academy of Sciences Prague, Czech Republic
On angle conditions in the finite element method Michal Křížek Institute of Mathematics, Academy of Sciences Prague, Czech Republic Joint work with Jan Brandts (University of Amsterdam), Antti Hannukainen
More informationHigh order, finite volume method, flux conservation, finite element method
FLUX-CONSERVING FINITE ELEMENT METHODS SHANGYOU ZHANG, ZHIMIN ZHANG, AND QINGSONG ZOU Abstract. We analyze the flux conservation property of the finite element method. It is shown that the finite element
More informationA gradient recovery method based on an oblique projection and boundary modification
ANZIAM J. 58 (CTAC2016) pp.c34 C45, 2017 C34 A gradient recovery method based on an oblique projection and boundary modification M. Ilyas 1 B. P. Lamichhane 2 M. H. Meylan 3 (Received 24 January 2017;
More informationSupraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives
Supraconvergence of a Non-Uniform Discretisation for an Elliptic Third-Kind Boundary-Value Problem with Mixed Derivatives Etienne Emmrich Technische Universität Berlin, Institut für Mathematik, Straße
More informationA POSTERIORI ERROR ESTIMATES BY RECOVERED GRADIENTS IN PARABOLIC FINITE ELEMENT EQUATIONS
A POSTERIORI ERROR ESTIMATES BY RECOVERED GRADIENTS IN PARABOLIC FINITE ELEMENT EQUATIONS D. LEYKEKHMAN AND L. B. WAHLBIN Abstract. This paper considers a posteriori error estimates by averaged gradients
More informationA C 0 Linear Finite Element Method for Biharmonic Problems
DOI 10.1007/s10915-017-0501-0 A C 0 Linear Finite Element Method for Biharmonic Problems Hailong Guo 1,2 Zhimin Zhang 1,3 Qingsong Zou 4 Received: 8 December 2016 / Revised: 29 June 2017 / Accepted: 11
More informationAn a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element
Calcolo manuscript No. (will be inserted by the editor) An a posteriori error estimate and a Comparison Theorem for the nonconforming P 1 element Dietrich Braess Faculty of Mathematics, Ruhr-University
More informationA Posteriori Error Estimation Techniques for Finite Element Methods. Zhiqiang Cai Purdue University
A Posteriori Error Estimation Techniques for Finite Element Methods Zhiqiang Cai Purdue University Department of Mathematics, Purdue University Slide 1, March 16, 2017 Books Ainsworth & Oden, A posteriori
More informationon! 0, 1 and 2 In the Zienkiewicz-Zhu SPR p 1 and p 2 are obtained by solving the locally discrete least-squares p
Analysis of a Class of Superconvergence Patch Recovery Techniques for Linear and Bilinear Finite Elements Bo Li Zhimin Zhang y Abstract Mathematical proofs are presented for the derivative superconvergence
More informationRemarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable?
Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable? Thomas Apel, Hans-G. Roos 22.7.2008 Abstract In the first part of the paper we discuss minimal
More informationELLIPTIC RECONSTRUCTION AND A POSTERIORI ERROR ESTIMATES FOR PARABOLIC PROBLEMS
ELLIPTIC RECONSTRUCTION AND A POSTERIORI ERROR ESTIMATES FOR PARABOLIC PROBLEMS CHARALAMBOS MAKRIDAKIS AND RICARDO H. NOCHETTO Abstract. It is known that the energy technique for a posteriori error analysis
More informationValidation of the a posteriori error estimator based on polynomial preserving recovery for linear elements
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2004; 61:1860 1893 ublished online 18 October 2004 in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/nme.1134
More informationNodal O(h 4 )-superconvergence of piecewise trilinear FE approximations
Preprint, Institute of Mathematics, AS CR, Prague. 2007-12-12 INSTITTE of MATHEMATICS Academy of Sciences Czech Republic Nodal O(h 4 )-superconvergence of piecewise trilinear FE approximations Antti Hannukainen
More informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS CARLO LOVADINA AND ROLF STENBERG Abstract The paper deals with the a-posteriori error analysis of mixed finite element methods
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationSuperconvergent Two-Grid Methods for Elliptic Eigenvalue Problems
DOI 1.17/s1915-16-245-2 Superconvergent Two-Grid Methods for Elliptic Eigenvalue Problems Hailong Guo 2,3 Zhimin Zhang 1,2 Ren Zhao 2 Received: 4 April 215 / Revised: 12 May 216 / Accepted: 28 June 216
More informationSUPERCONVERGENCE ANALYSIS OF THE LINEAR FINITE ELEMENT METHOD AND A GRADIENT RECOVERY POSTPROCESSING ON ANISOTROPIC MESHES
MATHEMATICS OF COMPUTATION Volume 84, Number 29, January 205, Pages 89 7 S 0025-578(204)02846-9 Article electronically published on May 28, 204 SUPERCONVERGENCE ANALYSIS OF THE LINEAR FINITE ELEMENT METHOD
More informationA Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions
A Finite Element Method Using Singular Functions for Poisson Equations: Mixed Boundary Conditions Zhiqiang Cai Seokchan Kim Sangdong Kim Sooryun Kong Abstract In [7], we proposed a new finite element method
More informationA posteriori error estimates applied to flow in a channel with corners
Mathematics and Computers in Simulation 61 (2003) 375 383 A posteriori error estimates applied to flow in a channel with corners Pavel Burda a,, Jaroslav Novotný b, Bedřich Sousedík a a Department of Mathematics,
More informationChapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction
Chapter 6 A posteriori error estimates for finite element approximations 6.1 Introduction The a posteriori error estimation of finite element approximations of elliptic boundary value problems has reached
More informationMaximum norm estimates for energy-corrected finite element method
Maximum norm estimates for energy-corrected finite element method Piotr Swierczynski 1 and Barbara Wohlmuth 1 Technical University of Munich, Institute for Numerical Mathematics, piotr.swierczynski@ma.tum.de,
More informationA C 0 linear finite element method for two fourth-order eigenvalue problems
IMA Journal of Numerical Analysis (2017) 37, 2120 2138 doi: 10.1093/imanum/drw051 Advance Access publication on November 2, 2016 A C 0 linear finite element method for two fourth-order eigenvalue problems
More informationAMS subject classifications. Primary, 65N15, 65N30, 76D07; Secondary, 35B45, 35J50
A SIMPLE FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU AND XIU YE Abstract. The goal of this paper is to introduce a simple finite element method to solve the Stokes equations. This method is in
More informationA Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators
A Framework for Analyzing and Constructing Hierarchical-Type A Posteriori Error Estimators Jeff Ovall University of Kentucky Mathematics www.math.uky.edu/ jovall jovall@ms.uky.edu Kentucky Applied and
More informationA Least-Squares Finite Element Approximation for the Compressible Stokes Equations
A Least-Squares Finite Element Approximation for the Compressible Stokes Equations Zhiqiang Cai, 1 Xiu Ye 1 Department of Mathematics, Purdue University, 1395 Mathematical Science Building, West Lafayette,
More informationHamburger Beiträge zur Angewandten Mathematik
Hamburger Beiträge zur Angewandten Mathematik Numerical analysis of a control and state constrained elliptic control problem with piecewise constant control approximations Klaus Deckelnick and Michael
More informationIMPROVED LEAST-SQUARES ERROR ESTIMATES FOR SCALAR HYPERBOLIC PROBLEMS, 1
Computational Methods in Applied Mathematics Vol. 1, No. 1(2001) 1 8 c Institute of Mathematics IMPROVED LEAST-SQUARES ERROR ESTIMATES FOR SCALAR HYPERBOLIC PROBLEMS, 1 P.B. BOCHEV E-mail: bochev@uta.edu
More informationTHE POLYNOMIAL-PRESERVING RECOVERY FOR HIGHER ORDER FINITE ELEMENT METHODS IN 2D AND 3D. A. Naga and Z. Zhang 1. (Communicated by Zhiming Chen)
DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS SERIES B Volume 5, Number 3, August 2005 pp. 769 798 THE POLYNOMIAL-PRESERVING RECOVERY FOR HIGHER ORDER FINITE ELEMENT METHODS
More informationb i (x) u + c(x)u = f in Ω,
SIAM J. NUMER. ANAL. Vol. 39, No. 6, pp. 1938 1953 c 2002 Society for Industrial and Applied Mathematics SUBOPTIMAL AND OPTIMAL CONVERGENCE IN MIXED FINITE ELEMENT METHODS ALAN DEMLOW Abstract. An elliptic
More informationA NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION
A NOTE ON THE LADYŽENSKAJA-BABUŠKA-BREZZI CONDITION JOHNNY GUZMÁN, ABNER J. SALGADO, AND FRANCISCO-JAVIER SAYAS Abstract. The analysis of finite-element-like Galerkin discretization techniques for the
More informationENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED FINITE ELEMENT METHODS
MATHEMATICS OF COMPUTATION Volume 75, Number 256, October 2006, Pages 1659 1674 S 0025-57180601872-2 Article electronically published on June 26, 2006 ENERGY NORM A POSTERIORI ERROR ESTIMATES FOR MIXED
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationConvergence and optimality of an adaptive FEM for controlling L 2 errors
Convergence and optimality of an adaptive FEM for controlling L 2 errors Alan Demlow (University of Kentucky) joint work with Rob Stevenson (University of Amsterdam) Partially supported by NSF DMS-0713770.
More informationSuperconvergence analysis of the SDFEM for elliptic problems with characteristic layers
Superconvergence analysis of the SDFEM for elliptic problems with characteristic layers S. Franz, T. Linß, H.-G. Roos Institut für Numerische Mathematik, Technische Universität Dresden, D-01062, Germany
More informationSUPERCONVERGENCE OF DG METHOD FOR ONE-DIMENSIONAL SINGULARLY PERTURBED PROBLEMS *1)
Journal of Computational Mathematics, Vol.5, No., 007, 185 00. SUPERCONVERGENCE OF DG METHOD FOR ONE-DIMENSIONAL SINGULARLY PERTURBED PROBLEMS *1) Ziqing Xie (College of Mathematics and Computer Science,
More informationMultigrid Methods for Saddle Point Problems
Multigrid Methods for Saddle Point Problems Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University Advances in Mathematics of Finite Elements (In
More informationLocal discontinuous Galerkin methods for elliptic problems
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2002; 18:69 75 [Version: 2000/03/22 v1.0] Local discontinuous Galerkin methods for elliptic problems P. Castillo 1 B. Cockburn
More informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
More informationMULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.
MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract
More informationMultigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids
Multigrid Methods for Elliptic Obstacle Problems on 2D Bisection Grids Long Chen 1, Ricardo H. Nochetto 2, and Chen-Song Zhang 3 1 Department of Mathematics, University of California at Irvine. chenlong@math.uci.edu
More informationA Finite Element Method Using Singular Functions: Interface Problems
A Finite Element Method Using Singular Functions: Interface Problems Seokchan Kim Zhiqiang Cai Jae-Hong Pyo Sooryoun Kong Abstract The solution of the interface problem is only in H 1+α (Ω) with α > 0
More informationAn interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes
An interpolation operator for H 1 functions on general quadrilateral and hexahedral meshes with hanging nodes Vincent Heuveline Friedhelm Schieweck Abstract We propose a Scott-Zhang type interpolation
More informationProjected Surface Finite Elements for Elliptic Equations
Available at http://pvamu.edu/aam Appl. Appl. Math. IN: 1932-9466 Vol. 8, Issue 1 (June 2013), pp. 16 33 Applications and Applied Mathematics: An International Journal (AAM) Projected urface Finite Elements
More informationComparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes
Comparison of V-cycle Multigrid Method for Cell-centered Finite Difference on Triangular Meshes Do Y. Kwak, 1 JunS.Lee 1 Department of Mathematics, KAIST, Taejon 305-701, Korea Department of Mathematics,
More informationAbstract. 1. Introduction
Journal of Computational Mathematics Vol.28, No.2, 2010, 273 288. http://www.global-sci.org/jcm doi:10.4208/jcm.2009.10-m2870 UNIFORM SUPERCONVERGENCE OF GALERKIN METHODS FOR SINGULARLY PERTURBED PROBLEMS
More informationBasic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems
Basic Concepts of Adaptive Finite lement Methods for lliptic Boundary Value Problems Ronald H.W. Hoppe 1,2 1 Department of Mathematics, University of Houston 2 Institute of Mathematics, University of Augsburg
More informationA posteriori error estimates for non conforming approximation of eigenvalue problems
A posteriori error estimates for non conforming approximation of eigenvalue problems E. Dari a, R. G. Durán b and C. Padra c, a Centro Atómico Bariloche, Comisión Nacional de Energía Atómica and CONICE,
More informationRecovery Techniques For Finite Element Methods And Their Applications
Wayne State University Wayne State University Dissertations 1-1-2015 Recovery Techniques For Finite Element Methods And Their Applications Hailong Guo Wayne State University, Follow this and additional
More informationLecture Note III: Least-Squares Method
Lecture Note III: Least-Squares Method Zhiqiang Cai October 4, 004 In this chapter, we shall present least-squares methods for second-order scalar partial differential equations, elastic equations of solids,
More informationYongdeok Kim and Seki Kim
J. Korean Math. Soc. 39 (00), No. 3, pp. 363 376 STABLE LOW ORDER NONCONFORMING QUADRILATERAL FINITE ELEMENTS FOR THE STOKES PROBLEM Yongdeok Kim and Seki Kim Abstract. Stability result is obtained for
More informationINTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR GRIDS. 1. Introduction
Trends in Mathematics Information Center for Mathematical Sciences Volume 9 Number 2 December 2006 Pages 0 INTERGRID OPERATORS FOR THE CELL CENTERED FINITE DIFFERENCE MULTIGRID ALGORITHM ON RECTANGULAR
More informationFind (u,p;λ), with u 0 and λ R, such that u + p = λu in Ω, (2.1) div u = 0 in Ω, u = 0 on Γ.
A POSTERIORI ESTIMATES FOR THE STOKES EIGENVALUE PROBLEM CARLO LOVADINA, MIKKO LYLY, AND ROLF STENBERG Abstract. We consider the Stokes eigenvalue problem. For the eigenvalues we derive both upper and
More informationA Mixed Nonconforming Finite Element for Linear Elasticity
A Mixed Nonconforming Finite Element for Linear Elasticity Zhiqiang Cai, 1 Xiu Ye 2 1 Department of Mathematics, Purdue University, West Lafayette, Indiana 47907-1395 2 Department of Mathematics and Statistics,
More information1. Introduction. We consider the model problem that seeks an unknown function u = u(x) satisfying
A SIMPLE FINITE ELEMENT METHOD FOR LINEAR HYPERBOLIC PROBLEMS LIN MU AND XIU YE Abstract. In this paper, we introduce a simple finite element method for solving first order hyperbolic equations with easy
More informationNon-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions
Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Wayne McGee and Padmanabhan Seshaiyer Texas Tech University, Mathematics and Statistics (padhu@math.ttu.edu) Summary. In
More informationGeometric Multigrid Methods
Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010 Ideas
More informationPARTITION OF UNITY FOR THE STOKES PROBLEM ON NONMATCHING GRIDS
PARTITION OF UNITY FOR THE STOES PROBLEM ON NONMATCHING GRIDS CONSTANTIN BACUTA AND JINCHAO XU Abstract. We consider the Stokes Problem on a plane polygonal domain Ω R 2. We propose a finite element method
More information+ (u u h. ( h ) 0, + (u u I ( I. + (u I. u h 2( ( I. = CB h. ; h. + ( h. + k, ( u k, ch 2(k 2) 2. = c h. + u h. + f 0,T T T h. F h. ,u h ).
The Open Numerical Methods Journal 009-5 Open Access An Adaptive Least-Squares Mixed Finite Element Method for Fourth- Order Elliptic Equations Gu Haiming * Li Hongwei and Xie Bing Department of Mathematics
More informationDISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS
DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS Sergey Korotov BCAM Basque Center for Applied Mathematics http://www.bcamath.org 1 The presentation is based on my collaboration with several
More informationFinite Element Superconvergence Approximation for One-Dimensional Singularly Perturbed Problems
Finite Element Superconvergence Approximation for One-Dimensional Singularly Perturbed Problems Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202 Received 19 July 2000; accepted
More informationAdaptive Finite Element Methods Lecture Notes Winter Term 2017/18. R. Verfürth. Fakultät für Mathematik, Ruhr-Universität Bochum
Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18 R. Verfürth Fakultät für Mathematik, Ruhr-Universität Bochum Contents Chapter I. Introduction 7 I.1. Motivation 7 I.2. Sobolev and finite
More informationMIXED FINITE ELEMENTS FOR PLATES. Ricardo G. Durán Universidad de Buenos Aires
MIXED FINITE ELEMENTS FOR PLATES Ricardo G. Durán Universidad de Buenos Aires - Necessity of 2D models. - Reissner-Mindlin Equations. - Finite Element Approximations. - Locking. - Mixed interpolation or
More informationTo link to this article:
This article was downloaded by: [Wuhan University] On: 11 March 2015, At: 01:08 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
More informationWEAK GALERKIN FINITE ELEMENT METHOD FOR SECOND ORDER PARABOLIC EQUATIONS
INERNAIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 13, Number 4, Pages 525 544 c 216 Institute for Scientific Computing and Information WEAK GALERKIN FINIE ELEMEN MEHOD FOR SECOND ORDER PARABOLIC
More information1. Introduction. The Stokes problem seeks unknown functions u and p satisfying
A DISCRETE DIVERGENCE FREE WEAK GALERKIN FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU, JUNPING WANG, AND XIU YE Abstract. A discrete divergence free weak Galerkin finite element method is developed
More informationarxiv: v1 [math.na] 19 Dec 2017
Arnold-Winther Mixed Finite Elements for Stokes Eigenvalue Problems Joscha Gedicke Arbaz Khan arxiv:72.0686v [math.na] 9 Dec 207 Abstract This paper is devoted to study the Arnold-Winther mixed finite
More informationc 2008 Society for Industrial and Applied Mathematics
SIAM J. NUMER. ANAL. Vol. 46, No. 3, pp. 640 65 c 2008 Society for Industrial and Applied Mathematics A WEIGHTED H(div) LEAST-SQUARES METHOD FOR SECOND-ORDER ELLIPTIC PROBLEMS Z. CAI AND C. R. WESTPHAL
More informationR T (u H )v + (2.1) J S (u H )v v V, T (2.2) (2.3) H S J S (u H ) 2 L 2 (S). S T
2 R.H. NOCHETTO 2. Lecture 2. Adaptivity I: Design and Convergence of AFEM tarting with a conforming mesh T H, the adaptive procedure AFEM consists of loops of the form OLVE ETIMATE MARK REFINE to produce
More informationSuperconvergence of discontinuous Galerkin methods for 1-D linear hyperbolic equations with degenerate variable coefficients
Superconvergence of discontinuous Galerkin methods for -D linear hyperbolic equations with degenerate variable coefficients Waixiang Cao Chi-Wang Shu Zhimin Zhang Abstract In this paper, we study the superconvergence
More informationAn A Posteriori Error Estimate for Discontinuous Galerkin Methods
An A Posteriori Error Estimate for Discontinuous Galerkin Methods Mats G Larson mgl@math.chalmers.se Chalmers Finite Element Center Mats G Larson Chalmers Finite Element Center p.1 Outline We present an
More informationAn anisotropic, superconvergent nonconforming plate finite element
Journal of Computational and Applied Mathematics 220 (2008 96 0 www.elsevier.com/locate/cam An anisotropic, superconvergent nonconforming plate finite element Shaochun Chen a,liyin a, Shipeng Mao b, a
More informationEnergy norm a-posteriori error estimation for divergence-free discontinuous Galerkin approximations of the Navier-Stokes equations
INTRNATIONAL JOURNAL FOR NUMRICAL MTHODS IN FLUIDS Int. J. Numer. Meth. Fluids 19007; 1:1 [Version: 00/09/18 v1.01] nergy norm a-posteriori error estimation for divergence-free discontinuous Galerkin approximations
More informationA posteriori error estimation for elliptic problems
A posteriori error estimation for elliptic problems Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in
More informationA POSTERIORI ERROR ESTIMATES OF TRIANGULAR MIXED FINITE ELEMENT METHODS FOR QUADRATIC CONVECTION DIFFUSION OPTIMAL CONTROL PROBLEMS
A POSTERIORI ERROR ESTIMATES OF TRIANGULAR MIXED FINITE ELEMENT METHODS FOR QUADRATIC CONVECTION DIFFUSION OPTIMAL CONTROL PROBLEMS Z. LU Communicated by Gabriela Marinoschi In this paper, we discuss a
More informationMultilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, 751 05 Uppsala,
More informationarxiv: v1 [math.na] 19 Nov 2018
QUASINORMS IN SEMILINEAR ELLIPTIC PROBLEMS JAMES JACKAMAN AND TRISTAN PRYER arxiv:1811.07816v1 [math.na] 19 Nov 2018 (1.1) Abstract. In this note we examine the a priori and a posteriori analysis of discontinuous
More informationAdaptive methods for control problems with finite-dimensional control space
Adaptive methods for control problems with finite-dimensional control space Saheed Akindeinde and Daniel Wachsmuth Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy
More informationNumerical Simulations on Two Nonlinear Biharmonic Evolution Equations
Numerical Simulations on Two Nonlinear Biharmonic Evolution Equations Ming-Jun Lai, Chun Liu, and Paul Wenston Abstract We numerically simulate the following two nonlinear evolution equations with a fourth
More informationBasic Principles of Weak Galerkin Finite Element Methods for PDEs
Basic Principles of Weak Galerkin Finite Element Methods for PDEs Junping Wang Computational Mathematics Division of Mathematical Sciences National Science Foundation Arlington, VA 22230 Polytopal Element
More informationA posteriori error estimates for Maxwell Equations
www.oeaw.ac.at A posteriori error estimates for Maxwell Equations J. Schöberl RICAM-Report 2005-10 www.ricam.oeaw.ac.at A POSTERIORI ERROR ESTIMATES FOR MAXWELL EQUATIONS JOACHIM SCHÖBERL Abstract. Maxwell
More informationA P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS
A P4 BUBBLE ENRICHED P3 DIVERGENCE-FREE FINITE ELEMENT ON TRIANGULAR GRIDS SHANGYOU ZHANG DEDICATED TO PROFESSOR PETER MONK ON THE OCCASION OF HIS 6TH BIRTHDAY Abstract. On triangular grids, the continuous
More informationA BIVARIATE SPLINE METHOD FOR SECOND ORDER ELLIPTIC EQUATIONS IN NON-DIVERGENCE FORM
A BIVARIAE SPLINE MEHOD FOR SECOND ORDER ELLIPIC EQUAIONS IN NON-DIVERGENCE FORM MING-JUN LAI AND CHUNMEI WANG Abstract. A bivariate spline method is developed to numerically solve second order elliptic
More informationFinite Elements. Colin Cotter. February 22, Colin Cotter FEM
Finite Elements February 22, 2019 In the previous sections, we introduced the concept of finite element spaces, which contain certain functions defined on a domain. Finite element spaces are examples of
More informationPSEUDO-COMPRESSIBILITY METHODS FOR THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
PSEUDO-COMPRESSIBILITY METHODS FOR THE UNSTEADY INCOMPRESSIBLE NAVIER-STOKES EQUATIONS Jie Shen Department of Mathematics, Penn State University University Par, PA 1680, USA Abstract. We present in this
More informationOn an Approximation Result for Piecewise Polynomial Functions. O. Karakashian
BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results
More informationGraded Mesh Refinement and Error Estimates of Higher Order for DGFE-solutions of Elliptic Boundary Value Problems in Polygons
Graded Mesh Refinement and Error Estimates of Higher Order for DGFE-solutions of Elliptic Boundary Value Problems in Polygons Anna-Margarete Sändig, Miloslav Feistauer University Stuttgart, IANS Journées
More informationarxiv: v1 [math.na] 2 Sep 2015
The lower bound property of the Morley element eigenvalues arxiv:1509.00566v1 [math.na] Sep 015 Yidu Yang, Hao Li, Hai Bi School of Mathematics and Computer Science, Guizhou Normal University, Guiyang,
More informationSolutions of Selected Problems
1 Solutions of Selected Problems October 16, 2015 Chapter I 1.9 Consider the potential equation in the disk := {(x, y) R 2 ; x 2 +y 2 < 1}, with the boundary condition u(x) = g(x) r for x on the derivative
More informationFINITE ELEMENT APPROXIMATION OF ELLIPTIC DIRICHLET OPTIMAL CONTROL PROBLEMS
Numerical Functional Analysis and Optimization, 28(7 8):957 973, 2007 Copyright Taylor & Francis Group, LLC ISSN: 0163-0563 print/1532-2467 online DOI: 10.1080/01630560701493305 FINITE ELEMENT APPROXIMATION
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More information