1 Introduction
In this note, similar to [1], we will consider the following Poisson equation
(1)  
(2) 
as the model problem, where is a polygonal domain in . The variational formulation of the Poisson problem (1)(2) is to seek such that
(3) 
A stabilizer free weak Galerkin finite element method is proposed by Ye and Zhang in [1] as a new method for the solution of Poisson equation on polytopal meshes in 2D or 3D. Let be the degree of polynomials for the calculation of weak gradient. It has been proved in [1] that there is a so that the SFWG method converges with optimal order of convergence for any . However, when is too large, the magnitude of the weak gradient can be extremely large, causing numerical instability. In this note, we provide the optimal to improve the efficiency and avoid unnecessary numerical difficulties, which has mathematical and practical interests.
2 Weak Galerkin Finite Element Schemes
Let be a partition of the domain consisting of polygons in 2D. Suppose that is shape regular in the sense defined by (2.7)(2.8) and each is convex. Let be the set of all edges in , and let be the set of all interior edges. For each element , denote by the diameter of , and the mesh size of .
On , let be the space of all polynomials with degree no greater than . Let be the weak Galerkin finite element space associated with defined as follows:
(4) 
where is a given integer. In this instance, the component symbolizes the interior value of , and the component symbolizes the edge value of on each and , respectively. Let be the subspace of defined as:
(5) 
For any the weak gradient is defined on as the unique polynomial satisfying
(6) 
where
is the unit outward normal vector of
.For simplicity, we adopt the following notations,
For any and in , we define the bilinear forms as follows:
(7) 
Stabilizer free Weak Galerkin Algorithm 1
Accordingly, for any , we define an energy norm on as:
(9) 
An norm on is defined as:
The following well known lemma and corollary will be needed in proving our main result. Suppose that are convex regions in such that can be obtain by scaling with a factor . Then for any ,
where depends only on .
Corollary 2.1
The following Theorem shows that for certain , whenever , is equivalent to the defined in (9), which is crucial in establishing the feasibility of SFWG. Later on, we will show that is optimal. (cf.[1], Lemma 3.1) Suppose that is convex with at most edges and satisfies the following regularity conditions: for all edges and of
(10) 
for any two adjacent edges the angle between them satisfies
(11) 
where are independent of and . Let when each edge of is parallel to another edge of . When , then there exist two constants , such that for each , the following hold true
where depend only on . For simplicity, from now on, all constant are independent of and , unless otherwise mentioned. They may depend on . Suppose . We know that
(12) 
Suppose , and we want to construct a , where , so that
(13)  
(14)  
(15) 
where is the unit outer normal to . Without loss of generality, we may assume that , and one of the vertices of is . Let be such that . Let
(16) 
where is a unit tangent vector to and . It is easy to see that . We want to find so that
(17)  
(18) 
Let or . It is easy to see that if satisfies (17)(18), then satisfies (13)(15). In addition, (17)(18) has equations and the same number of unknowns. To show (17)(18) has a unique solution we set . Setting in (17) yields
Since inside , . Thus , where . Similarly
implies and thus . Note that for any , since , there exists at least one such in . Note also that when every edge of is parallel to another one, we can lower the number of in (16) by one. Thus for such a , we have . Next, we want to show that the unique solution of (13)(15) satisfies
(19) 
for some . Note that
where is the angle between and . Thus, (19) is equivalent to
(20) 
for some and we may assume
because of the assumption (10). Now let be the triangle spanned by and and label the third edge of as . Let be the triangle with vertices and . Label the edge of connecting and as . For , let
where is the line containing . Then
(21)  
Thus ,
(22) 
Now we will prove (20) in steps:

It is easy to see that
It follows from (22) and Corollary 2.1 that
(24) Note that
and
(25) Since ,
(26) Since are equivalent norms on ,
(27) Let be the circumscribed isoscelesright triangle obtained by scaling . It is easy to see that
(28) Since , it follows from (26), (27), and Corollary 2.1 that
where depend on (28) and . Letting in (25) yields
and thus
Then
where . It follows from Corollary 2.1 and (26)
(29) Combining (29) and (24) yields
(30)
Similarly,
Thus
By letting in (12), we arrive at
It follows from the trace inequality and the inverse inequality that
Thus
To show that is the lowest possible degree for the weak gradient, we give the following examples.
Example 2.1
Suppose and is partitioned as shown in Figure 1.
Let . To see if (8) has a unique solution in , we set and . Then . By definition,
Note that the degree of freedom of
is while the degree of freedom of is . Thus, there exist so that . Thus Algorithm will not work.Example 2.2
Let and is partitioned as shown in Figure 2.
Let . Note that the degree of freedom of is while the degree of freedom of is . A similar argument as in example 2.1 shows that Algorithm will not work.
3 Numerical Experiments
We are devoting this section to verify our theoretical results in previous sections by two numerical examples. The domain in all examples is . We will implement the SFWG finite element method (8) on triangular meshes. A uniform triangulation of the domain is used. By refining each triangle for , we obtain a sequence of partitions. The first two levels of grids are shown in Figure 3. We apply the SFWG finite element method with finite element space to find SFWG solution in the computation.
Example 3.1
In this example, we solve the Poisson problem (1)(2) posed on the unit square , and the analytic solution is
(36) 
The boundary conditions and the source term are computed accordingly. Table 1 lists errors and convergence rates in norm and norm.
Rate  Rate  

1/2  8.8205E01    8.0081E02    
1/4  4.3566E01  1.02  2.5055E02  1.68  
1/8  2.1565E01  1.01  6.7091E03  1.90  
1  1/16  1.0747E01  1.00  1.7092E03  1.97 
1/32  5.3684E02  1.00  4.2940E04  1.99  
1/64  2.6836E02  1.00  1.0749E04  2.00  
1/128  1.3417E02  1.00  2.6871E05  2.00  
1/2  2.5893E01    1.0511E02    
1/4  6.5338E02  1.99  1.2889E03  3.03  
1/8  1.6252E02  2.00  1.5596E04  3.05  
2  1/16  4.0538E03  2.09  1.9193E05  3.02 
1/32  1.0129E03  2.00  2.3837E06  3.00  
1/64  2.5321E04  2.00  2.9713E07  3.00  
1/128  6.3304E05  2.00  3.7094E08  3.00 
Example 3.2
In this example, we consider the problem with boundary condition and the exact solution is
(37) 
The results obtained in Table 2 show the errors of SFWG scheme and the convergence rates in the norm and norm. The simulations are conducted on triangular meshes and polynomials of order . The SFWG scheme with element has optimal convergence rate of in norm and in norm.
Rate  Rate  

1/2  5.6636E02    5.3064E03    
1/4  2.9670E02  0.93  1.6876E03  1.65  
1/8  1.4948E02  0.99  4.5066E04  1.90  
1  1/16  7.4848E03  1.00  1.1461E04  1.98 
1/32  3.7435E03  1.00  2.8778E05  1.99  
1/64  1.8719E03  1.00  7.2024E06  2.00  
1/128  9.3596E04  1.00  1.8011E06  2.00  
1/2  1.3353E02    5.6066E04    
1/4  3.4831E03  1.94  6.8552E05  3.03  
1/8  8.7712E04  1.99  8.2466E06  3.06  
2  1/16  2.1961E04  2.00  1.0094E06  3.03 
1/32  5.4967E05  2.00  1.2482E07  3.02  
1/64  1.3747E05  2.00  1.5518E08  3.00  
1/128  3.4375E06  2.00  1.9344E09  3.00 
Overall, the numerical experiment’s results shown in the formentioned examples match the theoretical study part in the previous sections.
References
 [1] X. Ye, S. Zhang, On stabilizerfree weak Galerkin finite element method on polytopal meshes, arXiv:1906.06634v2, 2019.
Comments
There are no comments yet.