2020
DOI: 10.1016/j.apnum.2020.06.012
|View full text |Cite
|
Sign up to set email alerts
|

The lowest-order stabilizer free weak Galerkin finite element method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Various configurations of (P k (T ), P l (e), [P j (T )] d ) with l ≥ k and j ≥ k + 1 lead to different schemes, cf. [1][2][3][22][23][24][25][26]. Later on, the definition of weak gradient operator is modified by using the standard gradient of interior test functions instead of the divergence of trial functions [23].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Various configurations of (P k (T ), P l (e), [P j (T )] d ) with l ≥ k and j ≥ k + 1 lead to different schemes, cf. [1][2][3][22][23][24][25][26]. Later on, the definition of weak gradient operator is modified by using the standard gradient of interior test functions instead of the divergence of trial functions [23].…”
Section: Introductionmentioning
confidence: 99%
“…In order to reach the optimal convergence order for approximating the secondorder elliptic equations, in many published literature on WG-FEM and SFWG-FEM, the solution is usually assumed to have at least H 2 -smoothness [1,23]. As a result, it is demonstrated that the convergence rates are at least O(h) in H 1 -norm and O(h 2 ) in L 2 -norm with mesh-size h, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Here j = k + n − 1 and n is the number of sides of polytopal element. The authors in [1,2] have relaxed the requirement of polynomial degree of approximation. Rational function Wachspress coordinates [4] are used in [5,6] to approximate weak gradient.…”
Section: Introductionmentioning
confidence: 99%
“…In [11,12], gradient is approximated by a polynomial of order j = k + n − 1 where n is the number of sides of polygonal element. This result has been improved in [1,2] by reducing the degree of polynomial j. Recently, new stabilizer free WG methods have been developed in [13,14] for second order elliptic equations on polytopal mesh, which have superconvergence.…”
Section: Introductionmentioning
confidence: 99%