Abstract:In this paper, we present a family of H(div)-compatible finite element spaces on strictly convex n-gons, whose construction makes use of generalized barycentric coordinates. In particular, for integers 0 ≤ k ≤ 2, we define finite element spaces with edge degrees of freedom that include polynomial vector fields of order k and whose vector fields have piecewise kth-order polynomial normal traces along the element boundary. These spaces suffer from the shortcoming that the image of the divergence operator include… Show more
“…Afterwards a series of other papers have appeared concerning the FEM on polygonal or polyhedral meshes, e.g. [33,31,34,32,24,40,29,21,20,5,36,35]. There are two other methods that deals with polygonal/polyhedral meshes i.e.…”
In the paper the efficient application of discontinuous Galerkin (DG) method on polygonal meshes is presented. Three versions of DG method are under consideration in which the approximation is constructed using sets of arbitrary basis functions. It means that in the presented approach there is no need to define nodes or to construct shape functions. The shape of a polygonal finite element (FE) can be quite arbitrary. It can have arbitrary number of edges and can be non-convex. In particular a single FE can have a polygonal hole or can even consists of two or more completely separated parts. The efficiency, flexibility and versatility of the presented approach is illustrated with a set of benchmark examples. The paper is limited to two-dimensional case. However, direct extension of the algorithms to three-dimension is possible.
“…Afterwards a series of other papers have appeared concerning the FEM on polygonal or polyhedral meshes, e.g. [33,31,34,32,24,40,29,21,20,5,36,35]. There are two other methods that deals with polygonal/polyhedral meshes i.e.…”
In the paper the efficient application of discontinuous Galerkin (DG) method on polygonal meshes is presented. Three versions of DG method are under consideration in which the approximation is constructed using sets of arbitrary basis functions. It means that in the presented approach there is no need to define nodes or to construct shape functions. The shape of a polygonal finite element (FE) can be quite arbitrary. It can have arbitrary number of edges and can be non-convex. In particular a single FE can have a polygonal hole or can even consists of two or more completely separated parts. The efficiency, flexibility and versatility of the presented approach is illustrated with a set of benchmark examples. The paper is limited to two-dimensional case. However, direct extension of the algorithms to three-dimension is possible.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.