Pith. sign in

REVIEW 4 major objections 10 minor 17 references

Construction of entropy satisfying Active Flux-type methods

T0 review · 4 major / 10 minor · reviewed 2026-07-31 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read For Active Flux schemes, entropy stability only needs to be enforced on cell averages; point values can be left alone.

desk verdict Clean structural result for Active Flux entropy (averages suffice), but the practical Tadmor limiter as written does not actually guarantee the edge inequality the proof needs. read the letter →

arxiv 2607.25111 v2 pith:CNMJIR24 submitted 2026-07-27 math.NA cs.NA

Remi Abgrall , Yongle Liu This is my paper · ORCID
classification math.NAcs.NA MSC 65M0865M1235L65
keywords ActiveFluxentropystabilityTadmorframeworkcellaveragesboundpreservinghyperbolicconservationlawsKPPproblemblendedfluxes
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Active Flux-type methods track two kinds of unknowns: cell averages and point values on element boundaries. This paper shows that, for a hyperbolic system with one entropy, a semi-discrete entropy inequality on the averages alone is enough for the limit solution to satisfy the entropy inequality; the point-value degrees of freedom drop out of the argument. The authors then build a single blended scheme that is bound-preserving, non-oscillatory, and entropy-diminishing by blending a high-order flux with a Rusanov flux on each edge, choosing the blend parameter so that Tadmor’s edge-wise entropy production stays non-negative. On the KPP problem, known to be extremely sensitive to entropy, the entropy blend alone already produces the correct rotational wave structure (with the expected wiggles), confirming that controlling averages is sufficient. The same construction extends unchanged to polygonal meshes.

What carries the argument

Tadmor-style edge entropy production Θ(ℓ) for the blended numerical flux: the largest admissible blend parameter ℓ★ is taken so that Θ(ℓ) ≥ 0 on every edge, guaranteeing a semi-discrete entropy inequality for the cell averages alone.

What would settle it

Run the KPP problem with the entropy blend turned off on the averages while keeping high-order point updates: if the rotational wave structure collapses to a wrong entropy solution, the claim that averages alone control entropy fails.

Watch

Extended reading notes

Core claim

In Active Flux-type schemes the only quantity that must satisfy a semi-discrete entropy inequality is the cell average; the point-value updates play no role in the entropy Lax–Wendroff argument. Consequently an edge-wise blend between a high-order flux and a Rusanov flux, chosen so that Tadmor’s production term remains non-negative, yields a limit solution that obeys the entropy inequality.

Load-bearing premise

Entropy is enforced only at the semi-discrete level; the paper does not prove that the blend preserves the formal high-order accuracy of the unblended scheme.

Editorial extensions

If this is right

  • Entropy-stable Active Flux schemes can be obtained by acting only on the finite-volume update of the averages.
  • The same edge-blend construction carries over unchanged to polygonal and virtual-element meshes.
  • Bound-preserving, oscillation-control and entropy conditions can be combined into a single monolithic limiter without separate stages.
  • Higher-order Active Flux extensions need only an entropy-stable average update; point residuals may keep their existing high-order form.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because point values are free of the entropy constraint, one can design them purely for accuracy or positivity while the averages carry the thermodynamic consistency.
  • The same average-only argument should apply to other hybrid DOF schemes (residual-distribution, certain DG–FV hybrids) that already possess a conservative cell-average update.
  • A fully discrete entropy proof would still be needed before the method can be certified for long-time or steady-state entropy-critical flows.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 10 minor

Summary. The paper analyses entropy stability of Active Flux-type (PAMPA) schemes, which evolve both cell averages and point values on element boundaries. After a truncation-error analysis and a Lax–Wendroff-type theorem with consistency assumptions refined relative to earlier work (the point-value residual condition (11) is deliberately weak), the authors prove their central structural result (Proposition 3.1): if the semi-discrete scheme for the cell averages satisfies a per-edge entropy inequality (12), then any L²-limit satisfies the entropy inequality, with no condition on the point values beyond boundedness. They then construct a blended low/high-order flux for the average update in Tadmor's framework, reducing the per-edge condition to a scalar inequality A−ℓB≥0 (16), and combine this with previous bound-preserving and oscillation-elimination limiters. The method is demonstrated on the Kurganov–Petrova–Popov test case, where the entropy correction is shown numerically to select the correct entropy solution even when the point values are left unlimited. The authors state openly that the entropy property is semi-discrete only and that compatibility with formal high-order accuracy is not proved.

Significance. If the limiter issue in §3.2 is repaired, this is a useful and cleanly argued contribution: it reduces entropy stability of Active Flux-type schemes to a property of the cell-average update alone (Prop. 3.1), refines the consistency assumptions relative to [1], and delivers a monolithic BP + oscillation-elimination + entropy construction demonstrated on the notoriously entropy-sensitive KPP problem, where the corrected scheme visibly selects the right solution while remaining much sharper than Rusanov. The entropy construction is derived from standard convex-entropy calculus rather than fitted, and the falsifiable per-edge condition (16) is a concrete, checkable design criterion. The honest statement of open issues (semi-discrete only; accuracy not yet proved) is a strength, though the absence of any convergence study weakens the high-order claim.

major comments (4)
  1. [§3.2, Eqs. (16)-(17)] §3.2, Eqs. (16)–(17): Prop. 3.1 applies only if the per-edge condition (12) holds, which §3.2 reduces to Θ(ℓ)=A−ℓB≥0 with A=⟨Δv,f̂LO⟩−Δψ·n≥0 (Rusanov) and B=−⟨Δv,f̂HO−f̂LO⟩. The provably safe cap is ℓ≤A/B. The limiter actually proposed, φ_α=1−αB for B>0 with α≥1/4, is only shown to lie below 1/B (discriminant αB²−B+1≥0). But A is unnormalized and can be arbitrarily small (A≈(α_e/2)|Δv|² in weakly varying regions), so φ_α can exceed A/B: e.g. A=0.1, B=0.9, α=1/2 gives Θ=0.1−0.495<0. Hence hypothesis (12) is not established for the scheme as written in (17); the entropy property of the implemented method is empirical. The fix looks easy (exact cap, or ℓ=φ_α(B/A), for which the same discriminant argument gives φ_α(B/A)≤A/B). Please state precisely what is proved for the limiter actually used, and re-run the tests with a provably safe variant.
  2. [§4-5, accuracy of the blended scheme] The paper claims a high-order method, but the entropy blend's effect on formal accuracy is supported neither analytically (acknowledged in §5) nor numerically: the only test is KPP, with no convergence or EOC study on a smooth problem. In smooth regions B=−⟨Δv,f̂HO−f̂LO⟩ should be O(h³) (Δv=O(h), flux discrepancy O(h²)), so φ_α=1−αB deactivates at a rate plausibly compatible with the O(h³) truncation target of §2.2. This should at least be checked numerically (smooth Euler or advection test with EOC table); without it, the 'high order' character of the entropy-corrected scheme is unverified.
  3. [§3.2 vs. time discretisation (§2.1, §5)] The entropy inequality is proved only for the semi-discrete scheme (Tadmor's framework), while the computations use SSP Runge–Kutta in time. Lemmas 3.2–3.3 show the first-order building blocks do admit fully discrete entropy inequalities under CFL, so the gap is not intrinsic to the fluxes but to the blending construction. Given that the title and abstract advertise 'entropy satisfying' methods, the paper should either provide a fully discrete statement (e.g. via a convex-limiting interpretation of the blend under a CFL condition) or explicitly discuss the status and practical relevance of the semi-discrete-only guarantee.
  4. [Prop. 3.1, hypothesis 4 of Prop. 2.4; Fig. 3] Prop. 3.1 inherits hypothesis 4 of Prop. 2.4: a uniform L∞ bound on the point values u_σ. Yet the experiment central to the headline claim that 'only the averages matter' (Fig. 3, entropy limiter on averages, unlimited high-order point update) reports u_σ∈[−25.56,39.29]. On a fixed mesh this is harmless, but the uncontrolled point values are exactly what the theorem needs bounded as h→0; moreover wild point values feed f̂HO and can inflate B, aggravating the issue in comment 1. Please discuss the status of this hypothesis; a mesh-refinement study showing that the averages converge to the KPP entropy solution would substantiate the claim.
minor comments (10)
  1. [§2.1 (3c) vs. §3.2 (14)] The role of ℓ_e is inconsistent: in (3c) ℓ_e multiplies the high-order flux, while in (14) (1−ℓ_e) multiplies ∫f(u)·n and ℓ_e multiplies f̂LO; (16) then treats ℓ as the high-order weight. Please harmonise.
  2. [§1, Eq. (1)-(2)] Eq. (1): the entropy inequality should read ∂η/∂t + div g(u) ≤ 0 (div is missing).
  3. [§3.1, Lemma 3.3] Lemma 3.3: the update is written 'u^{n+1}_K = u^{n+1}_K − ...'; the right-hand side should be u^n_K.
  4. [§3.1, Lemma 3.2] Lemma 3.2, item 2: the CFL is stated as Δt/|K| ≤ 1/6, but the proof uses 6αΔt/|K| ≤ 1; the statement should include the wave-speed factor.
  5. [§3.1, Eq. (13)] Eq. (13): index mismatch n^{T^K_j} vs. T^K_i; also η(u)^{T^K_i} is defined with a sum over σ_j but written σ_l.
  6. [§3.2, Figure 2] Figure 2 is load-bearing for the choice (17) but its dotted curves are never identified: is the hyperbola 1/B or A/B (and for which A)? Labelling it would make the gap in comment 1 explicit to readers.
  7. [§4, Table 1] Table 1: several entries read '11.' with a trailing period; please clean the formatting.
  8. [§4, footnote 2] Footnote 2 (wrong global extrema in the published [3]) is important for interpreting the BP-only KPP results; it deserves to be in the main text with a precise statement of what was mis-set.
  9. [throughout] Typos: 'consistant' (Prop. 2.4), 'arewriting' (§2.2), 'sens of finite element' (§2.1), 'from bellow' (Prop. 2.4), 'thermo-dynamically consistant' (§1), 'Rusanov soluton' (Fig. 6 caption).
  10. [§3, proof of Prop. 3.1] Since the scheme evolves η(u_σ) through v(u_σ)^TωΦ in Prop. 3.1's proof, a remark clarifying that boundedness of v(u_σ) follows from hypothesis 4 and strict convexity of η would help the reader.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: entropy-on-averages claim is a self-contained Lax–Wendroff argument; Tadmor limiter is external calculus, not a fit or self-forced uniqueness.

full rationale

The load-bearing structural claim (Proposition 3.1) is proved inside the paper from the rewritten weak form (8)–(10) and the average entropy inequality (12); the point-value residuals drop out of the entropy Lax–Wendroff limit by the same estimates already used for conservation (Lemma 2.5–2.6), without defining the target in terms of itself. The per-edge condition Θ(ℓ_e)=A−ℓ_e B≥0 is the standard Tadmor entropy-flux identity applied to a convex blend of Rusanov and high-order fluxes; A≥0 is inherited from the classical Rusanov entropy stability, not from a fit to KPP or any other target. The practical map φ_α (α=1/2) is an explicit free safety factor, not a parameter calibrated so that a ‘prediction’ is forced. Self-citations to BP_Pampa_VEM and PampaDG supply the bound-preserving and oscillation-elimination ingredients that are merely combined with the new entropy blend; they do not underwrite the averages-only entropy theorem, nor do they import a uniqueness result that forbids alternatives. The KPP experiment is an external falsifiable check, not a fitted input renamed as prediction. Correctness concerns about whether φ_α always stays below A/B (rather than 1/B) are real but belong to correctness risk, not circularity: the derivation chain does not reduce the claimed entropy inequality to its own inputs by construction.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The work sits on standard hyperbolic entropy theory, Tadmor’s semi-discrete entropy-flux framework, Rusanov entropy stability, and the authors’ prior PAMPA residual/BP/OE constructions. New free choices are the safety factor α in the entropy blend and the specific positive ε_σ^K scaling. No new physical entities are postulated.

free parameters (2)
  • α in φ_α entropy blend (Eq. 17) = 1/2
    Hand-chosen safety factor so ℓ stays strictly below the A−ℓB=0 hyperbola; paper states α≥1/4 and uses α=1/2 in practice. Affects how much high-order flux is kept.
  • ε_σ^K in high-order point residual = |K|/2
    Stabilization scale in Φ_HO; set to |K|/2 with the remark that only positivity matters. Influences point-value dissipation independently of the entropy blend.
assumptions (5)
  • domain assumption System admits a strictly convex entropy η with entropy flux g (∇η)^T f' = ∇g, and solutions satisfy the entropy inequality in the distributional sense.
    Stated in §1 as the standing assumption for the whole analysis.
  • domain assumption Tadmor’s semi-discrete entropy stability criterion on numerical fluxes (edge-wise condition on entropy variables and potential) is the target entropy notion.
    Explicitly adopted in §3.2; fully discrete entropy is not claimed.
  • standard math Rusanov flux with sufficiently large α_e is entropy stable and invariant-domain preserving under a CFL restriction.
    Used as the LO building block; classical, cited via Guermond–Popov line.
  • domain assumption Family of meshes is shape-regular; numerical flux is consistent and Lipschitz; point residuals satisfy the weak consistency bound (11); discrete solutions bounded in L^∞ and converge in L^2.
    Hypotheses of Prop. 2.4 (Lax–Wendroff-like theorem).
  • ad hoc to paper Prior PAMPA BP limiter [3] and OE limiter [5] may be composed with the new entropy ℓ_e without destroying the semi-discrete entropy inequality on averages.
    Monolithic scheme is asserted and illustrated numerically; no separate proof that simultaneous activation preserves all three properties at once beyond the average entropy condition.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Construction of entropy satisfying Active Flux-type methods." pith.science (2026). https://pith.science/paper/CNMJIR24

@misc{pith2026260725111,
  author       = {Pith},
  title        = {Pith review of: Construction of entropy satisfying Active Flux-type methods},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CNMJIR24}},
  note         = {Machine review of arXiv:2607.25111}
}
read the original abstract

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}.

Figures

Figures reproduced from arXiv: 2607.25111 by the authors.

Figure 1
Figure 1. Geometry notations. We need to specify the high order and low order residuals in (3e). The high order residual ΦHO,K σ is defined as: ΦHO,K σ = Nσ Kσ + + ε K σ I  Kσ · ∇uh(xσ). (3f) Here, we have set Kσ = ∇f(uσ) · n K σ , ε K σ > 0. The normal n K σ is defined as the sum of the outward normals of the two segments that share σ, see [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Graphical representation of the condition [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗
Figure 3
Figure 3. KPP solution when only the ’entropy’ limiter is used on the average, and the fully high order [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: KPP problem, average values, (a): BP solution, (b) BP with OE, (c): BP with OE and entropy [PITH_FULL_IMAGE:figures/full_fig_p017_4.png]
Figure 5
Figure 5. Figure 5: KPP problem, point values, (a): BP solution, (b) BP with OE, (c): BP with OE and entropy [PITH_FULL_IMAGE:figures/full_fig_p018_5.png]
Figure 6
Figure 6. Figure 6: KPP problem, zoom of the mesh and the isovalues of the solution for: Tadmor correction only, [PITH_FULL_IMAGE:figures/full_fig_p019_6.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 3 linked inside Pith

  1. [1]

    R. Abgrall. “A combination of residual distribution and the active flux formulations or a new class of schemes that can combine several writings of the same hyperbolic problem: application to the 1D Euler equations”. English. In:Commun. Appl. Math. Comput.5.1 (2023), pp. 370–402

    2023

  2. [2]

    Extensions of active flux to arbitrary order of accuracy

    R. Abgrall and W. Barsukow. “Extensions of active flux to arbitrary order of accuracy”. English. In: ESAIM, Math. Model. Numer. Anal.57.2 (2023), pp. 991–1027

    2023

  3. [3]

    Virtual finite element and hyperbolic problems: The PAMPA algorithm

    R. Abgrall, W. Boscheri, and Y. Liu. “Virtual finite element and hyperbolic problems: The PAMPA algorithm”. In:J. Comput. Phys546 (2026), p. 114521. arXiv:2502.10069

    arXiv 2026

  4. [4]

    Active flux for triangular meshes for compressible flows problems

    R. Abgrall, J. Lin, and Y. Liu. “Active flux for triangular meshes for compressible flows problems”. In:Beijing Journal of Pure and Applied Mathematics2 (2025), pp. 1–33

    2025

  5. [5]

    Robust PAMPA scheme in the DG formulation on unstructured tri- angular meshes: Bound preservation, oscillation elimination, and boundary conditions

    R´ emi Abgrall and Yongle Liu. “Robust PAMPA scheme in the DG formulation on unstructured tri- angular meshes: Bound preservation, oscillation elimination, and boundary conditions”. In:Journal of Computational Physics(2026), p. 114962. arXiv:2511.16180

    arXiv 2026

  6. [6]

    Some new properties of an active flux type scheme: PamPa

    R´ emi Abgrall, Yongle Liu, and Philipp ¨Offner. “Some new properties of an active flux type scheme: PamPa”. English. In:J. Sci. Comput.108.2 (2026). Id/No 61, p. 32. arXiv:2508.17147

    arXiv 2026

  7. [7]

    Wasilij Barsukow, Praveen Chandrashekar, Christian Klingenberg, and Lisa Lechner.A generalized Active Flux method of arbitrarily high order in two dimensions. 2025. arXiv:2502.05101 [math.NA]. 20

    arXiv 2025

  8. [8]

    Embedded discontinuous Galerkin transport schemes with localised limiters

    C. J. Cotter and D. Kuzmin. “Embedded discontinuous Galerkin transport schemes with localised limiters”. In:J. Comput. Phys.311 (2016), pp. 363–373

    2016

Show all 17 references
  1. [9]

    Godlewski and P.-A

    E. Godlewski and P.-A. Raviart.Numerical approximation of hyperbolic systems of conservation laws. English. Applied Mathematical Sciences. 118. New York, NY: Springer. viii, 509 p. DM 88.00; ¨ oS 642.40; sFr 77.50, 1996

    1996

  2. [10]

    Invariant domains and first-order continuous finite element approxi- mation for hyperbolic systems

    J.-L. Guermond and B. Popov. “Invariant domains and first-order continuous finite element approxi- mation for hyperbolic systems”. In:SIAM J. Numer. Anal.54.2466–2489 (2016)

    2016

  3. [11]

    Second-order invariant domain preserving approximation of the Euler equations using convex limiting

    Jean-Luc Guermond, Murtazo Nazarov, Bojan Popov, and Ignacio Tomas. “Second-order invariant domain preserving approximation of the Euler equations using convex limiting”. In:SIAM J. Sci. Comput.40.5 (2018), A3211–A3239

    2018

  4. [12]

    Fast estimation from above of the maximum wave speed in the Riemann problem for the Euler equations

    Jean-Luc Guermond and Bojan Popov. “Fast estimation from above of the maximum wave speed in the Riemann problem for the Euler equations”. English. In:J. Comput. Phys.321 (2016), pp. 908–926

    2016

  5. [13]

    A Lax-Wendroff type theorem for upwind finite volume schemes in 2-d

    D. Kr¨ oner, M. Rokyta, and M. Wierse. “A Lax-Wendroff type theorem for upwind finite volume schemes in 2-d.” In:East-West J. Numer. math.4.4 (1996), pp. 279–292

    1996

  6. [14]

    Adaptive semidiscrete central-upwind schemes for nonconvex hyperbolic conservation laws

    Alexander Kurganov, Guergana Petrova, and Bojan Popov. “Adaptive semidiscrete central-upwind schemes for nonconvex hyperbolic conservation laws”. In:SIAM J. Sci. Comput.29.6 (2007), pp. 2381– 2401

    2007

  7. [15]

    Failsafe flux limiting and constrained data projections for equations of gas dynamics

    D. Kuzmin, M. M¨ oller, J. N. Shadid, and M. Shashkov. “Failsafe flux limiting and constrained data projections for equations of gas dynamics”. In:J. Comput. Phys.229 (2010), pp. 8766–8779

    2010

  8. [16]

    Flux-corrected transport algorithms for continuous Galerkin methods based on high order Bernstein finite elements

    C. Lohmann, D. Kuzmin, J. N. Shadid, and S. Mabuza. “Flux-corrected transport algorithms for continuous Galerkin methods based on high order Bernstein finite elements”. In:J. Comput. Phys.344 (2017), pp. 151–186

    2017

  9. [17]

    Entropy stability theory for difference approximations of nonlinear conservation laws and related time-dependent problems

    Eitan Tadmor. “Entropy stability theory for difference approximations of nonlinear conservation laws and related time-dependent problems”. In:Acta Numerica12 (2003), pp. 451–512. A Proof of Lemma 2.6 Proof of lemma 2.6.We show that lim h→0 NX n=0 ∆t X K⊂Q X σ∈K ∥un+1 σ −u n σ∥...

    2003

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.