High-Order Mesh r-Adaptivity with Tangential Relaxation and Guaranteed Mesh Validity
Ketan Mittal, Veselin Dobrev, Tzanio Kolev, Vladimir Tomov
TL;DR
The paper tackles the challenge of achieving high-order mesh quality while guaranteeing mesh validity and CAD-free boundary handling in r-adaptivity. It extends TMOP to include tangential relaxation on curved surfaces using only the discrete mesh and enforces a positive Jacobian determinant through provable lower bounds, including shifted-barrier techniques. Key methodological advances include closest-point projection with Laplace blending for boundary relaxation, piecewise-linear Jacobian bounds derived from control points, and optional $q$-refinement to selectively raise quadrature order. The proposed framework is validated on turbine blade, untangling, and ALE simulations, demonstrating robust mesh improvements, preserved geometric fidelity, and guaranteed validity across challenging scenarios.
Abstract
High-order meshes are crucial for achieving optimal convergence rates in curvilinear domains, preserving symmetry, and aligning with key flow features in moving mesh simulations, but their quality is challenging to control. In prior work, we have developed techniques based on Target-Matrix Optimization Paradigm (TMOP) to adapt a given high-order mesh to the geometry and solution of the partial differential equation (PDE). Here, we extend this framework to address two key gaps in the literature for high-order mesh r-adaptivity. First, we introduce tangential relaxation on curved surfaces using solely the discrete mesh representation, eliminating the need for access to underlying geometry (e.g., CAD model). Second, we ensure a continuously positive Jacobian determinant throughout the domain. This determinant positivity is essential for using the high-order mesh resulting from r-adaptivity with arbitrary quadrature schemes in simulations. The proposed approach is demonstrated to be robust using a variety of numerical experiments.
