- Journal Home
- Volume 42 - 2024
- Volume 41 - 2023
- Volume 40 - 2022
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
Cited by
- BibTex
- RIS
- TXT
The weak Galerkin (WG) finite element method was first introduced by Wang and Ye for solving second order elliptic equations, with the use of weak functions and their weak gradients. The basis function spaces depend on different combinations of polynomial spaces in the interior subdomains and edges of elements, which makes the WG methods flexible and robust in many applications. Different from the definition of jump in discontinuous Galerkin (DG) methods, we can define a new weaker jump from weak functions defined on edges. Those functions have double values on the interior edges shared by two elements rather than a limit of functions defined in an element tending to its edge. Naturally, the weak jump comes from the difference between two weak functions defined on the same edge. We introduce an over-penalized weak Galerkin (OPWG) method, which has two sets of edge-wise and element-wise shape functions, and adds a penalty term to control weak jumps on the interior edges. Furthermore, optimal a priori error estimates in $H^1$ and $L^2$ norms are established for the finite element ($\mathbb{P}_k(K)$, $\mathbb{P}_k(e)$, $RT_k(K)$). In addition, some numerical experiments are given to validate theoretical results, and an incomplete LU decomposition has been used as a preconditioner to reduce iterations from the GMRES, CG, and BICGSTAB iterative methods.
}, issn = {1991-7139}, doi = {https://doi.org/10.4208/jcm.1705-m2016-0744}, url = {http://global-sci.org/intro/article_detail/jcm/12606.html} }The weak Galerkin (WG) finite element method was first introduced by Wang and Ye for solving second order elliptic equations, with the use of weak functions and their weak gradients. The basis function spaces depend on different combinations of polynomial spaces in the interior subdomains and edges of elements, which makes the WG methods flexible and robust in many applications. Different from the definition of jump in discontinuous Galerkin (DG) methods, we can define a new weaker jump from weak functions defined on edges. Those functions have double values on the interior edges shared by two elements rather than a limit of functions defined in an element tending to its edge. Naturally, the weak jump comes from the difference between two weak functions defined on the same edge. We introduce an over-penalized weak Galerkin (OPWG) method, which has two sets of edge-wise and element-wise shape functions, and adds a penalty term to control weak jumps on the interior edges. Furthermore, optimal a priori error estimates in $H^1$ and $L^2$ norms are established for the finite element ($\mathbb{P}_k(K)$, $\mathbb{P}_k(e)$, $RT_k(K)$). In addition, some numerical experiments are given to validate theoretical results, and an incomplete LU decomposition has been used as a preconditioner to reduce iterations from the GMRES, CG, and BICGSTAB iterative methods.