Minimization-based polynomial corrections for high-order curved boundaries on fixed and moving domains: assessment on finite volume and discontinuous Galerkin schemes

Abstract

In this work, we present two novel strategies to impose high-order boundary conditions on fixed and moving curved domains, approximated with piecewise affine triangulations. Achieving high-order accuracy on curved domains requires tackling both the PDE discretization error and the geometrical error simultaneously. While the former can be reduced by employing high-order numerical methods such as finite volume and discontinuous Galerkin, the latter demands either a high-order parametrization of the physical domain or a consistent approximation of the boundary conditions. Minimization-based approaches like the Reconstruction for Off-site Data (ROD) method allow one to skip the construction of high-order curvilinear meshes by defining high-order consistent boundary conditions on a computational boundary that does not match the physical one. The ROD approach mitigates the second-order geometrical error by retrieving a modified polynomial in each boundary cell, which enforces the boundary conditions exactly on the physical boundary. However, the standard ROD method requires the inversion of a local linear system, whose cost grows with the polynomial degree and mesh refinement. Inspired by a recent one-dimensional analysis, we show that ROD-type approaches can be recast as simple polynomial corrections, applicable without any linear system inversion. This greatly simplifies the development of minimization-based boundary treatments and reduces the associated computational cost. To prove the wide applicability of our strategy, we develop it within a Runge-Kutta discontinuous Galerkin framework and an ADER arbitrary-Lagrangian-Eulerian finite volume framework for compressible flows on fixed and moving domains. Several numerical experiments with Dirichlet and slip-wall boundary conditions are presented, with convergence analysis up to fifth order in both 2D and 3D.