Arbitrary Lagrangian-Eulerian discontinuous Galerkin method for conservation laws on moving simplex meshes

Pei Fu, Gero Schnücke, Yinhua XiaMath. Comput 2019 · DOI

TL;DR

This paper introduces and analyzes a new numerical method, the Arbitrary Lagrangian-Eulerian discontinuous Galerkin (ALE-DG) method, for solving conservation laws on moving simplex meshes. This method offers improved accuracy and stability, particularly for complex geometries and dynamic simulations, by combining the flexibility of ALE with the robustness of DG methods.

What Problem Does This Paper Address?

Simulating physical phenomena governed by conservation laws, such as fluid dynamics, often requires numerical methods that can handle complex geometries and moving boundaries. Traditional methods can struggle with mesh distortions, leading to inaccuracies and instabilities. The Arbitrary Lagrangian-Eulerian (ALE) approach offers a way to manage moving meshes by allowing the mesh to move independently of the fluid flow, providing flexibility. However, combining ALE with high-order numerical methods like discontinuous Galerkin (DG) on simplex meshes (e.g., triangles in 2D) presents significant challenges. Specifically, ensuring that the numerical scheme accurately conserves geometric properties (geometric conservation law) and maintains solution bounds (maximum principle) on these deforming meshes is crucial. This paper addresses these challenges by developing and analyzing an ALE-DG method specifically designed for simplex meshes.

Methods

The core of this work is the development of an Arbitrary Lagrangian-Eulerian discontinuous Galerkin (ALE-DG) method. Key aspects include:

  • ALE Framework: The method utilizes an ALE framework to handle moving meshes. This involves defining local affine linear mappings between time-dependent simplex cells and a reference simplex cell. This ensures the method satisfies the geometric conservation law (GCL) under certain conditions.
  • Discontinuous Galerkin (DG) Method: The DG method is employed for spatial discretization. It uses discontinuous polynomial basis functions within each cell, allowing for local approximations and efficient parallelization.
  • Simplex Meshes: The method is specifically designed for simplex meshes (e.g., triangles in 2D), which are common in complex geometries.
  • Time Discretization: High-order Total-Variation-Diminishing Runge-Kutta (TVD-RK) methods are used for time integration. The paper specifically considers second and third-order TVD-RK methods.
  • Bound Preserving Limiter: To ensure the numerical solution remains within physically meaningful bounds (satisfying a discrete maximum principle), a bound preserving limiter, previously developed for rectangular and triangular meshes, is incorporated. This limiter is designed to maintain high-order accuracy.
  • Theoretical Analysis: The paper provides theoretical analysis, including proofs for L²-stability and a priori error estimates. It also proves that the fully-discrete ALE-DG method satisfies the discrete geometric conservation law (D-GCL) and the discrete maximum principle when the bound preserving limiter is applied.

Datasets

Not discussed in the paper. The paper focuses on theoretical development and numerical experiments using standard test cases for conservation laws.

Key Insights and Ideas

  • ALE-DG for Simplex Meshes: The paper successfully extends the ALE-DG method to handle simplex meshes in multiple dimensions, which is a significant step for simulating complex geometries.
  • GCL and Time Integrator Order: A key finding is that the geometric conservation law (GCL) is satisfied when the order of the time integrator is not less than the spatial dimension. This provides a clear guideline for choosing appropriate time-stepping schemes.
  • Bound Preservation with Limiters: The integration of a bound preserving limiter is shown to effectively enforce a discrete maximum principle without sacrificing high-order accuracy, a crucial property for many physical simulations.
  • Robustness on Moving Meshes: The combination of ALE and DG with a limiter demonstrates robustness and high-order accuracy even on deforming meshes, as evidenced by numerical experiments.

Key Results

  • Theoretical Guarantees: The paper provides theoretical proofs for the L²-stability of the semi-discrete ALE-DG method and a priori error estimates.
  • D-GCL Satisfaction: It is proven that the fully-discrete ALE-DG method satisfies the discrete geometric conservation law (D-GCL) under specific conditions related to the time integrator's order and the spatial dimension.
  • Maximum Principle: The paper demonstrates that the fully-discrete ALE-DG method, when combined with a bound preserving limiter, satisfies a discrete maximum principle.
  • Numerical Validation: Extensive numerical experiments on linear advection, Burgers' equation, and compressible Euler equations show that the method achieves optimal accuracy and maintains solution bounds on both static and moving triangular meshes. For instance, in Example 5.1 (linear advection), optimal accuracy is observed with Pk polynomial spaces (k=1,2,3), and the bound preserving limiter ensures the solution remains within the expected range.

Limitations and Future Work

  • Suboptimal Error Estimate: The paper presents a suboptimal a priori error estimate in the L∞(0, T; L²(Ω))-norm. While optimal accuracy is observed in numerical experiments, the theoretical estimate has a slightly lower order.
  • Moving Mesh Methodology: The numerical examples used predefined grid point distributions. The authors note that the development of a suitable moving mesh methodology for their ALE-DG method is a project for future work.
  • Compressible Euler Equations: While numerical examples for compressible Euler equations are presented, the theoretical analysis in the paper primarily focuses on scalar conservation laws. Further investigation into the positivity preserving properties of the method for compressible flows is suggested.
  • Generalization to Other TVD-RK Methods: The paper demonstrates the applicability of the method with second and third-order TVD-RK schemes. Remark 3 suggests that other TVD-RK methods, such as a five-stage fourth-order method, can also be used and proven to satisfy the maximum principle.

Summary updated

BibTeX
@article{fu2019arbitrary,
  author = {Pei Fu and Gero Schnücke and Yinhua Xia},
  title = {{Arbitrary Lagrangian-Eulerian discontinuous Galerkin method for conservation laws on moving simplex meshes}},
  journal = {Math. Comput.},
  year = {2019},
  doi = {10.1090/mcom/3417},
}
Figure