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 L^2-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.

[1]  F. Brezzi,et al.  Discontinuous Galerkin approximations for elliptic problems , 2000 .

[2]  A. Ern,et al.  Mathematical Aspects of Discontinuous Galerkin Methods , 2011 .

[3]  S. Rebay,et al.  High-Order Accurate Discontinuous Finite Element Solution of the 2D Euler Equations , 1997 .

[4]  Andrea Crivellini,et al.  An artificial compressibility flux for the discontinuous Galerkin solution of the incompressible Navier-Stokes equations , 2006, J. Comput. Phys..

[5]  Benjamin S. Kirk,et al.  Library for Parallel Adaptive Mesh Refinement / Coarsening Simulations , 2006 .

[6]  Ralf Hartmann,et al.  Error estimation and anisotropic mesh refinement for 3d laminar aerodynamic flow simulations , 2010, J. Comput. Phys..

[7]  M. Rozložník,et al.  The loss of orthogonality in the Gram-Schmidt orthogonalization process , 2005 .

[8]  George Karypis,et al.  Multilevel algorithms for generating coarse grids for multigrid methods , 2001, SC.

[9]  Claus-Dieter Munz,et al.  Polymorphic nodal elements and their application in discontinuous Galerkin methods , 2009, J. Comput. Phys..

[10]  M. Gobbert,et al.  Numerical Demonstration of Finite Element Convergence for Lagrange Elements in COMSOL Multiphysics , 2008 .

[11]  G. Karniadakis,et al.  Spectral/hp Element Methods for Computational Fluid Dynamics , 2005 .

[12]  Vít Dolejší,et al.  Anisotropic mesh adaptation for numerical solution of boundary value problems , 2004 .

[13]  N. Sukumar,et al.  Generalized Gaussian quadrature rules on arbitrary polygons , 2010 .

[14]  Pietro Francesco Mar Tesini.  An h-multigrid approach for high-order discountinuous Galerkin methods , 2008 .

[15]  Lilia Krivodonova,et al.  High-order accurate implementation of solid wall boundary conditions in curved geometries , 2006 .

[16]  Alexandre Ern,et al.  Discrete functional analysis tools for Discontinuous Galerkin methods with application to the incompressible Navier-Stokes equations , 2010, Math. Comput..

[17]  Zydrunas Gimbutas,et al.  A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions , 2010, Comput. Math. Appl..

[18]  M. M. Rashid,et al.  A three‐dimensional finite element method with arbitrary polyhedral elements , 2006 .