REVIEW 3 major objections 4 minor
Monotone-based Numerical Schemes for Two-Dimensional Systems of Nonlocal Conservation Laws
T0 review · 3 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash
Pith's one-line read A class of monotone finite-volume schemes converges for 2D systems of nonlocal conservation laws.
desk verdict A serious 2D convergence framework for monotone-based nonlocal schemes, with a real but fixable gap: the discrete entropy condition is stated without proof. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the monotone-based numerical flux function from Definition 3.2 — a numerical flux that is consistent with the approximated nonlocal flux at each cell interface, nondecreasing in its own cell value and nonincreasing in the neighbour's, Lipschitz, and constrained by a fourth condition: shifting the flux evaluation one cell in the transverse direction must change it by at most a local variation Δx|ρ_{i,j}−ρ_{i−1,j}| plus a quadratic term Δx²M|ρ|. This fourth condition, assumption 4, is the load-bearing piece: it makes the spatial total-variation estimate (Theorem 3.9) close, from which compactness and convergence follow. The nonlocal convolution is approximated by a compos
What would settle it
A decisive test: implement the Godunov-type scheme (10) on the two-population crowd model (33) on a sequence of refined grids and check whether the discrete total variation stays uniformly bounded as Δx→0. If TV grows without bound while the flux satisfies all of Definition 3.2, the BV estimate (Theorem 3.9) and hence the convergence proof would fail; if it stays bounded but the L1 error at a fixed time decays slower than O(√Δt), the error estimate Lemma 4.4 would be contradicted.
Extended reading notes
Core claim
The central result, Theorem 3.5, states that a numerical scheme of the form (5), using a numerical flux satisfying the four conditions of Definition 3.2 (consistency with the approximated interface flux, one-sided monotonicity, Lipschitz continuity, and a transverse-variation bound) and run under the CFL condition (6), converges in L1_loc to the unique weak entropy solution of the nonlocal system (1). The scheme is not monotone in every argument because the nonlocal terms enter through the approximated flux, but it is 'monotone-based' in the local sense. Combined with Lemma 4.4, the theorem gives the worst-case convergence rate ∥ϱ(T,·) − ρΔ(T,·)∥_{L1} = O(√Δt). The results cover, in particul
Load-bearing premise
The convergence theorem leans on the fourth condition of Definition 3.2 — a bound on how the numerical flux changes when shifted one cell in the transverse direction — which the paper verifies only for the Lax-Friedrichs and multiplicative flux classes, so the result's reach is narrower than the definition's generic wording suggests.
Editorial extensions
If this is right
- Godunov-type fluxes are now rigorously justified for two-dimensional nonlocal conservation laws with multiplicative or Lax-Friedrichs-type structure, not just for local or one-dimensional problems.
- A worst-case L1 error of O(√Δt) is guaranteed for the entire scheme class, matching the optimal rate known for monotone schemes on local nonlinear problems.
- The existence and uniqueness proof applies to the general nonlocal system (1), strengthening earlier results that required linear or special fluxes.
- Since the scheme is derived from a semi-discrete form without dimensional splitting, it can serve as a starting point for higher-order extensions.
- The framework also accommodates dimensional splitting, doubling the allowable CFL number.
Reading between the lines
- Assumption 4 of Definition 3.2 is verified in the paper only for the Lax-Friedrichs flux and for multiplicative fluxes (which include Godunov-type); the theorem's practical coverage is therefore narrower than its statement 'any flux from Definition 3.2' suggests. Checking this transverse-variation bound for other monotone fluxes (e.g., Engquist-Osher) would extend the result.
- The O(√Δt) error bound is a worst-case estimate; the numerical experiments on smooth data in Section 5 show roughly first-order convergence, so the bound may not be tight for smooth solutions.
- The decoupling at each time step via interface approximation of the nonlocal terms suggests that asynchronous or parallel-in-time treatments of multi-population models could inherit the same convergence guarantees.
- The same framework could be carried to three spatial dimensions, provided the analogue of assumption 4 is formulated and verified for the chosen flux and the quadrature error of the convolution at face centers is controlled.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a class of first-order finite-volume schemes for two-dimensional systems of nonlocal conservation laws (1), based on approximating the nonlocal convolutions at cell interfaces via (4a)-(4b) and then applying well-known monotone numerical fluxes satisfying Definition 3.2. The main convergence theorem (Theorem 3.5) states that, under Assumption 2.2 and the CFL condition (6), any scheme of the form (5) with a flux from Definition 3.2 converges in L1_loc to the unique weak entropy solution of Definition 2.1. The proof is built from a maximum principle (Theorem 3.7), a BV estimate (Theorem 3.9), time-continuity (Proposition 3.10), an L∞ bound (Lemma 3.11), and a discrete entropy condition (Proposition 3.12) that is stated without proof. The paper also proves a Kuznetsov-type lemma (Lemma 4.1), uniqueness of the weak entropy solution (Theorem 4.2), and an O(√Δt) error estimate (Lemma 4.4) via a relative entropy bound (Lemma 4.3). Numerical experiments are reported for a reversible encryption-decryption model and a two-population pedestrian flow model, comparing Lax-Friedrichs-type, Upwind-type, and Godunov-type schemes.
Significance. If the missing proofs are supplied, this is a meaningful advance: it extends the one-dimensional general monotone-scheme framework of [18] to two-dimensional systems and provides a worst-case O(√Δt) error estimate without dimensional splitting. The paper's strengths are the detailed flux-difference estimates (e.g., (15b)-(19), (20a)-(22), and the five-term bound (25)), the verification of the structural condition for Lax-Friedrichs and multiplicative fluxes, and the numerical validation—in particular the clear separation between the worst-case rate 0.5 and the observed smooth-data rate approximately 1, which indicates the bound is not reverse-engineered. However, the central convergence theorem and the error estimate currently rest on an unproved discrete entropy inequality and on several estimates delegated to [3], so the contribution is not yet fully established as written.
major comments (3)
- [Section 3.1, Proposition 3.12] The discrete entropy condition is asserted with the sentence "the proof is analogue to [5, 18] and we do not go into detail here." This proposition is load-bearing: Theorem 3.5 invokes it in the Lax-Wendroff limit, and Lemma 4.3 uses it to control the term Λ1. The inequality is not a direct translation of the 1D scalar argument: it contains extra sgn(ρ^{n+1}_{i,j}−κ) terms coupled to differences of f^k across interfaces in both coordinate directions, and the nonlocal approximations R^n enter the numerical fluxes. The manuscript should provide a complete proof, or a precise reduction that accounts for all 2D and nonlocal terms, rather than leaving this to references.
- [Section 4, Lemma 4.1 and Lemma 4.3] The O(√Δt) error estimate depends on the Kuznetsov-type lemma and the relative entropy bound, but their proofs are only sketches. Lemma 4.1 refers to [3, Lem. 4.1] and says "the remaining terms can be estimated as in [3]"; Lemma 4.3 repeatedly says "similar to [3, pp.…]" and "we can proceed as in [3]" for key bounds such as (28), (29), and the eε terms. Because the flux in (1) is more general than the one in [3]—it depends explicitly on t, x, and R[ρ], and the system is genuinely two-dimensional—these references do not by themselves establish the needed estimates. Please supply full proofs or a detailed, step-by-step translation of every referenced estimate, especially for the terms involving the nonlocal flux differences and the test-function estimates.
- [Section 3, Definition 3.2 and Theorem 3.5] Assumption 4 of Definition 3.2 is the extra structural condition that makes the BV estimate (Theorem 3.9) work. It is verified only for the Lax-Friedrichs flux (7) in Appendix A and for multiplicative fluxes (8) in Proposition A.1. The introduction and abstract claim that "any monotone numerical flux" can be used, but for a generic monotone flux outside these two classes condition 4 is not established. In particular, the advertised Godunov-type scheme (10) is defined only for multiplicative fluxes. The statements should be sharpened to say that Theorem 3.5 applies to fluxes satisfying all conditions of Definition 3.2, and the paper should either prove condition 4 for a wider class or explicitly acknowledge this limitation in the main claims.
minor comments (4)
- [Definition 2.1] The space BV(R; R^K) should be BV(R^2; R^K); the symbol R appears without dimension.
- [Section 5.1] The text says the smooth initial-data example uses encryption time T=0.3, while the caption of Figure 3 and the table say t=0.75. Please harmonize these values.
- [Proof of Theorem 3.5] The phrase "a uniformly convergent subsequence in L1_loc(R^2) on every bounded interval [0,T]" is imprecise. The compactness via [29, Lem. 1] yields convergence in a space such as C([0,T];L1_loc(R^2)) or L1_loc([0,T]×R^2); please state the exact topology.
- [Throughout] There are typos: "Montone-based" in Definition 3.2, "Kruž zkov" instead of "Kružkov", "Encypted" and "inital" in Section 5.1 figures. These do not affect the mathematics but should be corrected.
Circularity Check
No significant circularity; main convergence and error-rate derivations are assumption-driven, though Prop. 3.12 is delegated without proof.
full rationale
The central chain — Def. 3.2 flux conditions, CFL (6), maximum principle (Thm. 3.7), L1 bound (Cor. 3.8), BV estimate (Thm. 3.9), time continuity (Prop. 3.10), L∞ bound (Lem. 3.11), discrete entropy condition (Prop. 3.12), Lax-Wendroff limit, Kuznetsov uniqueness (Thm. 4.2) and error estimate (Lemma 4.4) — is a deduction from stated structural assumptions, not a fit or renaming. The O(√Δt) rate follows by choosing ε, ε0 in the Kuznetsov estimate; the experiments confirm (and for smooth data exceed) the bound, so the bound is not reverse-engineered from the data. The one load-bearing step that is not independently demonstrated in the text is Prop. 3.12: "the proof is analogue to [5, 18] and we do not go into detail here." That is an omitted proof and therefore a correctness risk, and [18] is a self-citation; but the stated analogue also refers to [5] (external authors), and no statement is accepted solely because of [18]. The 2D adaptation (extra sgn(ρ−κ) terms with nonlocal R and transverse fluxes) is not shown to be a trivial identity; this strengthens the need for the missing proof but does not make the convergence theorem circular. Similarly, Assumption 4 in Def. 3.2 is a nontrivial structural condition verified for specific flux classes, not a renamed version of the conclusion. Overall no prediction reduces by construction to an input.
Assumptions & free parameters
free parameters (3)
- Viscosity coefficient α in Lax-Friedrichs fluxes (7), (9) =
α ≥ sup|∂_ρ f|; α = 7.65 and 4.5 in Sec. 5
- Model parameters in Sec. 5 (v_max, β, Rc, kernel widths ℓ) =
v_max=4.5, β=0.7, Rc=3, ℓ=2 or 0.8
- Grid aspect ratio δ = Δx1/Δx2 =
δ = 1 in all experiments; general δ > 0 in the theorems
assumptions (6)
- domain assumption Assumption 2.2(f): flux f^k ∈ C^2 ∩ W^{2,∞} with all first/second derivatives bounded by M|ρ|
- domain assumption Assumption 2.2(η): kernel η ∈ C^2 ∩ W^{2,∞} ∩ L^1
- domain assumption Assumption 2.2(ρ0): initial data in L1 ∩ L∞ ∩ BV with values in I^k
- ad hoc to paper Assumption 4 of Def. 3.2: transverse structural bound on the numerical flux
- domain assumption CFL condition (6) with factor 1/2 and fixed ratio Δx1 = δ Δx2
- standard math Kružkov-type entropy-solution framework (Def. 2.1) and the Kuznetsov lemma structure of [3]
Cite this review
Pith. "Pith review of Monotone-based Numerical Schemes for Two-Dimensional Systems of Nonlocal Conservation Laws." pith.science (2026). https://pith.science/paper/VSEL6M25
@misc{pith2026260120494,
author = {Pith},
title = {Pith review of: Monotone-based Numerical Schemes for Two-Dimensional Systems of Nonlocal Conservation Laws},
year = {2026},
howpublished = {\url{https://pith.science/paper/VSEL6M25}},
note = {Machine review of arXiv:2601.20494}
}
abstract
We present a general class of numerical schemes for two-dimensional systems of nonlocal conservation laws, which are based on utilizing well-known monotone numerical flux functions after suitably approximating the nonlocal terms. The considered systems are weakly coupled by the nonlocal terms and the underlying flux function is rather general to guarantee that our results are applicable to a wide range of common nonlocal models. We state sufficient conditions to ensure the convergence of the monotone-based numerical schemes to the unique weak entropy solution. Moreover, we provide an error estimate that yields the convergence rate of $\mathcal{O}(\sqrt{\Delta t})$ for the numerical approximations of the solution. Our results include an existence and uniqueness proof of the nonlocal system, too. Numerical results illustrate our theoretical findings.
Figures
Figures from the paper (2 more)
Reviewed August 3, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.