A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters
By: Tarik Dzanic, Tzanio Kolev, Ketan Mittal
Potential Business Impact:
Makes computer math faster for simulations.
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). The efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.
Similar Papers
High Order Boundary Extrapolation Technique for Finite Difference Methods on Complex Domains with Cartesian Meshes
Numerical Analysis
Makes computer simulations of tricky shapes accurate.
High order treatment of moving curved boundaries: Arbitrary-Lagrangian-Eulerian methods with a shifted boundary polynomials correction
Numerical Analysis
Makes computer simulations of moving air more accurate.
A high-order augmented basis positivity-preserving discontinuous Galerkin method for a Linear Hyperbolic Equation
Computational Engineering, Finance, and Science
Keeps computer math answers from becoming wrong.