SearcharxivSearch

arXiv · 2409.14005

High-order Space-time Flux Reconstruction Methods for Moving Domain Simulation

Abstract

A high-order space-time flux reconstruction (FR) method has been developed to solve conservation laws on moving domains. In the space-time framework, the moving domain simulation is similar to that on a stationary domain, except that the shape of the space-time elements varies with time (and space when a deforming grid is used). The geometric conservation law can be automatically satisfied to the level of the numerical resolution of the space-time schemes when the space-time discretization of the governing partial differential equations can resolve the geometric nonlinearity of curvilinear space-time elements. In this study, a space-time tensor product operation is used to construct the FR formulation, and the Gauss-Legendre quadrature points are used as solution points both in space and time. A dual time stepping method is used to solve the resulting space-time system. As has been proved by Huynh [J Sci Comput 96, 51 (2023)], in the temporal direction, the FR scheme with the Gauss-Legendre solution points is equivalent to the so-called DG-Gauss implicit Runge-Kutta (IRK) scheme when the quadrature rule based on the solution points (i.e. quadrature points used in DG) is sufficiently accurate to integrate the space-time curvilinear elements. Specifically, we show that when linear space-time elements are adopted in moving domain simulations, the temporal FR scheme based on Gauss-Legendre solution points can always guarantee its equivalency to IRK DG-Gauss. The conditions, under which the moving domain simulation with the method of lines are consistent with those using the space-time formulation, are also discussed. The new space-time FR method can achieve arbitrarily high-order spatial and temporal accuracy without numerical constraints on the physical time step in moving domain simulations. The temporal superconvergence property for moving domain simulations have been demonstrated.

Explore related subjects

Keep this discovery

BibTeXRIS

Meilin Yu. 2024-09-21. High-order Space-time Flux Reconstruction Methods for Moving Domain Simulation. https://arxiv.org/abs/2409.14005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Stress-divergence, Laplacian, and rotational forms of the incompressible Navier--Stokes equations with variable viscosity

In the Navier--Stokes equations, incompressibility allows rewriting the viscous term in various forms leading to distinct numerical properties and flow descriptions. Furthermore, models accounting for non-Newtonian, thermal or turbulent effects often break the constant-viscosity assumption, thereby producing additional consistency terms. In this context, the present work compares the classical symmetric-gradient diffusion term with more recent variable-viscosity generalizations of the Laplacian and rotational forms. We discuss, analyze and test their differences with respect to implementation, efficiency, numerical stability and outflow boundary conditions. With a focus on time-dependent flows, we consider second-order implicit-explicit (IMEX) temporal discretizations aimed at improving efficiency and numerical stability. Through a rigorous stability analysis, we show how selected explicit treatments can bypass algorithmic nonlinearities without inducing CFL conditions. Our numerical results highlight important differences between the three viscous formulations---especially in the presence of outflow boundaries, for which the generalized Laplacian form proves more suitable in diffusion-dominated regimes. %(as widely known for constant viscosity).

math.NA

Full-window branch discovery and loss-selected EnKF continuation for data assimilation

We develop a framework for offline full-window branch discovery, optionally followed by online continuation with an ensemble Kalman filter (EnKF). Three mechanisms drive the branch search: adjoint path-kernel (APK) differentiation balances kernel differentiation and correction-stabilized path perturbation, shifting the optimization from exploration to exploitation; an optimized Gaussian initial law broadens the search over initial-state basins; and loss-weighted mixing across independent runs recombines successful path components. We may then select an interior state using a local loss and continue online with an EnKF. In 40-dimensional Lorenz-96 experiments, the mean offline path RMSE of APK is 4.3 times smaller than that of population weak-$\mathrm{4D\text{-}Var}_x$. The resulting APK-EnKF method has a mean online RMSE 64 times smaller than that of ordinary EnKF.

math.NA

A variational physics-informed graph neural network for heterogeneous solid mechanics

Stress localization in heterogeneous solids is governed by the bimaterial interface, where the displacement field remains $C^0$-continuous, while in-plane stresses jump due to the stiffness mismatch. Coordinate-based physics-informed neural networks (PINNs) represent this jump via a prescribed regularization width or a weighted interface penalty, making their accuracy sensitive to how phase-contrast changes are handled. This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field. The solver operates on a conforming adaptive mesh graph, assigns constitutive behavior per element, and minimizes the discrete total potential energy as a single unweighted objective in which only first derivatives appear. The discrete energy on piecewise-linear elements coincides with the finite element (FE) Ritz functional. Dirichlet conditions are enforced by construction, with no penalty term, no interface weight, and no prescribed transition width. Using one fixed architecture, optimizer, and loss across small-strain elasticity and finite-strain Neo-Hookean hyperelasticity in two and three dimensions, the von Mises error remains below $3.58\%$ across a stiffness-contrast sweep spanning $(E_{\mathrm{inc}}/E_{\mathrm{mat}}\in[10^{-2},10^{2}])$, where a strong-form PINN degrades to $5.58\%$, and its displacement error reaches $7.66\%$ against $0.49\%$ for the PI-GNN. A trained network halves the ($\sigma_{xx}$) error of an energy-based PINN ($5.01\%$ versus $10.94\%$). Training cost exceeds a single FE solve by more than an order of magnitude, so the construction is a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a replacement for a one-off FE analysis.

math.NA