on! 0, 1 and 2 In the Zienkiewicz-Zhu SPR p 1 and p 2 are obtained by solving the locally discrete least-squares p
|
|
- Rosamund Phelps
- 6 years ago
- Views:
Transcription
1 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 obtained by a class of patch recovery techniques for both linear and bilinear nite elements in the approximation of second order elliptic problems. Keywords: nite element, superconvergence patch recovery, least-squares, local projection, error estimate. AMS Subject Classications (1991): 65N15, 65N30. 1 Introduction Recently, Zienkiewicz and Zhu have developed a superconvergence patch recovery (SPR) technique for nite element approximations of second order elliptic problems [33, 34, 35]. It is a discrete version of a traditional post-processing technique by local L 2 projection. Both techniques can be described briey as follows. Let u h be a standard Galerkin nite element approximation of the exact solution u of a second order elliptic problem. Let ( 0 ; 0 ) be an interior nodal point surrounded by elements K 1 ; : : : ; K m of the underlying nite element mesh h of size h. Set! 0 = [ m K i. Suppose on each element K 2 h, u h belongs to the polynomial space P (K) which is the restriction on K of a xed polynomial space P. Now two polynomials p 1 ; p 2 2 P (! 0 ) are determined to approximate 1 u 2 u Department of Mathematics, University of California, Los Angeles, 405 Hilgard Avenue, Los Angeles, CA , U.S.A. bli@math.ucla.edu. The work of this author was supported by ARPA/URI/ONR through grant N J y Department of Mathematics, Texas Tech University, Lubbock, Texas 79409, U.S.A. zhang@math.ttu.edu. The work of this author was partially supported by the NSF through grants DMS , DMS and DMS
2 on! 0, 1 and 2 In the Zienkiewicz-Zhu SPR p 1 and p 2 are obtained by solving the locally discrete least-squares problems mx sx j=1 [p l ( ij ; ij l u h ( ij ; ij )] 2 = min mx sx q2p (! 0 ) j=1 [q( ij ; ij l u h ( ij ; ij )] 2 ; l = 1; 2; (1) where f( ij ; ij ) : j = 1; : : : ; sg is a set of points in K i for each i = 1; : : : ; m. In the traditional post-processing technique, p 1 and p 2 are the local L 2 projections onto P (! 0 ) 1 u h 2 u h, respectively, Z! 0 jp l (x; l u h (x; y)j 2 dxdy = min q2p (! 0 ) Z! 0 jq(x; l u h (x; y)j 2 dxdy; l = 1; 2: (2) Such p 1 and p 2 are often found to be superconvergent 1 u 2 u, respectively, on a set of points, S i, in each element K i ; i = 1; : : : ; m. Solve the equation (1) or (2) for all interior nodes of the mesh. If there are enough recovered superconvergence points on each element, we can then obtain by interpolation two globally continuous functions G 1 and G 2 whose restrictions on each element K 2 h are in P (K) such that G 1 and G 2 globally superconverge 1 u 2 u, respectively, except possibly a boundary layer of size h. We call (cf. [33, 34]) ( 0 ; 0 ) a patch assembly point,! 0 the element patch surrounding ( 0 ; 0 ), ( ij ; ij ); j = 1; : : : ; s, the least-squares sampling points of the element K i ; i = 1; : : : ; m, and the points in S i ; i = 1; : : : ; m, the recovered derivative superconvergent points. We also call p 1 ; p 2 2 P (! 0 ) the recovered derivatives by the locally discrete least-squares if the problem (1) is solved or the recovered derivatives by the local L 2 problem (2) is solved. projection if the Numerical experiments by Zienkiewicz and Zhu [33] have shown the derivative superconvergence for various types of nite elements by the locally discrete least-squares recovery but only for lower order nite elements by the local L 2 projection recovery. The ultraconvergence (superconvergence of order two) by the locally discrete least-squares recovery for quadratic or biquadratic elements discovered in these experiments has been interesting to mathematical studies. Practically, both of the recovery techniques are cost eective because of the locality of their treatment. Such techniques, especially the Zienkiewice-Zhu discrete least-squares based SPR, are also applicable to the design of a robust error estimator for 2
3 the adaptive nite element method because of its global superconvergence of the recovered derivatives [32, 34, 35]. We notice that a dierent kind of superconvergence recovery technique for nite element approximations based on correction by interpolation has been mathematically developed by Lin, Yan, Yang, and Zhou [15, 16, 17, 18, 19, 28, 29]. Both this interpolation based local correction technique and the least-squares based patch recovery technique are economic and practical, and both of them recover, in most practical cases, the global superconvergence. A common feature of these two classes of techniques is that the recovered derivatives of a nite element solution lie in a space of piecewise polynomials same as or even larger than that the solution itself lies in. We refer to the recent work [1, 2, 3, 4] for a series of studies in a computer based approach on the superconvergence for nite element approximations. Mathematical analysis for the superconvergence patch recovery techniques rst appear in [24, 26] for the recovered derivatives by the locally discrete least-squares for one-dimensional problems. Generalization to two-dimensional tensor product nite elements have been made in [25, 27]. In this paper, we consider both the locally discrete least-squares recovery and the local L 2 projection recovery for both triangular linear and rectangular bilinear nite element approximations of general second order elliptic problems on two-dimensional convex polygonal domains. We prove that the derivative superconvergence is achieved by both of the methods for the triangular linear element on strongly regular meshes, by the locally discrete least-squares recovery for the rectangular bilinear element on quasi-uniform meshes, and by the local L 2 projection recovery for the rectangular bilinear element on unidirectionally uniform meshes. We also give an example to strongly suggest that, for the local L 2 projection recovery by the rectangular bilinear element, the recovered derivatives will not be superconvergent if the underlying meshes are only quasi-uniform, a phenomenon that has been in fact numerically observed in [33]. The key argument in our proofs is based on an observation on the two recovery techniques as well as an exploitation of the earlier work of the mathematical analysis on the so-called natural superconvergence for the linear and bilinear nite elements, see, e.g., [5, 6, 10, 11, 12, 13, 14, 22, 23, 30, 31]. For a uniformly regular mesh, the idea of such an argument is clear and the proof is almost trivial. However, diculties arise when more general meshes are considered. We remark that we consider ane rectangular bilinear elements rather than general isoparametric quadrilateral bilinear elements. This is simply for the convenience of the 3
4 exposition of the main idea. The generalization can be easily made within our framework via the work by Lin and Whiteman [13], see also [8, 25]. In Section 2, we state our main results which include local superconvergence estimates that only involve the local smoothness of the exact solution and the local regularity of the mesh. In Section 3, we give proofs of our main results. In Section 4, we give an example in a one-dimensional setting concerning the local L 2 projection recovery. 2 Main Results For the simplicity of exposition, let be a convex polygonal domain in the xy-plane. We consider the following boundary value problem: (? P 2 j (a i u) + P 2 b i@ i u + cu = f; in ; u = 0; where a ij ; b i ; c, and f are suciently smooth functions dened on, and 2X i;j=1 for some constant a 0 > 0. a ij (x; y)d i d j a 0 d d 2 2 ; 8(d 1 ; d 2 ) 2 R 2 ; 8(x; y) 2 ; As usual, for an integer k 0 and an extended real number p with 1 p 1, W k;p () and W k;p 0 () are the Sobolev spaces over the domain, and k k k;p; and j j k;p; the corresponding norms and seminorms. If p = 2 we write H k () and H k 0 () instead of W k;2 () and W k;2 0 (), respectively. We dene the bilinear form A : H0() 1 H0() 1! R associated with the elliptic problem (3) by A(v; w) = Z 2 X i;j=1 a i v@ j w + 2X 1 b i vw + cvwa dxdy; 8v; w 2 H 1 0(); and assume that A is H 1 0()-elliptic, i.e., there exists a constant > 0 such that (3) A(v; v) kvk 1;2; ; 8v 2 H 1 0(): We let u 2 H 1 0() be the unique generalized solution of (3) which is dened by A(u; v) = (f; v); 8v 2 H 1 0(); where (; ) denotes the inner product of L 2 (). 4
5 Now let f h : 0 < h h 0 g, where h 0 is a positive constant, be a family of quasi-uniform nite element meshes parameterized by the mesh size h of h, covering the domain, i.e., = [ K2h K for each h 2 (0; h 0 ] [9]. We consider two cases. In the rst case, we assume that all elements of h (0 < h h 0 ) are triangles and we consider the ane linear nite element approximation. Thus, we dene for each h 2 (0; h 0 ] the nite element space to be V h = n v 2 C() : vj K 2 P 1 (K); 8K 2 h ; v = 0 o ; where P 1 (K) denotes the restriction on K of P 1, the space of all linear polynomials. In the second case, we assume that all elements of h (0 < h h 0 ) are rectangles with sides parallel to the coordinate axes, respectively, and we consider the ane bilinear nite element approximation. (We have implicitly assumed in this case that the boundary of is composed of line segments parallel to the coordinate axes. This in turn implies that is just a rectangular domain by its convexity.) Thus, we dene for each h 2 (0; h 0 ] the nite element space to be V h = n v 2 C() : vj K 2 Q 1 (K); 8K 2 h ; v = 0 o ; where Q 1 (K) denotes the restriction on K of Q 1, the space of all bilinear polynomials. In both cases, we have V h H 1 0(); 0 < h h 0. We also let u h 2 V h for each h 2 (0; h 0 ] be the unique nite element solution dened by A(u h ; v h ) = (f; v h ); 8v h 2 V h : Let us x h 2 (0; h 0 ] throughout the paper. The regularity of the mesh h will always be referred to that of the whole family of meshes containing h. As in Section 1, for an interior nodal point ( 0 ; 0 ) of h which is surrounded by elements K 1 ; : : : ; K m, we set the element patch! 0 = [ m K i. According to Zienkiewicz and Zhu [33], we choose the center of element K i, denoted by ( i ; i ), as the only sampling point of the element K i ; i = 1; : : : ; m, for both the linear and bilinear nite element approximations. For convenience, we dene in the sequel the polynomial space P = P 1 when considering the triangular linear element and P = Q 1 when considering the rectangular bilinear element. For the element patch! 0, we dene the recovered derivatives to be the polynomials p 1 ; p 2 equation (1) which becomes in the present setting mx [p l ( i ; i l u h ( i ; i )] 2 = min mx q2p (! 0 ) 2 P (! 0 ) that satisfy the [q( i ; i l u h ( i ; i )] 2 ; l = 1; 2; (4) 5
6 for the locally discrete least-squares recovery and that satisfy the equation (2) for the local L 2 projection recovery. In what follows, the symbol C will be used as a generic constant varying with the context and will be always assumed to be independent of the solution u, the mesh size h, and the element patch! 0, except the dependence is otherwise indicated. Our rst result is the existence and uniqueness of the recovered derivatives. Lemma 1 For any element patch! 0 = [ m K i surrounding a patch assembly point ( 0 ; 0 ), both the minimization problems (4) and (2) admit unique minimizers p 1 ; p 2 2 P (! 0 ). Moreover, p 1 and p 2 are characterized by mx [p l ( i ; i l u h ( i ; i )] q( i ; i ) = 0; 8q 2 P (! 0 ); l = 1; 2; (5) for the locally discrete least-squares recovery and by Z! 0 [p l (x; l u h (x; y)] q(x; y) dxdy = 0; 8q 2 P (! 0 ); l = 1; 2; (6) for the local L 2 projection recovery. We recall that a quasi-uniform triangular mesh is strongly regular if any two adjacent elements in the mesh form an approximate parallelogram in which the dierence of the two vectors corresponding to any two opposite sides of the parallelogram is bounded above by Ch 2, cf. [5, 6, 14, 31]. Obviously, a uniform triangular mesh is always strongly regular but the reverse is not true in general. Practically, strongly regular triangular meshes can cover domains such as convex quadrilaterals that can not be covered by uniform triangular meshes. The following theorem validates the recovered superconvergence by the triangular linear element. Theorem 1 Suppose that the solution u 2 H 1 0()\W 3;1 (). Suppose also that the triangular mesh h is strongly regular. Then, for any element patch! 0 = [ m K i surrounding a patch assembly point ( 0 ; 0 ), we have the following superconvergence estimate for the recovered derivatives p 1 ; p 2 2 P (! 0 ) = P 1 (! 0 ) dened by (4) or (2) jp l ( 0 ; 0 l u( 0 ; 0 )j Ch 2 jln hj kuk 3;1; ; l = 1; 2: (7) We recall that a quasi-uniform rectangular mesh covering a rectangular domain is called unidirectionally uniform if all parallel element edges in the mesh have the same length [7]. 6
7 Clearly, such a mesh is in fact a Cartesian product of two one-dimensional, uniform meshes along the x and y axes, respectively. The following theorem validates the recovered superconvergence by the rectangular bilinear element. Notice that, for the local L 2 projection recovery, we need the assumption that the underlying rectangular mesh is unidirectionally uniform. An example will be given in Section 4 to strongly suggest that such a stronger regularity assumption on the mesh can not be replaced by quasi-uniformity. Theorem 2 Suppose that the solution u 2 H0() 1 \ W 3;1 (). Suppose also that the rectangular mesh h is quasi-uniform when considering the locally discrete least-squares recovery and is unidirectionally uniform when considering the local L 2 projection recovery. Then, for any element patch! 0 = [ m K i surrounding a patch assembly point ( 0 ; 0 ), we have the following superconvergence estimate for the recovered derivatives p 1 ; p 2 2 P (! 0 ) = Q 1 (! 0 ) dened by (4) or (2) jp l ( 0 ; 0 l u( 0 ; 0 )j Ch 2 jln hj kuk 3;1; ; l = 1; 2: (8) Now let G 1 and G 2 be the two continuous functions that are piecewise linear or bilinear dened on the union of all interior elements of h by interpolating the two recovered derivatives at all assembly points, respectively. Directly from the above two theorems, we have the following result on the globally uniform superconvergence estimate on interior elements of h. Corollary 1 With the same hypothesis as in Theorem 1 and Theorem 2 on the smoothness of the solution u and the regularity of the mesh h, we have max jg l (x; l u(x; y)j Ch 2 jln hj kuk 3;1; ; l = 1; 2; (x;y)2k for any K 2 h such = ;. We now state the result of local estimate with regard to the local smoothness of the solution u and the local regularity of the mesh h. Theorem 3 Let 0 and 1 be two Lipschitz domains such that 0 1. Suppose that the solution u 2 H0() 1 \ W 3;1 ( 1 ). Suppose also that the triangular mesh h is quasi-uniform in and is strongly regular in 1. Then, for any element patch! 0 = [ m K i 7
8 surrounding a patch assembly point ( 0 ; 0 ) such that! 0 0, we have the following local superconvergence estimate for the recovered derivatives by the triangular linear element p 1 ; p 2 2 P (! 0 ) = P 1 (! 0 ) dened by (4) or (2) jp l ( 0 ; 0 l u( 0 ; 0 )j Ch 2 jln hj kuk 3;1;1 + kuk 1;2; ; l = 1; 2; where the constant C may depend on 0 and 1. Theorem 4 Let 0 and 1 be two Lipschitz domains such that 0 1. Suppose that the solution u 2 H 1 0() \ W 3;1 ( 1 ). Suppose also that the rectangular mesh h is quasiuniform in, and is unidirectionally uniform in 1 when considering the local L 2 projection recovery. Then, for any element patch! 0 = [ m K i surrounding a patch assembly point ( 0 ; 0 ) such that! 0 0, we have the following local superconvergence estimate for the recovered derivatives by the rectangular bilinear element p 1 ; p 2 2 P (! 0 ) = Q 1 (! 0 ) dened by (4) or (2) jp l ( 0 ; 0 l u( 0 ; 0 )j Ch 2 jln hj kuk 3;1;1 + kuk 1;2; ; l = 1; 2; where the constant C may depend on 0 and 1. A direct consequence of the above two theorems is the following result on the locally uniform superconvergence. Corollary 2 With the same hypothesis as in Theorem 3 and Theorem 4 on the domains 0 and 1, the smoothness of the solution u, and the regularity of the mesh h, we have max jg l (x; l u(x; y)j Ch 2 jln hj kuk 3;1;1 + kuk 1;2; ; l = 1; 2; (x;y)2k for any K 2 h such that K 0, where the constant C may depend on 0 and 1. 3 Proofs Proof of Lemma 1 We consider two cases. Case 1. The locally discrete least-squares recovery. Recall that ( i ; i ); i = 1; : : : ; m, are the centers of elements K i in the element patch! 0 = [ m j=1 K j surrounding the patch assembly point ( 0 ; 0 ). Notice that if q 2 P (! 0 ) satises q( i ; i ) = 0; i = 1; : : : ; m; 8
9 then q = 0 identically on! 0 for both the cases of approximations by the triangular linear element and by the rectangular bilinear element. Thus, the mapping q! kqk ( mx [q( i ; i )] 2 ) 1 2 denes a norm of the space P (! 0 ). With this norm the nonnegative functional F l : P (! 0 )! R dened for l = 1 or 2 by (cf. (4)) F l (q) = is obviously continuous. mx jq( i ; i l u h ( i ; i )j 2 ; q 2 P (! 0 ); (10) Moreover, F l (q)! 1 as kqk! 1. Therefore, the local compactness of the nite-dimensional space P (! 0 ) implies the existence of minimizers of F l on P (! 0 ). It is easy to verify that the second variation of F l satises 2 F l (q)(p; p) = 2kpk 2 > 0; 8q; p 2 P (! 0 ); p 6= 0: Consequently, the functional F l : P (! 0 )! R is strictly convex. This implies the uniqueness of the minimizer of F l on P (! 0 ). Now the unique minimizer p l 2 P (! 0 ) of F l on P (! 0 ) is characterized by F l (p l + tq)? F l (p l ) = kqk 2 t ( mx ) q( i ; i ) [p l ( i ; i l u h ( i ; i )] t 0 for any q 2 P (! 0 ) and any t 2 R. This is equivalent to (5). Case 2. The local L 2 projection recovery. The proof for this case can be proceeded similarly by using the L 2 (! 0 ) norm instead of the norm dened by (9) and by using the functional F l : P (! 0 )! R dened by (cf. (2)) F l (q) = Z! 0 jq(x; l u h (x; y)j 2 dxdy; q 2 P (! 0 ); (11) instead of that as dened in (10). The proof is complete. Remark By the same argument as in the above proof, we can easily generalize Lemma 1 to obtain the existence and uniqueness for the minimization problems (1) and (2) for any types of nite element approximations. However, for the problem (1) we need to choose all the 9 (9)
10 sampling points ( ij ; ij ) 2 K i (1 i m; 1 j s) in such a way that, for any q 2 P (! 0 ), we have q = 0 identically on! 0 whenever q = 0 at all these points ( ij ; ij ); 1 i m; 1 j s. To prove Theorem 1 we need the following result on the stability of recovered derivatives for the triangular nite element. Lemma 2 Suppose that the solution u 2 H0()\W 1 3;1 (). Suppose also that the triangular mesh h is quasi-uniform. For any element patch! 0 = [ m K i surrounding an assembly point ( 0 ; 0 ), let p 1 ; p 2 2 P (! 0 ) = P 1 (! 0 ) be the recovered derivatives dened by (4) or (2). Then, we have the stability estimate jrp l ( 0 ; 0 )j Ckuk 3;1; ; l = 1; 2: (12) Proof We consider two cases separately. Case 1. The locally discrete least-squares recovery. The mapping p! jrp( 0 ; 0 )j denes a seminorm on P 1 (! 0 ). Since P 1 (! 0 ) is nite-dimensional and the mesh h is quasiuniform, by an ane transformation from the patch! 0 to a reference patch ^! 0 with diameter of size O(1), we have the inverse estimate jrq( 0 ; 0 )j Ch?1 kqk; 8q 2 P 1 (! 0 ); (13) where k k is the norm on P 1 (! 0 ) dened by (9). Let L l 2 P 1 (! 0 ) be the linear part l u around the assembly point ( 0 ; 0 ): L l (x; y) l u( 0 ; 0 ) + r@ l u( 0 ; 0 ) (x? 0 ; y? 0 ); (x; y) 2! 0 : Obviously, rl l ( 0 ; 0 ) = r@ l u( 0 ; 0 ), and jl l (x; l u(x; y)j Ch 2 kuk 3;1;!0 ; 8(x; y) 2! 0 : (14) We thus have by (13) that jrp l ( 0 ; 0 )j jr(p l? L l )( 0 ; 0 )j + jrl l ( 0 ; 0 )j Ch?1 kp l? L l k + jr@ l u( 0 ; 0 )j : (15) Since p l 2 P 1 (! 0 ) is the minimizer of the functional F l : P 1 (! 0 )! R dened by (10) on P 1 (! 0 ), we have kp l? L l k 10
11 2 2 " 6 X " 6 X " 6 X jp l ( i ; i l u h ( i ; i )j 2 # jl l ( i ; i l u h ( i ; i )j 2 # 1 2 " 6 X jl l ( i ; i l u( i ; i )j 2 # j@ l u h ( i ; i )? L l ( i ; i )j 2 # 1 2 " 6 X j@ l u( i ; i l u h ( i ; i )j 2 # 1 2 Ch 2 jln hj kuk 3;1; ; (16) where in the last step we used (14) as well as the W 1;1 error estimate for the linear nite element approximation [9, 20]. The stability estimate (12) now follows from (15) and (16) in this case. Case 2. The local L 2 projection recovery. The proof of (12) in this case is similar to that in Case 1 except we replace the norm (9) by the L 2 (! 0 ) norm and the functional F l : P 1 (! 0 )! R dened by (10) by that dened by (11). The proof is complete. Now we are ready to prove Theorem 1. Proof of Theorem 1 Let u, ( 0 ; 0 ), K i, and! 0 = [ m K i be all the same as in the theorem. We may assume without loss of generality that m = 6, i.e., the patch! 0 consists of exactly six elements K i ; i = 1; : : : ; 6, since this is so with h suciently small by the strongly regular property of the triangular nite element mesh h. For i = 1; : : : ; 6, we assume that the element K i is adjacent to the element K i+1 and denote by ( i ; i ) the midpoint i i+1, the common edge of the two elements K i and K i+1, where we adopt the convention that two indices i 1 and i 2 are the same if and only if i 1 i 2 (mod 6). Fix l = 1 or 2. We have by the previous work [5, 6, 10, 12, 14, 23, 31] l u( i ; i )? 1 2 Since u h is piecewise linear on! 0 = [ 6 K i, we have which together with (17) leads to l u h j Ki ( i ; i ) l u h j Ki+1 ( i ; i ) i Ch 2 jln hj kuk 3;1; ; i = 1; : : : ; 6: (17) 1 h l u h j Ki ( i ; i ) l u h j Ki+1 ( i ; i ) = l u h ( i ; i ); [@ l u( i ; i l u h ( i ; i )] Ch2 jln hj kuk 3;1; : (18) 11
12 By the Taylor expansion we l u( i ; i ) l u( 0 ; 0 ) + r@ l u( 0 ; 0 ) [( i ; i )? ( 0 ; 0 )] + R i ; jr i j Ch 2 kuk 3;1;!0 ; i = 1; : : : ; 6: Since h is strongly regular, we also have Consequently, we have by (18) lu( 0 ; 0 )? [( i ; i )? ( 0 ; 0 )] Ch2 l u h ( i ; i ) [@ l u( i ; i l u h ( i ; i )] jr@ lu( 0 ; 0 )j [( i ; i )? ( 0 ; 0 )] Ch 2 jln hj kuk 3;1; : (19) Let F l : P (! 0 )! R be the functional as dened by (10) for the locally discrete leastsquares recovery and as dened by (11) for the local L 2 projection recovery. Since p l 2 P 1 (! 0 ) is the unique minimizer of F l by the assumption of the theorem, it satises the corresponding equation (5) or (6). We now consider two cases. Case 1. The locally discrete least-squares recovery. Taking q = 1 identically on! 0 in (5), we obtain in this case that p l ( i ; i ) = jr i l u h ( i ; i ): (20) By the strongly regular property of the triangular mesh h, we have Since p l is linear on! 0 in this case, we thus conclude that p l( 0 ; 0 )? 1 6 [( i ; i )? ( 0 ; 0 )] Ch2 : (21) i=6 p l ( i ; i ) 12
13 = 1 6 [p l ( 0 ; 0 )? p l (; i )] = 1 6 rp l( 0 ; 0 ) Ch 2 jrp l ( 0 ; 0 )j ; [( i ; i )? ( 0 ; 0 )] which together with (12), (20) and (19) implies (7) in this case. Case 2. The local L 2 q = 1 identically on! 0 in (6) that projection recovery. Since p l is linear on! 0, we have by taking jk i j p l ( i ; i ) = where we denote by j!j the measure of a measurable set!. jk i l u h ( i ; i ); (22) By the strongly regular property of the mesh h, we deduce easily that By the Taylor expansion we have Consequently, jk i j? 1 6 j! 0j Ch 3 ; i = 1; : : : ; 6: l u( i ; i ) l u( 0 ; 0 ) + r@ l u( 0 ; 0 ) ( i? 0 ; i? 0 ) + S i ; jk i j? 1 6 j! 0j = = js i j Ch 2 kuk 3;1;!0 ; i = 1; : : : ; l u( i ; i ) jk i j? 1 6 j! 0j jk i j? 1 6 j! 0j Ch 4 kuk 3;1;!0 : [@ l u( 0 ; 0 ) + r@ l u( 0 ; 0 ) ( i? 0 ; i? 0 ) + S i ] [r@ l u( 0 ; 0 ) ( i? 0 ; i? 0 ) + S i ] We thus have by (23) and the W 1;1 estimate for the linear nite element approximation [9, 20] that jk i j? 1 6 j! l u h ( i ; i ) 13
14 + This together with (19) leads to jk i j? 1 6 j! 0j jk i j? 1 6 j! 0j Ch 4 jln hj kuk 3;1; : j! l u( 0 ; 0 )? [@ l u h ( i ; i l u( i ; i l u( i ; i ) jk i l u h ( i ; i ) j! l u( 0 ; 0 )? 1 6 j! l u h ( i ; i ) + jk i j? 1 6 j! l u h ( i ; i ) Ch 4 jln hj kuk 3;1; : (24) Finally, we have by (23), (21) and the stability estimate (12) that j! 0j p l ( 0 ; 0 )? = j! 0j p l ( 0 ; 0 )? = rp l( 0 ; 0 ) jrp l ( 0 ; 0 )j jk i j p l ( i ; i ) jrp l( 0 ; 0 )j j! 0 j Ch 4 jrp l ( 0 ; 0 )j Ch 4 kuk 3;1; ; jk i j [p l ( 0 ; 0 ) + rp l ( 0 ; 0 ) ( i? 0 ; i? 0 )] jk i j ( i? 0 ; i? 0 ) jk i j? 1 6 j! 0j ( i? 0 ; i? 0 ) ( i? 0 ; i? 0 ) which together with (24) and the quasi-uniformity of the mesh implies (7) in this case. The proof is complete. Proof of Theorem 2 Let u, ( 0 ; 0 ), K i, and! 0 = [ m K i be all the same as in the theorem. Since the mesh h is a rectangular mesh, we have m = 4. Denoting again by ( i ; i ) 14
15 the center of the element K i, i = 1; : : : ; 4, we recall the superconvergence estimate in the present setting from the previous work [6, 10, 11, 13, 22, 31, 36] j@ l u( i ; i l u h ( i ; i )j Ch 2 jln hj kuk 3;1; ; i = 1; : : : ; 4: (25) Fix l = 1 or 2. Let F l : P (! 0 )! R be the functional as dened by (10) for the locally discrete least-squares recovery and as dened by (11) for the local L 2 projection recovery. Since p l 2 P 1 (! 0 ) is the unique minimizer of F l by the assumption of the theorem, it satises the corresponding equation (5) or (6). We now consider two cases. Case 1. The locally discrete least-squares recovery on a quasi-uniform rectangular mesh. For convenience, we number all the four elements in the element patch! 0 counterclockwise starting from the lower left one. Dene q i 2 Q 1 (! 0 ) for i = 1; : : : ; 4 by q i (x; y) = (?1) i+1 4 j! 0 j (x? i+2) (y? i+2 ) ; (x; y) 2! 0 ; where we adopt the convention that two indices i 1 and i 2 are the same if i 1 i 2 (mod 4). Since the four centers ( i ; i ) 2 K i ; i = 1; : : : ; 4, are vertices of a rectangle with its sides parallel to the coordinate axes, respectively, it is easy to verify that q i ( j ; j ) = ij ; i; j = 1; : : : ; 4. So, taking q = q j in (5), we get p l ( j ; j ) l u h ( j ; j ); j = 1; : : : ; 4: (26) Let h xi and h yi be the length of sides of K i along Ox and Oy coordinate directions, respectively, i.e., h xi = 2 j 0? i j ; h yi = 2 j 0? i j ; i = 1; : : : ; 4: We have by an easy calculation that Therefore, q( 0 ; 0 ) = q i ( 0 ; 0 ) = h x i+2h y i+2 ; i = 1; : : : ; 4: j! 0 j = 1 j! 0 j q( i ; i )q i ( 0 ; 0 ) h x i+2 h y i+2 q( i ; i ); 8q 2 Q 1 (! 0 ): (27) 15
16 Now let B l 2 Q 1 (! 0 ) be the bilinear part l u on! 0 around the assembly point ( 0 ; 0 ): B l (x; y) l u( 0 ; 0 ) + r@ l u( 0 ; 0 ) (x? 0 ; y? 0 ) +@ l u( 0 ; 0 )(x? 0 )(y? 0 ); (x; y) 2! 0 : Obviously, B l ( 0 ; 0 ) l u( 0 ; 0 ), and jb l (x; l u(x; y)j Ch 2 kuk 3;1;!0 ; 8(x; y) 2! 0 : (28) Therefore, using the expression (27) for p l and B l, respectively, we have by (26), (25), and (28) that jp l ( 0 ; 0 l u( 0 ; 0 )j = jp l ( 0 ; 0 )? B l u( 0 ; 0 )j = 1 j! 0 j h x i+2 h y i+2 [p l ( i ; i )? B l ( i ; i )] j@ l u h ( i ; i l u( i ; i )j + j@ l u( i ; i )? B l ( i ; i )j Ch 2 jln hj kuk 3;1; ; proving (8) in this case. Case 2. The local L 2 projection recovery on a unidirectionally uniform rectangular mesh. We have in this special case that jk i j = 1j! 4 0j for i = 1; : : : ; 4. Setting q = 1 identically on! 0 in (6) with m = 4 and P = Q 1, by the fact that p l is bilinear and u h piecewise bilinear, we obtain that p l ( i ; i ) = By a simple calculation we also have that q( 0 ; 0 ) = 1 4 It therefore follows from (29), (28) and (25) that jp l ( 0 ; 0 l u( 0 ; 0 )j = jp l ( 0 ; 0 )? B l ( 0 ; 0 )j = 1 4 p l ( i ; i l u h ( i ; i ): (29) q( i ; i ); 8q 2 Q 1 (! 0 ): B l ( i ; i ) 16
17 j@ l u h ( i ; i )? B l ( i ; i )j j@ l u h ( i ; i l u( i ; i )j Ch 2 jln hj kuk 3;1; ; which implies (8) in this case. The proof is nished. Proofs of Theorem 3 and Theorem 4 j@ l u( i ; i )? B l ( 0 ; 0 )j Since is a convex polygonal domain, we have the usual negative norm estimate for the nite element approximation (cf. e.g., [22]) ku? u h k?1;2; Ch 2 kuk 1;2; : Therefore, under the assumption of the theorems, we have the local W 1;1 estimate [6, 21, 22, 31] ku? u h k Ch 2 jln hj (kuk 2;1;1 + kuk 1;2; ) : (30) Since the element patch! 0 = [ m K i 0, the stability estimate (12) becomes now jrp l ( 0 ; 0 )j C (kuk 2;1;1 + kuk 1;2; ) ; l = 1; 2: (31) Further, the superconvergence estimates (17) and (25) become respectively [6, 21, 22, 23, 30, 31] and h l u( i ; i )? 2 l u h j Ki ( i ; i ) l u h j Ki+1 ( i ; i ) Ch 2 jln hj (kuk 2;1;1 + kuk 1;2; ) ; i = 1; : : : ; 6; (32) j@ l u( i ; i l u h ( i ; i )j Ch 2 jln hj (kuk 2;1;1 + kuk 1;2; ) ; i = 1; : : : ; 4: (33) Using (30) { (33), we can obtain the desired local superconvergence estimates by repeating the corresponding proofs of Theorem 1 and Theorem 2. 4 An Example In this section, we give a simple example to show that in the one-dimensional space the quasiuniformity of a mesh is in general not sucient to result in the derivative superconvergence 17
18 by the local L 2 projection recovery. It also strongly suggests that in the two-dimensional space the derivative superconvergence will not be recovered in general by the rectangular bilinear element using the local L 2 quasi-uniform, cf., the numerical experiments reported in [33]. We consider the two-point boundary value problem (?u 00 = f; in (0; 1); u(0) = u(1) = 0; projection if the underlying rectangular mesh is only where f 2 L 2 (0; 1). Let u be the exact solution of (34) and assume that u is smooth enough on [0; 1]. Let h : 0 = x 0 < x 1 < < x N (34) = 1 be an arbitrary mesh of the interval [0; 1], where h = maxfh i : 1 i Ng and h i = x i? x i?1 ; i = 1; : : : ; N. Denote by V h the corresponding linear nite element space: V h = n v h 2 H 1 0(0; 1) : v h j (xi?1;x i ) 2 P 1 (x i?1 ; x i ); i = 1; : : : ; N where P 1 denotes the space of all linear, one-variable polynomials. Let u h 2 V h be the nite element approximation of the exact solution u dened by Z 1 0 (u 0? u 0 h) v 0 h dx = 0; 8v h 2 V h : (35) Let I h u 2 V h be the Lagrange interpolant of u dened by o ; For any v h 2 V h, we have by (35) that Z 1 0 I h u(x i ) = u(x i ); i = 0; 1; : : : ; N: Z (u h? I h u) 0 v 0 h dx = 1 (u? I h u) 0 v 0 h dx = NX Z xi x i?1 0 (u? I h u) 0 v 0 h dx = N X (u? I h u) v 0 hj x i x i?1 = 0: Setting v h = u h? I h u, we obtain by the constraint of zero boundary value that in this case u h = I h u identically on [0; 1]. Now we consider an element patch! i = (x i?1 ; x i+1 ) surrounding the assembly point x i (1 i N? 1). Let p 2 P 1 (x i?1 ; x i+1 ) be the recovered derivative by the local L 2 projection which is determined by (cf. Lemma 1) Z xi+1 x i?1 (p? u 0 h) q dx = 0; 8q 2 P 1 (x i?1 ; x i+1 ): 18
19 Assuming that p(x) = a 0 + a 1 (x? x i ) for x 2 (x i?1 ; x i+1 ), where a 0 and a 1 are constants, we obtain since u h = I h u that Z xi+1 x i?1 h a 0 + a 1 (x? x i )? (I h u) 0i q dx = 0; 8q 2 P 1 (x i?1 ; x i+1 ): Setting q(x) = 1 and q(x) = x? x i, respectively, we have by a series of calculation that h 2 i+1? h 2 i a 1 = u i+1? u i?1 ; 1 2 (h i + h i+1 ) a h 2 i+1? h 2 i a h 3 i + h 3 i+1 a 1 = 1 2 h i+1 (u i+1? u i )? 1 2 h i (u i? u i?1 ) ; where we recall h j = x j? x j?1 ; j = 1; : : : ; N; and we denote u j = u(x j ) for j = 0; 1; : : : ; N. Notice that p(x i ) = a 0. So, we need only to nd a 0. Solving the above two equations, we obtain that a 0 = By the Taylor expansion we have for some x i+1 2 [x i ; x i+1 ], and 1 h (ui+1? u (h i + h i+1 ) 3 i ) 4h 2 i + h 2 i+1? h i h i+1 + (u i? u i?1 ) 4h 2 i+1 + h 2 i? h i h i+1 i : u i+1 = u i + h i+1 u 0 (x i ) h2 i+1 u00 (x i ) h3 i+1 u000 (x i+1 ) u i?1 = u i? h i u 0 (x i ) h2 i u00 (x i )? 1 6 h3 i u000 (x i ) for some x i 2 [x i?1 ; x i ]. Consequently, we have by a series of calculation that p(x i )? u 0 (x i ) = a 0? u 0 (x i ) = h 3 i + h 3 i+1 2 (h i + h i+1 ) 3 (h i+1? h i ) u 00 (x i ) + r i with It is easy to verify that jr i j 1 6 (h i + h i+1 ) 2 max x i?1xx i+1 ju 000 (x)j : 1 8 h 3 i + h 3 i+1 2 (h i + h i+1 ) : Therefore, to recover the derivative superconvergence at all assembly points x i by the local L 2 projection, we need to have the condition that jh i+1? h i j = O(h 2 ) for all i = 1; : : : ; N?1. 19
20 This is, however, certainly much stronger than the quasi-uniformity condition which only guarantees in general that jh i+1? h i j = O(h) for all i = 1; : : : ; N? 1. Acknowledgment. The authors thank Dr. J. Z. Zhu for drawing their attention to the subject of mathematical analysis on the Zienkiewicz-Zhu discrete least-squares based superconvergence patch recovery technique. References [1] I. Babuska, T. Strouboulis, S. K. Gangaraj, and C. S. Upadhyay. -superconvergence in the interior of locally rened meshes of quadrilaterals: Superconvergence of the gradient in nite element solutions of Laplace's and Poisson's equations. J. Appl. Numer. Math., 16:3{49, [2] I. Babuska, T. Strouboulis, S. K. Gangaraj, and C. S. Upadhyay. Validation of recipes for the recovery of stresses and derivatives by a computer-based approach. Math. Comput. Modelling, 20:45{89, [3] I. Babuska, T. Strouboulis, and C. S. Upadhyay. -superconvergence of nite element approximations in the interior of general meshes of triangles. Comput. Methods Appl. Mech. Eng., 122:273{305, [4] I. Babuska, T. Strouboulis, C. S. Upadhyay, and S. K. Gangaraj. Computer-based proof of the existence of superconvergence points in the nite element method: superconvergence of derivatives in nite element solutions of Laplace's, Poisson's, and the elasticity equations. Numer. Methods for PDEs, 12:347{392, [5] C. M. Chen. Optimal points of the stresses for triangular linear elements. Numer. Anal. J. Chinese Univ., 2:12{20, 1980 (in Chinese). [6] C. M. Chen and Y. Q. Huang. High Accuracy Theory of Finite Element Methods. Hunan Science Press, Hunan, China, 1995 (in Chinese). [7] H. S. Chen and B. Li. Superconvergence analysis and error expansion for the Wilson nonconforming nite element. Numer. Math., 69:125{140, [8] H. S. Chen and Q. Lin. Extrapolation for isoparametric bilinear nite element approximation on smooth bounded domains. J. Syst. Sci. Math., 2:127{140,
21 [9] P. G. Ciarlet. Basic error estimates for elliptic problems. In P. G. Ciarlet and J. L. Lions, editors, Handbook of Numerical Analysis, Vol. II, Finite element methods (Part 1), pages 17{351. Elsevier Science Publishers, [10] M. Krizek and P. Neittaanmaki. On superconvergence techniques. Acta Appl. Math., 9:175{198, [11] P. Lesaint and M. Zlamal. Superconvergence of the gradient of nite element solutions. RAIRO Model. Math. Anal. Numer., 13:139{166, [12] N. D. Levine. Superconvergent recovery of the gradient from piecewise linear nite element approximations. IMA J. Numer. Anal., 5:407{427, [13] Q. Lin and J. R. Whiteman. Superconvergence of recovered gradients of nite element approximations on nonuniform rectangular and quadrilateral meshes. In J. R. Whiteman, editor, The Mathematics of Finite Elements and Applications VII, pages 563{571. Academic Press, [14] Q. Lin and J. Xu. Linear nite elements with high accuracy. J. Comp. Math., 3:115{133, [15] Q. Lin, N. Yan, and A. Zhou. A rectangle test for interpolated nite elements. In Proc. of Sys. Sci. & Sys. Eng., pages 217{229, Hong Kong, Great Wall Culture Publish. Co. [16] Q. Lin and Y. D. Yang. Interpolation and correction of nite elements. Math. Practice & Theory, 3:17{28, 1991 (in Chinese). [17] Q. Lin and Y. D. Yang. The nite element interpolated correction method for elliptic eigenvalue problems. Math. Numer. Sinica, 3:334{338, 1992 (in Chinese). [18] Q. Lin and A. Zhou. Notes on superconvergence and its related topics. J. Comp. Math., 11(3):211{214, [19] Q. Lin and Q. D. Zhu. The Preprocessing and Postprocessing for the Finite Element method. Shanghai Scientic & Technical Publishers, Shanghai, China, 1994 (in Chinese). [20] J. A. Nitsche. L 1 -convergence of nite element approximations. In I. Galligani and E. Magenes, editors, Mathematical Aspects of Finite Element Methods, volume 606 of Lecture Notes in Mathematics, pages 261{274, Springer, Berlin,
22 [21] L. B. Wahlbin. Local behavior in nite element methods. In P. G. Ciarlet and J. L. Lions, editors, Handbook of Numerical Analysis, Vol. II, Finite element methods (Part 1), pages 353{522. Elsevier Science Publishers, [22] L. B. Wahlbin. Superconvergence in Galerkin Finite Element Methods, volume 1605 of Lecture Notes in Mathematics. Springer, Berlin, [23] M. F. Wheeler and J. R. Whiteman. Superconvergent recovery of gradients on subdomains from piecewise linear nite element approximations. Numer. Methods for PDEs, 3:65{82, [24] Z. Zhang. Ultraconvergence of the patch recovery technique. Math. Comp., 65:1431{ 1437, [25] Z. Zhang and H. D. Victory Jr. Mathematical analysis of Zienkiewicz-Zhu's derivative patch recovery technique for quadrilateral nite elements. Numer. Methods for PDEs., 12:507{524, [26] Z. Zhang and J. Z. Zhu. Analysis of the superconvergent patch recovery technique and a posteriori error estimator in the nite element method (I). Comput. Methods Appl. Mech. Eng., 123:173{187, [27] Z. Zhang and J. Z. Zhu. Superconvergence of the derivative patch recovery technique and a posteriori error estimation. In I. Babuska, J. E. Flaherty, J. E. Hopcroft, W. D. Henshaw, J. E. Oliger, and T. Tezduyar, editors, Modeling, mesh generation, and adaptive numerical methods for partial dierential equations, pages 431{450, Minneapolis, Springer-Verlag, New York. [28] A. Zhou. Global superconvergence approximations of the mixed nite element method for the stokes problem and the linear elasticity equation. Math. Modeling and Numer. Anal., 30(4):401{411, [29] A. Zhou and J. Li. The full approximation accuracy for the stream function-vorticitypressure method. Numer. Math., 68:427{435, [30] Q. D. Zhu. Natural inner superconvergence for the nite element method. In K. Feng and J. L. Lions, editors, Proceedings of China-France Symposium on Finite Element Methods, pages 935{960, Beijing, Gordon and Breach, New York. 22
23 [31] Q. D. Zhu and Q. Lin. Superconvergence Theory of the Finite Element Method. Hunan Science Press, Hunan, China, 1989 (in Chinese). [32] O. C. Zienkiewicz and J. Z. Zhu. A simple error estimator and the adaptive procedure for practical engineering analysis. Int. J. Numer. Methods Eng., 24:337{357, [33] O. C. Zienkiewicz and J. Z. Zhu. The superconvergence patch recovery and a posteriori error estimates. Part 1: The recovery technique. Int. J. Numer. Methods Engrg., 33:1331{1364, [34] O. C. Zienkiewicz and J. Z. Zhu. The superconvergence patch recovery and a posteriori error estimates. Part 2: Error estimates and adaptivity. Int. J. Numer. Methods Engrg., 33:1365{1382, [35] O. C. Zienkiewicz and J. Z. Zhu. The superconvergence patch recovery (SPR) and adaptive nite element renement. Comput. Methods Appl. Mech. Engrg., 101:207{224, [36] M. Zlamal. Superconvergence and reduced integration in the nite element method. Math. Comp., 32:663{685,
Ultraconvergence 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 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 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 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 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 informationA mixed nite volume element method based on rectangular mesh for biharmonic equations
Journal of Computational and Applied Mathematics 7 () 7 3 www.elsevier.com/locate/cam A mixed nite volume element method based on rectangular mesh for biharmonic equations Tongke Wang College of Mathematical
More informationIt is known that Morley element is not C 0 element and it is divergent for Poisson equation (see [6]). When Morley element is applied to solve problem
Modied Morley Element Method for a ourth Order Elliptic Singular Perturbation Problem Λ Wang Ming LMAM, School of Mathematical Science, Peking University Jinchao u School of Mathematical Science, Peking
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 informationPolynomial Preserving Recovery for Quadratic Elements on Anisotropic Meshes
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
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 informationA Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract
A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin
More informationA MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY
A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,
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 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 informationMIXED FINITE ELEMENT METHODS FOR PROBLEMS WITH ROBIN BOUNDARY CONDITIONS
MIXED FINITE ELEMENT METHODS FOR PROBLEMS WITH ROBIN BOUNDARY CONDITIONS JUHO KÖNNÖ, DOMINIK SCHÖTZAU, AND ROLF STENBERG Abstract. We derive new a-priori and a-posteriori error estimates for mixed nite
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 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 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 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 informationThe Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 29, 1999 Abstract This paper deals with the construction of wavelet approximatio
The Mortar Wavelet Method Silvia Bertoluzza Valerie Perrier y October 9, 1999 Abstract This paper deals with the construction of wavelet approximation spaces, in the framework of the Mortar method. We
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 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 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 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 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 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 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 informationSUPERCONVERGENCE PROPERTIES FOR OPTIMAL CONTROL PROBLEMS DISCRETIZED BY PIECEWISE LINEAR AND DISCONTINUOUS FUNCTIONS
SUPERCONVERGENCE PROPERTIES FOR OPTIMAL CONTROL PROBLEMS DISCRETIZED BY PIECEWISE LINEAR AND DISCONTINUOUS FUNCTIONS A. RÖSCH AND R. SIMON Abstract. An optimal control problem for an elliptic equation
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 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 informationPREPRINT 2010:25. Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO
PREPRINT 2010:25 Fictitious domain finite element methods using cut elements: II. A stabilized Nitsche method ERIK BURMAN PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS
More informationMULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 217 221 217 MULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES N. CRAINIC Abstract. In this paper we study the relevance
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 informationConvergence of The Multigrid Method With A Wavelet. Abstract. This new coarse grid operator is constructed using the wavelet
Convergence of The Multigrid Method With A Wavelet Coarse Grid Operator Bjorn Engquist Erding Luo y Abstract The convergence of the two-level multigrid method with a new coarse grid operator is studied.
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 informationarxiv: 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 informationTHE BEST L 2 NORM ERROR ESTIMATE OF LOWER ORDER FINITE ELEMENT METHODS FOR THE FOURTH ORDER PROBLEM *
Journal of Computational Mathematics Vol.30, No.5, 2012, 449 460. http://www.global-sci.org/jcm doi:10.4208/jcm.1203-m3855 THE BEST L 2 NORM ERROR ESTIMATE OF LOWER ORDER FINITE ELEMENT METHODS FOR THE
More informationarxiv: v1 [math.na] 15 Nov 2017
Noname manuscript No. (will be inserted by the editor) An HDG method with orthogonal projections in facet integrals Issei Oikawa arxiv:1711.05396v1 [math.na] 15 Nov 2017 Received: date / Accepted: date
More informationLECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES. Sergey Korotov,
LECTURE 1: SOURCES OF ERRORS MATHEMATICAL TOOLS A PRIORI ERROR ESTIMATES Sergey Korotov, Institute of Mathematics Helsinki University of Technology, Finland Academy of Finland 1 Main Problem in Mathematical
More informationNumerical Integration for Multivariable. October Abstract. We consider the numerical integration of functions with point singularities over
Numerical Integration for Multivariable Functions with Point Singularities Yaun Yang and Kendall E. Atkinson y October 199 Abstract We consider the numerical integration of functions with point singularities
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 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 informationquantitative information on the error caused by using the solution of the linear problem to describe the response of the elastic material on a corner
Quantitative Justication of Linearization in Nonlinear Hencky Material Problems 1 Weimin Han and Hong-ci Huang 3 Abstract. The classical linear elasticity theory is based on the assumption that the size
More informationPointwise convergence rate for nonlinear conservation. Eitan Tadmor and Tao Tang
Pointwise convergence rate for nonlinear conservation laws Eitan Tadmor and Tao Tang Abstract. We introduce a new method to obtain pointwise error estimates for vanishing viscosity and nite dierence approximations
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 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 informationStudies on Barlow points, Gauss points and Superconvergent points in 1D with Lagrangian and Hermitian finite element basis
Volume 7, N., pp. 75 0, 008 Copyright 008 SBMAC ISSN 0101-805 www.scielo.br/cam Studies on Barlow points, Gauss points and Superconvergent points in 1D with Lagrangian and Hermitian finite element basis
More informationConstruction of `Wachspress type' rational basis functions over rectangles
Proc. Indian Acad. Sci. (Math. Sci.), Vol. 110, No. 1, February 2000, pp. 69±77. # Printed in India Construction of `Wachspress type' rational basis functions over rectangles P L POWAR and S S RANA Department
More informationarxiv: v1 [math.na] 27 Jan 2016
Virtual Element Method for fourth order problems: L 2 estimates Claudia Chinosi a, L. Donatella Marini b arxiv:1601.07484v1 [math.na] 27 Jan 2016 a Dipartimento di Scienze e Innovazione Tecnologica, Università
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 information1 Discretizing BVP with Finite Element Methods.
1 Discretizing BVP with Finite Element Methods In this section, we will discuss a process for solving boundary value problems numerically, the Finite Element Method (FEM) We note that such method is a
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods
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 informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
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 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 informationNumerical methods for PDEs FEM convergence, error estimates, piecewise polynomials
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Dr. Noemi Friedman Contents of the course Fundamentals
More informationOn the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
Computers and Mathematics with Applications 55 (2008) 2227 2233 www.elsevier.com/locate/camwa On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions Jan Brandts
More informationWEAK GALERKIN FINITE ELEMENT METHODS ON POLYTOPAL MESHES
INERNAIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 12, Number 1, Pages 31 53 c 2015 Institute for Scientific Computing and Information WEAK GALERKIN FINIE ELEMEN MEHODS ON POLYOPAL MESHES LIN
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 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 informationConvergence of A Galerkin Method for 2-D Discontinuous Euler Flows Jian-Guo Liu 1 Institute for Physical Science andtechnology and Department of Mathe
Convergence of A Galerkin Method for 2-D Discontinuous Euler Flows Jian-Guo Liu 1 Institute for Physical Science andtechnology and Department of Mathematics University of Maryland College Park, MD 2742
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 informationWALTER LITTMAN BO LIU kind of problem is related to the deformation of a membrane with strings attached to several sides of the polygon. In other word
THE REGULARITY AND SINGULARITY OF SOLUTIONS OF CERTAIN ELLIPTIC PROBLEMS ON POLYGONAL DOMAINS Walter Littman Bo Liu School of Math., University of Minnesota, Minneapolis, MN55455 Abstract. The regularity
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 informationChapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method
Chapter 3 Conforming Finite Element Methods 3.1 Foundations 3.1.1 Ritz-Galerkin Method Let V be a Hilbert space, a(, ) : V V lr a bounded, V-elliptic bilinear form and l : V lr a bounded linear functional.
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationPREPRINT 2010:23. A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO
PREPRINT 2010:23 A nonconforming rotated Q 1 approximation on tetrahedra PETER HANSBO Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG
More informationLocal Mesh Refinement with the PCD Method
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 1, pp. 125 136 (2013) http://campus.mst.edu/adsa Local Mesh Refinement with the PCD Method Ahmed Tahiri Université Med Premier
More informationLocal flux mimetic finite difference methods
Local flux mimetic finite difference methods Konstantin Lipnikov Mikhail Shashkov Ivan Yotov November 4, 2005 Abstract We develop a local flux mimetic finite difference method for second order elliptic
More informationFinite element approximation on quadrilateral meshes
COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2001; 17:805 812 (DOI: 10.1002/cnm.450) Finite element approximation on quadrilateral meshes Douglas N. Arnold 1;, Daniele
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 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 informationXIAO-CHUAN CAI AND MAKSYMILIAN DRYJA. strongly elliptic equations discretized by the nite element methods.
Contemporary Mathematics Volume 00, 0000 Domain Decomposition Methods for Monotone Nonlinear Elliptic Problems XIAO-CHUAN CAI AND MAKSYMILIAN DRYJA Abstract. In this paper, we study several overlapping
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 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 informationLecture Notes: African Institute of Mathematics Senegal, January Topic Title: A short introduction to numerical methods for elliptic PDEs
Lecture Notes: African Institute of Mathematics Senegal, January 26 opic itle: A short introduction to numerical methods for elliptic PDEs Authors and Lecturers: Gerard Awanou (University of Illinois-Chicago)
More informationAn explicit nite element method for convection-dominated compressible viscous Stokes system with inow boundary
Journal of Computational and Applied Mathematics 156 (2003) 319 343 www.elsevier.com/locate/cam An explicit nite element method for convection-dominated compressible viscous Stokes system with inow boundary
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 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 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 informationt x 0.25
Journal of ELECTRICAL ENGINEERING, VOL. 52, NO. /s, 2, 48{52 COMPARISON OF BROYDEN AND NEWTON METHODS FOR SOLVING NONLINEAR PARABOLIC EQUATIONS Ivan Cimrak If the time discretization of a nonlinear parabolic
More informationDiscrete Maximum Principle for a 1D Problem with Piecewise-Constant Coefficients Solved by hp-fem
The University of Texas at El Paso Department of Mathematical Sciences Research Reports Series El Paso, Texas Research Report No. 2006-10 Discrete Maximum Principle for a 1D Problem with Piecewise-Constant
More informationAn additive average Schwarz method for the plate bending problem
J. Numer. Math., Vol. 10, No. 2, pp. 109 125 (2002) c VSP 2002 Prepared using jnm.sty [Version: 02.02.2002 v1.2] An additive average Schwarz method for the plate bending problem X. Feng and T. Rahman Abstract
More informationError estimates for the Raviart-Thomas interpolation under the maximum angle condition
Error estimates for the Raviart-Thomas interpolation under the maximum angle condition Ricardo G. Durán and Ariel L. Lombardi Abstract. The classical error analysis for the Raviart-Thomas interpolation
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 Priori Error Analysis for Space-Time Finite Element Discretization of Parabolic Optimal Control Problems
A Priori Error Analysis for Space-Time Finite Element Discretization of Parabolic Optimal Control Problems D. Meidner and B. Vexler Abstract In this article we discuss a priori error estimates for Galerkin
More informationAn Optimal Finite Element Mesh for Elastostatic Structural. Analysis Problems. P.K. Jimack. University of Leeds. Leeds LS2 9JT, UK.
An Optimal Finite Element Mesh for Elastostatic Structural Analysis Problems P.K. Jimack School of Computer Studies University of Leeds Leeds LS2 9JT, UK Abstract This paper investigates the adaptive solution
More informationarxiv: v1 [math.na] 27 Jan 2016
Virtual Element Method for fourth order problems: L 2 estimates Claudia Chinosi a, L. Donatella Marini b arxiv:1601.07484v1 [math.na] 27 Jan 2016 a Dipartimento di Scienze e Innovazione Tecnologica, Università
More informationParallel Galerkin Domain Decomposition Procedures for Parabolic Equation on General Domain
Parallel Galerkin Domain Decomposition Procedures for Parabolic Equation on General Domain Keying Ma, 1 Tongjun Sun, 1 Danping Yang 1 School of Mathematics, Shandong University, Jinan 50100, People s Republic
More informationThe Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods
The Closed Form Reproducing Polynomial Particle Shape Functions for Meshfree Particle Methods by Hae-Soo Oh Department of Mathematics, University of North Carolina at Charlotte, Charlotte, NC 28223 June
More informationwhere error indicators are small. An ideal a posteriori error estimation techniques would (i) be asymptotically correct in the sense that the error es
A POSTERIORI ERROR ESTIMATION FOR THE FINITE ELEMENT METHOD-OF-LINES SOLUTION OF PARABOLIC PROBLEMS SLIMANE ADJERID and JOSEPH E. FLAHERTY Department of Computer Science and Scientic Computation Research
More informationA priori error analysis of the BEM with graded meshes for the electric eld integral equation on polyhedral surfaces
A priori error analysis of the BEM with graded meshes for the electric eld integral equation on polyhedral surfaces A. Bespalov S. Nicaise Abstract The Galerkin boundary element discretisations of the
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 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 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 informationError estimates for moving least square approximations
Applied Numerical Mathematics 37 (2001) 397 416 Error estimates for moving least square approximations María G. Armentano, Ricardo G. Durán 1 Departamento de Matemática, Facultad de Ciencias Exactas y
More informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
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 information