Searcharxiv⌕ Search

arXiv subjects

Yongle Liu

Publications and source records attributed to Yongle Liu.

18 recordsLinked to original sources
arXiv2026

Construction of entropy satisfying Active Flux-type methods

This paper is devoted to the analysis of the entropy stability properties of Active Flux\yolo{-type} scheme for a hyperbolic system equipped with one entropy inequality. This type of scheme evolves two sets of degrees of freedom: point values that are chosen on the boundary of the elements that cover the computational domain, and the average of the solution in these elements. We show that the only thing to do is to get an entropy inequality for the average values, the point values degrees of freedom do not play any role. We construct a monolithic scheme which is bound preserving of \cite{BP_Pampa_VEM}, non oscillatory following \cite{PampaDG}, and entropy diminishing. The entropy condition is implemented in Tadmor's framework\cite{TadmorEntropy}, i.e. for the semi-discrete scheme only. The scheme is tested on the Kurganov-Popov-Petrova test case \cite{KPP} which is known to \yolo{be} sensitive to the satisfaction of an entropy inequality. We show that our entropy correction is effective: if we do not activate the bound-preserving nor the non oscillatory condition, we get the correct solution with some spurious wiggles, as expected. Though the development, implementation and tests are done with the triangle version of the scheme, the same method can be used for polygonal meshes, following \cite{BP_Pampa_VEM}.

math.NA↗
arXiv2025

Robust PAMPA Scheme in the DG Formulation on Unstructured Triangular Meshes: bound preservation, oscillation elimination, and boundary conditions

We propose an improved version of the PAMPA algorithm where the solution is sought as globally continuous. The scheme is locally conservative, and there is no mass matrix to invert. This method had been developed in a series of papers, see e.g \cite{Abgrall2024a} and the references therein. In \cite{Abgrall2025d}, we had shown the connection between PAMPA and the discontinuous Galerkin method, for the linear hyperbolic problem. Taking advantage of this reinterpretation, we use it to define a family of methods, show how to implement the boundary conditions in a rigorous manner. In addition, we propose a method that complements the bound preserving method developed in \cite{Abgrall2025d} in the sense that it is non oscillatory. A truncation error analysis is provided, it shows that the scheme should be third order accurate for smooth solutions. This is confirmed by numerical experiments. Several numerical examples are presented to show that the scheme is indeed bound preserving and non oscillatory on a wide range on numerical benchmarks.

math.NA↗
arXiv2025

Positivity-preserving Well-balanced PAMPA Schemes with Global Flux quadrature for One-dimensional Shallow Water Models

We present a novel hydrostatic and non-hydrostatic equilibria preserving Point-Average-Moment PolynomiAl-interpreted (PAMPA) method for solving the one-dimensional hyperbolic balance laws, with applications to the shallow water models including the Saint--Venant system with the Manning friction term and rotating shallow water equations. The idea is based on a global flux quadrature formulation, in which the discretization of the source terms is obtained from the derivative of and additional flux function computed via high order quadrature of the source term. The reformulated system is quasi-conservative with global integral terms computed using Gauss--Lobatto quadrature nodes. The resulting method is capable of preserving a large family of smooth moving equilibria: supercritical and subcritical flows, in a super-convergent manner. We also show that, by an appropriate quadrature strategy for the source, we can exactly preserve the still water states. Moreover, to guarantee the positivity of water depth and eliminate the spurious oscillations near shocks, we blend the high-order PAMPA schemes with the first order local Lax--Friedrichs schemes using the method developed in [R. Abgrall, M. Jiao, Y. Liu, and K. Wu, arXiv preprint arXiv:2410.14292, 2024]. The first-order schemes are designed to preserve the still water equilibria and positivity of water height, as well as to deal with wet-dry fronts. Extensive numerical experiments are tested to validate the advantages and robustness of the proposed scheme.

math.NA↗
arXiv2025

Some new properties of an Active flux type scheme: PamPa

In this paper, we provide a few new properties of Active Flux (AF)/Point-Average-Moment PolynomiAl-interpreted (\pampa) schemes. First, we show, in full generality, that the AF/pampa schemes can be interpreted in such a way that the discontinuous Galerkin (dG) scheme is one of their building blocks. Secondly we provide intrinsic bound preserving properties of the current variant of pampa. This is also illustrated numerically. Last, we show, at least in one dimension, that the pampa scheme has the summation by part (SBP) property.

math.NA↗
arXiv2025

Flux Globalization Based Well-Balanced Path-Conservative Central-Upwind Schemes for Shallow Water Linearized Moment Equations

We develop second-order path-conservative central-upwind (PCCU) schemes for the hyperbolic shallow water linearized moment equations (HSWLME), which are an extension of standard depth-averaged models for free-surface flows. The proposed PCCU schemes are constructed via flux globalization strategies adapted to the nonconservative form via a path-conservative finite-volume method. The resulting scheme is well-balanced (WB) in the sense that it is capable of exactly preserving physically relevant steady states including moving-water ones. We validate the proposed scheme on several benchmarks, including smooth solutions, small perturbation of steady states, and dam-break scenarios. These results demonstrate that our flux globalization based WB PCCU schemes provide a reliable framework for computing solutions of shallow water moment models with nonlinear and nonconservative features.

math.NA↗
arXiv2024

A Novel and Simple Invariant-Domain-Preserving Framework for PAMPA Scheme: 1D Case

The PAMPA (Point-Average-Moment PolynomiAl-interpreted) method, proposed in [R. Abgrall, Commun. Appl. Math. Comput., 5: 370-402, 2023], combines conservative and non-conservative formulations of hyperbolic conservation laws to evolve cell averages and point values. Solutions to hyperbolic conservation laws typically have an invariant domain, and ensuring numerical solutions stay within this domain is essential yet nontrivial. This paper presents a novel framework for designing efficient Invariant-Domain-Preserving (IDP) PAMPA schemes. We first analyze the IDP property for updated cell averages in the original PAMPA scheme, revealing the role of cell average decomposition and midpoint values in maintaining the invariant domain. This analysis highlights the difficulty of relying on continuous fluxes alone to preserve the invariant domain. Building on these insights, we introduce a simple IDP limiter for cell midpoint values, and propose a provably IDP PAMPA scheme that guarantees the preservation of the invariant domain for updated cell averages without requiring post-processing limiters. This approach contrasts with existing bound-preserving PAMPA schemes, which often require additional convex limiting to blend high-order and low-order solutions. Most notably, inspired by the Softplus and Clipped ReLU functions from machine learning, we propose an automatic IDP reformulation of the governing equations, resulting in an unconditionally limiter-free IDP scheme for evolving point values. We also introduce techniques to suppress spurious oscillations, enabling the scheme to capture strong shocks effectively. Numerical experiments on 1D problems, including the linear convection equation, Burgers equation, the compressible Euler equations, and MHD equations, demonstrate the accuracy and robustness of the proposed IDP PAMPA scheme.

math.NA↗
arXiv2024

Virtual finite element and hyperbolic problems: the PAMPA algorithm

In this paper, we explore the use of the Virtual Element Method concepts to solve scalar and system hyperbolic problems on general polygonal grids. The new schemes stem from the active flux approach \cite{AF1}, which combines the usage of point values at the element boundaries with an additional degree of freedom representing the average of the solution within each control volume. Along the lines of the family of residual distribution schemes introduced in \cite{Abgrall_AF,abgrall2023activefluxtriangularmeshes} \red{that integrate the active flux technique}, we devise novel third order accurate methods that rely on the VEM technology to discretize gradients of the numerical solution by means of a polynomial-free approximation, \red{by} adopting a virtual basis that is locally defined for each element. The obtained discretization is globally continuous, and for nonlinear problems it needs a stabilization which is provided by \new{a monolithic convex limiting strategy extended from \cite{Abgrall_BP_PAMPA}}. This is applied to both point and average values of the discrete solution. We show applications to scalar problems, as well as to the acoustics and Euler equations in two dimension. The accuracy and the robustness of the proposed schemes are assessed against a suite of benchmarks involving smooth solutions, shock waves and other discontinuities.

math.NA↗
arXiv2024

A positive- and bound-preserving vectorial lattice Boltzmann method in two dimensions

We present a novel positive kinetic scheme built on the efficient collide-and-stream algorithm of the lattice Boltzmann method (LBM) to address hyperbolic conservation laws. We focus on the compressible Euler equations with strong discontinuities. Starting from the work of Jin and Xin [20] and then [4,8], we show how the LBM discretization procedure can yield both first- and second-order schemes, referred to as vectorial LBM. Noticing that the first-order scheme is convex preserving under a specific CFL constraint, we develop a blending strategy that preserves both the conservation and simplicity of the algorithm. This approach employs convex limiters, carefully designed to ensure either positivity (of the density and the internal energy) preservation (PP) or well-defined local maximum principles (LMP), while minimizing numerical dissipation. On challenging test cases involving strong discontinuities and near-vacuum regions, we demonstrate the scheme accuracy, robustness, and ability to capture sharp discontinuities with minimal numerical oscillations.

math.NA↗
arXiv2024

Bound preserving Point-Average-Moment PolynomiAl-interpreted (PAMPA) scheme: one-dimensional case

We propose a bound-preserving (BP) Point-Average-Moment PolynomiAl-interpreted (PAMPA) scheme by blending third-order and first-order constructions. The originality of the present construction is that it does not need any explicit reconstruction within each element, and therefore the construction is very flexible. The scheme employs a classical blending approach between a first-order BP scheme and a high-order scheme that does not inherently preserve bounds. The proposed BP PAMPA scheme demonstrates effectiveness across a range of problems, from scalar cases to systems such as the Euler equations of gas dynamics. We derive optimal blending parameters for both scalar and system cases, with the latter based on the recent geometric quasi-linearization (GQL) framework of [Wu \& Shu, {\em SIAM Review}, 65 (2023), pp. 1031--1073]. This yields explicit, optimal blending coefficients that ensure positivity and control spurious oscillations in both point values and cell averages. This framework incorporates a convex blending of fluxes and residuals from both high-order and first-order updates, facilitating a rigorous BP property analysis. Sufficient conditions for the BP property are established, ensuring robustness while preserving high-order accuracy. Numerical tests confirm the effectiveness of the BP PAMPA scheme on several challenging problems.

math.NA↗
arXiv2024

A Well-balanced Point-Average-Moment PolynomiAl-interpreted (PAMPA) Method for Shallow Water Equations with Horizontal Temperature Gradients

In this paper, we develop a novel well-balanced Point-Average-Moment PolynomiAl-interpreted (PAMPA) numerical method for solving the two-dimensional shallow water equations with temperature gradients on unstructured triangular meshes. The proposed PAMPA method use a globally continuous representation of the variables, with degree of freedoms (DoFs) consisting of point values on the edges and average values within each triangular element. The update of cell averages is carried out using a conservative form of the partial differential equations (PDEs), while the update of point values -- unconstrained by local conservation -- follows a non-conservative formulation. The powerful PAMPA framework offers great flexibility in the choice of variables for the non-conservative form, including conservative variables, primitive variables, and other possible sets of variables. In order to preserve a wider class of steady-state solutions, we introduce pressure-momentum-temperature variables instead of using the standard conservative or primitive ones. By utilizing these new variables and the associated non-conservative form, along with adopting suitable Gaussian quadrature rules in the discretization of conservative form, we prove that this new class of schemes is well-balanced for both ``lake at rest'' and isobaric steady states. We validate the performance of the proposed well-balanced PAMPA method through a series of numerical experiments, demonstrating their high-order accuracy, well-balancedness, and robustness.

math.NA↗
arXiv2024

Active flux for triangular meshes for compressible flows problems

In this article, we show how to construct a numerical method for solving hyperbolic problems, whether linear or nonlinear, using a continuous representation of the variables and their mean value in each triangular element. This type of approach has already been introduced by Roe, and others, in the multidimensional framework under the name of Active flux, see \cite{AF1,AF2,AF3,AF4,AF5}. Here, the presentation is more general and follows \cite{Abgrall_AF,BarzukowAbgrall}. { Various} examples show the good behavior of the method in both linear and nonlinear cases, including non-convex problems. The expected order of precision is obtained in both the linear and nonlinear cases. This work represents a step towards the development of methods in the spirit of virtual finite elements for linear or nonlinear hyperbolic problems, including the case where the solution is not regular.

math.NA↗
arXiv2024

An Arbitrarily High-Order Fully Well-balanced Hybrid Finite Element-Finite Volume Method for a One-dimensional Blood Flow Model

We propose an arbitrarily high-order accurate, fully well-balanced numerical method for the one-dimensional blood flow model. The developed method employs a continuous solution representation, combining conservative and primitive formulations. Degrees of freedom are point values at cell interfaces and moments of conservative variables within cells. \bla{The well-balanced property -- ensuring exact preservation of zero and non-zero velocity steady-state solutions while accurately capturing small perturbations -- is achieved through two key components. First, in the evolution of the moments, a local reference steady-state solution is obtained and subtracted. Second, the point value update happens in equilibrium variables. Extensive numerical tests are conducted to validate the preservation of various steady-state solutions, robust capturing small perturbations to such solutions, and high-order accuracy for both smooth and discontinuous solutions.

math.NA↗
arXiv2023

A New Approach for Designing Well-Balanced Schemes for the Shallow Water Equations: A Combination of Conservative and Primitive Formulations

In this paper, we introduce a new approach for constructing robust well-balanced numerical methods for the one-dimensional Saint-Venant system with and without the Manning friction term. Following the idea presented in [R. Abgrall, Commun. Appl. Math. Comput. 5(2023), pp. 370-402], we first combine the conservative and non-conservative (primitive) formulations of the studied conservative hyperbolic system in a natural way. The solution is globally continuous and described by a combination of point values and average values. The point values and average values will then be evolved by two different forms of PDEs: a conservative version of the cell averages and a possibly non-conservative one for the points. We show how to deal with both the conservative and non-conservative forms of PDEs in a well-balanced manner. The developed schemes are capable of exactly preserving both the still-water and moving-water equilibria. Compared with existing well-balanced methods, this new class of scheme is nonlinear-equations-solver-free. This makes the developed schemes less computationally costly and easier to extend to other models. We demonstrate the behavior of the proposed new scheme on several challenging examples.

math.NA↗
arXiv2020

Sparse approximation of data-driven Polynomial Chaos expansions: an induced sampling approach

One of the open problems in the field of forward uncertainty quantification (UQ) is the ability to form accurate assessments of uncertainty having only incomplete information about the distribution of random inputs. Another challenge is to efficiently make use of limited training data for UQ predictions of complex engineering problems, particularly with high dimensional random parameters. We address these challenges by combining data-driven polynomial chaos expansions with a recently developed preconditioned sparse approximation approach for UQ problems. The first task in this two-step process is to employ the procedure developed in (Ahlfeld et al. 2016) to construct an "arbitrary" polynomial chaos expansion basis using a finite number of statistical moments of the random inputs. The second step is a novel procedure to effect sparse approximation via $\ell^1$ minimization in order to quantify the forward uncertainty. To enhance the performance of the preconditioned $\ell^1$ minimization problem, we sample from the so-called induced distribution, instead of using Monte Carlo (MC) sampling from the original, unknown probability measure. We demonstrate on test problems that induced sampling is a competitive and often better choice compared with sampling from asymptotically optimal measures (such as the equilibrium measure) when we have incomplete information about the distribution. We demonstrate the capacity of the proposed induced sampling algorithm via sparse representation with limited data on test functions, and on a Kirchoff plating bending problem with random Young's modulus.

math.NA↗
arXiv2019

A Well-Balanced Central-Upwind Scheme for the Thermal Rotating Shallow Water Equations

We develop a well-balanced central-upwind scheme for rotating shallow water model with horizontal temperature and/or density gradients---the thermal rotating shallow water (TRSW). The scheme is designed using the flux globalization approach: first, the source terms are incorporated into the fluxes, which results in a hyperbolic system with global fluxes; second, we apply the Riemann-problem-solver-free central-upwind scheme to the rewritten system. We ensure that the resulting method is well-balanced by switching off the numerical diffusion when the computed solution is near (at) thermo-geostrophic equilibria. The designed scheme is successfully tested on a series of numerical examples. Motivated by future applications to large-scale motions in the ocean and atmosphere, the model is considered on the tangent plane to a rotating planet both in mid-latitudes and at the Equator. The numerical scheme is shown to be capable of quite accurately maintaining the equilibrium states in the presence of nontrivial topography and rotation. Prior to numerical simulations, an analysis of the TRSW model based on the use of Lagrangian variables is presented, allowing one to obtain criteria of existence and uniqueness of the equilibrium state, of the wave-breaking and shock formation, and of instability development out of given initial conditions. The established criteria are confirmed in the conducted numerical experiments.

math.NA↗
arXiv2018

Data-driven polynomial chaos expansions: a weighted least-square approximation

In this work, we combine the idea of data-driven polynomial chaos expansions with the weighted least-square approach to solve uncertainty quantification (UQ) problems. The idea of data-driven polynomial chaos is to use statistical moments of the input random variables to develop an arbitrary polynomial chaos expansion, and then use such data-driven bases to perform UQ computations. Here we adopt the bases construction procedure by following \cite{Ahlfeld_2016SAMBA}, where the bases are computed by using matrix operations on the Hankel matrix of moments. Different from previous works, in the postprocessing part, we propose a weighted least-squares approach to solve UQ problems. This approach includes a sampling strategy and a least-squares solver. The main features of our approach are two folds: On one hand, our sampling strategy is independent of the random input. More precisely, we propose to sampling with the equilibrium measure, and this measure is also independent of the data-driven bases. Thus, this procedure can be done in prior (or in a off-line manner). On the other hand, we propose to solve a Christoffel function weighted least-square problem, and this strategy is quasi-linearly stable -- the required number of PDE solvers depends linearly (up to a logarithmic factor) on the number of (data-driven) bases. This new approach is thus promising in dealing with a class of problems with epistemic uncertainties. Several numerical tests are presented to show the effectiveness of our approach.

math.NA↗
arXiv2018

Stochastic collocation methods via minimization of Transformed $L_1$ penalty

We study the properties of sparse reconstruction of transformed $\ell_1$ (TL1) minimization and present improved theoretical results about the recoverability and the accuracy of this reconstruction from undersampled measurements. We then combine this method with the stochastic collocation approach to identify the coefficients of sparse orthogonal polynomial expansions for uncertainty quantification. In order to implement the TL1 minimization, we use the DCA-TL1 algorithm which was introduced by Zhang and Xin. In particular, when recover non-sparse functions, we adopt an adaptive DCA-TL1 method to guarantee the sparest solutions. Various numerical examples, including sparse polynomial functions recovery and non-sparse analytical functions recovery are presented to demonstrate the recoverability and efficiency of this novel method and its potential for problems of practical interests.

math.NA↗