Jean-François Remacle

Jiří Szotkowski, Václav Kučera, Chi-Wang Shu et al.

We establish a simple, rigorous, and easy to implement connection between the classical continuous finite element method (FEM) and the discontinuous Galerkin (DG) method for Poisson's problem. The key idea is to insert a vanishing-thickness layer of "dummy" elements along cell interfaces. By modifying the diffusion coefficient on these elements to be proportional to their thickness, we prove the FEM formulation converges to Babuška-Zlámal DG with trapezoidal edge quadrature. The scheme is trivial to implement by (i) a mesh edit that introduces degenerate interface elements and (ii) a single Jacobian threshold in an otherwise unmodified FEM code to handle the degenerate elements via the tempered finite element (TFEM) framework. We provide a rigorous derivation of the resulting TFEM-DG scheme, prove optimal $H^1$ and $L^2$ error estimates, and present numerical experiments in 2D and 3D. The method allows for simple implementation of DG in a FEM code and even adaptive element-by-element switching between FEM and DG with minimal coding effort. The framework is readily extensible, as we will demonstrate in a companion paper dedicated to evolutionary nonlinear first-order hyperbolic systems.

Amaury Johnen, Jean-Christophe Weill, Jean-François Remacle

Checking mesh validity is a mandatory step before doing any finite element analysis. If checking the validity of tetrahedra is trivial, checking the validity of hexahedral elements is far from being obvious. In this paper, a method that robustly and efficiently compute the validity of standard linear hexahedral elements is presented. This method is a significant improvement of a previous work on the validity of curvilinear elements. The new implementation is simple and computationally efficient. The key of the algorithm is still to compute Bézier coefficients of the Jacobian determinant. We show that only 20 Jacobian determinants are necessary to compute the 27 Bézier coefficients. Those 20 Jacobians can be efficiently computed by calculating the volume of 20 tetrahedra. The new implementation is able to check the validity of about 6 million hexahedra per second on one core of a personal computer. Through the paper, all the necessary information is provided that allow to easily reproduce the results, \ie write a simple code that takes the coordinates of 8 points as input and outputs the validity of the hexahedron.

Thomas Toulorge, Jonathan Lambrechts, Jean-François Remacle

This paper presents a method to generate valid high order meshes with optimized geometrical accuracy. The high order meshing procedure starts with a linear mesh, that is subsequently curved without taking care of the validity of the high order elements. An optimization procedure is then used to both untangle invalid elements and optimize the geometrical accuracy of the mesh. Standard measures of the distance between curves are considered to evaluate the geometrical accuracy in planar two-dimensional meshes, but they prove computationally too costly for optimization purposes. A fast estimate of the geometrical accuracy, based on Taylor expansions of the curves, is introduced. An unconstrained optimization procedure based on this estimate is shown to yield significant improvements in the geometrical accuracy of high order meshes, as measured by the standard Haudorff distance between the geometrical model and the mesh. Several examples illustrate the beneficial impact of this method on CFD solutions, with a particular role of the enhanced mesh boundary smoothness.