On the flexibility of agglomeration based physical space discontinuous Galerkin discretizations
In this work we show that the flexibility of the discontinuous Galerkin (dG) discretization can be fruitfully exploited to implement numerical solution strategies based on the use of elements with very general shapes. Thanks to the freedom in defining the mesh topology, we propose a new h-adaptive technique based on agglomeration coarsening of a fine mesh. The possibility to enhance the error distribution over the computational domain is investigated on a Poisson problem with the goal of obtaining a mesh independent discretization. The main building block of our dG method consists of defining discrete polynomial spaces directly on physical frame elements. For this purpose we orthonormalize with respect to the L2-product a set of monomials relocated in a specific element frame and we introduce an easy way to reduce the cost related to numerical integration on agglomerated meshes. To complete the dG formulation for second order problems, two extensions of the BR2 scheme to arbitrary polyhedral grids, including an estimate of the stabilization parameter ensuring the coercivity property, are here proposed.
h-adaptivity diffusion equation laplacian discretization discontinuous galerkin methods polyhedral elements orthonormal hierarchical basis functions reduced numerical integration meshfree