SearcharxivSearch

arXiv · 1212.4695

Outflow Positivity Limiting for Hyperbolic Conservation Laws. Part I: Framework and Recipe

Abstract

Numerical methods for hyperbolic conservation laws are needed that efficiently mimic the constraints satisfied by exact solutions, including material conservation and positivity, while also maintaining high-order accuracy and numerical stability. Discontinuous Galerkin (DG) and WENO schemes allow efficient high-order accuracy while maintaining conservation. Positivity limiters developed by Zhang and Shu ensure a minimum time step for which positivity of cell average quantities is maintained without sacrificing conservation or formal accuracy; this is achieved by linearly damping the deviation from the cell average just enough to enforce a cell positivity condition that requires positivity at boundary nodes and strategically chosen interior points. We assume that the set of positive states is convex; it follows that positivity is equivalent to scalar positivity of a collection of affine functionals. Based on this observation, we generalize the method of Zhang and Shu to a framework that we call outflow positivity limiting: First, enforce positivity at boundary nodes. If wave speed desingularization is needed, cap wave speeds at physically justified maxima by using remapped states to calculate fluxes. Second, apply linear damping again to cap the boundary average of all positivity functionals at the maximum possible (relative to the cell average) for a scalar-valued representation positive in each mesh cell. This be done by enforcing positivity of the retentional, an affine combination of the cell average and the boundary average, in the same way that Zhang and Shu would enforce positivity at a single point (and with similar computational expense). Third, limit the time step so that cell outflow is less than the initial cell content. This framework guarantees essentially the same positivity-preserving time step as is guaranteed if positivity is enforced at every point in the mesh cell.

Explore related subjects

Keep this discovery

BibTeXRIS

Evan Alexander Johnson, James A. Rossmanith. 2012-12-19. Outflow Positivity Limiting for Hyperbolic Conservation Laws. Part I: Framework and Recipe. https://arxiv.org/abs/1212.4695

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