Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2102.00231

An efficient mapped WENO scheme using approximate constant mapping

Ruo Li·Wei Zhong
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a novel mapping approach for WENO schemes through the use of an approximate constant mapping function which is constructed by employing an approximation of the classic signum function. The new approximate constant mapping function is designed to meet the overall criteria for a proper mapping function required in the design of the WENO-PM6 scheme. The WENO-PM6 scheme was proposed to overcome the potential loss of accuracy of the WENO-M scheme which was developed to recover the optimal convergence order of the WENO-JS scheme at critical points. Our new mapped WENO scheme, denoted as WENO-ACM, maintains almost all advantages of the WENO-PM6 scheme, including low dissipation and high resolution, while decreases the number of mathematical operations remarkably in every mapping process leading to a significant improvement of efficiency. The convergence rates of the WENO-ACM scheme have been shown through one-dimensional linear advection equation with various initial conditions. Numerical results of one-dimensional Euler equations for the Riemann problems, the Mach 3 shock-density wave interaction and the Woodward-Colella interacting blastwaves are improved in comparison with the results obtained by the WENO-JS, WENO-M and WENO-PM6 schemes. Numerical experiments with two-dimensional problems as the 2D Riemann problem, the shock-vortex interaction, the 2D explosion problem, the double Mach reflection and the forward-facing step problem modeled via the two dimensional Euler equations have been conducted to demonstrate the high resolution and the effectiveness of the WENO-ACM scheme. The WENO-ACM scheme provides significantly better resolution than the WENO-M scheme and slightly better resolution than the WENO-PM6 scheme, and compared to the WENO-M and WENO-PM6 schemes, the extra computational cost is reduced by more than 83% and 93%, respectively.

Explore related subjects

math.NAcs.NA

Keep this discovery

BibTeXRIS

Ruo Li, Wei Zhong. 2021-01-30. An efficient mapped WENO scheme using approximate constant mapping. https://doi.org/10.4208/nmtma.oa-2021-0074

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗