An agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids

In this article we design and analyze a class of two-level non-overlapping additive Schwarz preconditioners for the solution of the linear system of equations stemming from discontinuous Galerkin discretizations of second-order elliptic partial differential equations on polytopic meshes. The preconditioner is based on a coarse space and a non-overlapping partition of the computational domain where local solvers are applied in parallel. In particular, the coarse space can potentially be chosen to be non-embedded with respect to the finer space; indeed it can be obtained from the fine grid by employing agglomeration and edge coarsening techniques. We investigate the dependence of the condition number of the preconditioned system with respect to the diffusion coefficient and the discretization parameters, i.e., the mesh size and the polynomial degree of the fine and coarse spaces. Numerical examples are presented which confirm the theoretical bounds

h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems

In this work we exploit agglomeration based $h$-multigrid preconditioners to speed-up the iterative solution of discontinuous Galerkin discretizations of the Stokes and Navier-Stokes equations. As a distinctive feature $h$-coarsened mesh sequences are generated by recursive agglomeration of a fine grid, admitting arbitrarily unstructured grids of complex domains, and agglomeration based discontinuous Galerkin discretizations are employed to deal with agglomerated elements of coarse levels. Both the expense of building coarse grid operators and the performance of the resulting multigrid iteration are investigated. For the sake of efficiency coarse grid operators are inherited through element-by-element $L^2$ projections, avoiding the cost of numerical integration over agglomerated elements. Specific care is devoted to the projection of viscous terms discretized by means of the BR2 dG method. We demonstrate that enforcing the correct amount of stabilization on coarse grids levels is mandatory for achieving uniform convergence with respect to the number of levels. The numerical solution of steady and unsteady, linear and non-linear problems is considered tackling challenging 2D test cases and 3D real life computations on parallel architectures. Significant execution time gains are documented.Comment: 78 pages, 7 figure

Discontinuous Galerkin Methods for the Biharmonic Problem on Polygonal and Polyhedral Meshes

We introduce an $hp$-version symmetric interior penalty discontinuous Galerkin finite element method (DGFEM) for the numerical approximation of the biharmonic equation on general computational meshes consisting of polygonal/polyhedral (polytopic) elements. In particular, the stability and $hp$-version a-priori error bound are derived based on the specific choice of the interior penalty parameters which allows for edges/faces degeneration. Furthermore, by deriving a new inverse inequality for a special class {of} polynomial functions (harmonic polynomials), the proposed DGFEM is proven to be stable to incorporate very general polygonal/polyhedral elements with an \emph{arbitrary} number of faces for polynomial basis with degree $p=2,3$. The key feature of the proposed method is that it employs elemental polynomial bases of total degree $\mathcal{P}_p$, defined in the physical coordinate system, without requiring the mapping from a given reference or canonical frame. A series of numerical experiments are presented to demonstrate the performance of the proposed DGFEM on general polygonal/polyhedral meshes

Discontinuous Galerkin approximations in computational mechanics: hybridization, exact geometry and degree adaptivity

Discontinuous Galerkin (DG) discretizations with exact representation of the geometry and local polynomial degree adaptivity are revisited. Hybridization techniques are employed to reduce the computational cost of DG approximations and devise the hybridizable discontinuous Galerkin (HDG) method. Exact geometry described by non-uniform rational B-splines (NURBS) is integrated into HDG using the framework of the NURBS-enhanced finite element method (NEFEM). Moreover, optimal convergence and superconvergence properties of HDG-Voigt formulation in presence of symmetric second-order tensors are exploited to construct inexpensive error indicators and drive degree adaptive procedures. Applications involving the numerical simulation of problems in electrostatics, linear elasticity and incompressible viscous flows are presented. Moreover, this is done for both high-order HDG approximations and the lowest-order framework of face-centered finite volumes (FCFV).Peer ReviewedPostprint (author's final draft

Multigrid Preconditioning for a Space-Time Spectral-Element Discontinuous-Galerkin Solver

In this work we examine a multigrid preconditioning approach in the context of a high- order tensor-product discontinuous-Galerkin spectral-element solver. We couple multigrid ideas together with memory lean and efficient tensor-product preconditioned matrix-free smoothers. Block ILU(0)-preconditioned GMRES smoothers are employed on the coarsest spaces. The performance is evaluated on nonlinear problems arising from unsteady scale- resolving solutions of the Navier-Stokes equations: separated low-Mach unsteady ow over an airfoil from laminar to turbulent ow. A reduction in the number of ne space iterations is observed, which proves the efficiency of the approach in terms of preconditioning the linear systems, however this gain was not reflected in the CPU time. Finally, the preconditioner is successfully applied to problems characterized by stiff source terms such as the set of RANS equations, where the simple tensor product preconditioner fails. Theoretical justification about the findings is reported and future work is outlined

Adaptive discontinuous Galerkin methods on polytopic meshes

In this article we consider the application of discontinuous Galerkin finite element methods, defined on agglomerated meshes consisting of general polytopic elements, to the numerical approximation of partial differential equation problems posed on complicated geometries. Here, we assume that the underlying computational domain may be accurately represented by a geometry-conforming fine mesh; the resulting coarse mesh is then constructed based on employing standard graph partitioning algorithms. To improve the accuracy of the computed numerical approximation, we consider the development of goal-oriented adaptation techniques within an automatic mesh refinement strategy. In this setting, elements marked for refinement are subdivided by locally constructing finer agglomerates; should further resolution of the underlying fine mesh T_f be required, then adaptive refinement of T_f will also be undertaken. As an example of the application of these techniques, we consider the numerical approximation of the linear elasticity equations for a homogeneous isotropic material. In particular, the performance of the proposed adaptive refinement algorithm is studied for the computation of the (scaled) effective Young's modulus of a section of trabecular bone

Adaptive discontinuous Galerkin methods on polytopic meshes

In this article we consider the application of discontinuous Galerkin finite element methods, defined on agglomerated meshes consisting of general polytopic elements, to the numerical approximation of partial differential equation problems posed on complicated geometries. Here, we assume that the underlying computational domain may be accurately represented by a geometry-conforming fine mesh; the resulting coarse mesh is then constructed based on employing standard graph partitioning algorithms. To improve the accuracy of the computed numerical approximation, we consider the development of goal-oriented adaptation techniques within an automatic mesh refinement strategy. In this setting, elements marked for refinement are subdivided by locally constructing finer agglomerates; should further resolution of the underlying fine mesh T_f be required, then adaptive refinement of T_f will also be undertaken. As an example of the application of these techniques, we consider the numerical approximation of the linear elasticity equations for a homogeneous isotropic material. In particular, the performance of the proposed adaptive refinement algorithm is studied for the computation of the (scaled) effective Young's modulus of a section of trabecular bone

Multigrid algorithms for hp-version interior penalty discontinuous Galerkin methods on polygonal and polyhedral meshes

In this paper we analyze the convergence properties of two-level and W-cycle multigrid solvers for the numerical solution of the linear system of equations arising from hp-version symmetric interior penalty discontinuous Galerkin discretizations of second-order elliptic partial differential equations on polygonal/polyhedral meshes. We prove that the two-level method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large. An analogous result is obtained for the W-cycle multigrid algorithm, which is proved to be uniformly convergent with respect to the mesh size, the polynomial approximation degree, and the number of levels, provided the latter remains bounded and the number of smoothing steps is chosen sufficiently large. Numerical experiments are presented which underpin the theoretical predictions; moreover, the proposed multilevel solvers are shown to be convergent in practice, even when some of the theoretical assumptions are not fully satisfied