{"id":"4eb00005-09be-4a7a-acc5-2619c421ca07","arxiv_id":"2411.16933","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Rigorous a posteriori error estimates are derived for the leapfrog wave equation solver with time-varying meshes and local time-stepping.","lead":"This paper proves computable error bounds for an explicit finite element scheme for the wave equation when the mesh changes over time and different regions use different time steps. These bounds allow adaptive mesh refinement in explicit wave simulations while preserving the speed of explicit time stepping.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof of Theorem 4.4 leaves the first and last time layers undefined: residuals and reconstructions on the initial interval require U^{-1}/U^{N+1}, and the key bound ||σ(0)|| ≤ ||e(0)|| is asserted without proof, so the claimed fully computable bound may miss an initial-layer term.","rationale":"The reader's formal weakest assumption is mesh compatibility from Appendix A.1. That is a genuine scope condition, but the paper states it and the numerical experiment respects it, so it limits applicability without invalidating the argument when the assumption holds. A more load-bearing problem is the initial/endpoint layer in the proof of Theorem 4.4 itself. The residual definitions (3.5) and the reconstruction (3.11) do not cover the first and last time intervals, and the bound (4.34) on the initial reconstruction error is asserted without proof. Since (4.34) feeds directly into both final estimates (4.19) and (4.20), any nonzero missing initial-layer term breaks the claimed fully computable upper bound. The reader's rationale does flag (4.34) and residuals at n = 0 as under-justified, so there is partial agreement, even though the stated weakest assumption is different. I do not recommend rejection: the scheme and the interior estimates are plausible, and a correction may consist of adding ghost initial/final values and a corresponding initial-layer indicator. A conditional acceptance, with the endpoint gap closed and code or a fuller experiment provided, remains the appropriate verdict; hence the reader's CONDITIONAL verdict is unchanged.","tokens_in":26317,"tokens_out":21046,"duration_ms":186622,"concrete_test":"Perform a one-step check with N = 1, f = 0, c = 1, a uniform mesh, u_0 = 0, and v_0 a smooth function not in V_0 (e.g. sin(πx)). Implement scheme (2.54), compute U^0, V^{−1/2}, V^{1/2}, and then attempt to verify (4.34) exactly, using only quantities defined in (2.54) and (3.11). If the computation requires an undefined U^{−1} or ω^{−1}, or if ||σ(0)||_{erg,A} differs from ||e(0)||_{erg,A} by a nonzero O(Δt) term proportional to ||A_0 U^0||, then Theorem 4.4 needs an explicit initial-layer term. If, with a consistent ghost definition U^{−1} = U^0 − V^{−1/2}Δt, equality holds for this test, the gap is closable.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The residuals in (3.5) are defined only for n = 1, ..., N−1, yet the residual PDE (4.1)–(4.5) and the bounds (4.28), (4.32) are used on the intervals I_{1/2} and I_{N+1/2}, including the initial and final layers. Similarly, (3.11) defines ˘ψ(t) by integrating from t_{−1/2}, but on [t_{−1/2}, 0] the function ˆω(t) requires ω^{−1/2}, hence U^{−1} or ω^{−1}, which the scheme (2.54) never defines. The proof then relies on (4.34), which states ||σ(0)||_{erg,A} ≤ ||e(0)||_{erg,A} with no derivation. This is not a consequence of the discrete initial data being Ritz/L2 projections: the second component σ_1(0) = ˘ψ(0) − v(0) involves the quadratic reconstruction through the integral of Aˆω over [t_{−1/2}, 0] and the residual ρ^0_0, so it generally contains terms proportional to Δt A_0U^0 (or the undefined ω^{−1/2}) that are not present in ||e(0)|| if e(0) is merely (U^0 − u_0, V^{−1/2} − v_0). If these terms are not shown to cancel, Theorem 4.4 is missing an initial-layer error indicator, and the advertised fully computable bound (4.19)–(4.20) is not established. This concern is internal to the proof and independent of the mesh-compatibility assumption.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper derives a fully computable a posteriori error estimator for the Galerkin finite element solution of the wave equation with explicit leapfrog time-stepping, allowing for time-varying meshes and leapfrog-based local time-stepping. The main results, Theorem 4.4, bound the maximum energy-norm error of the displacement and the L2 error of the velocity by a sum of computable indicators: elliptic indicators, mesh-change indicators, LTS indicators, time-discretization indicators, data-approximation indicators, and an initial-error term. The proof uses elliptic reconstruction, abstract grid transfer operators, and quadratic time reconstructions. Numerical experiments for a one-dimensional Gaussian pulse on a locally refined, time-varying mesh show optimal convergence rates of the estimator with respect to mesh size.","tokens_in":80,"tokens_out":20768,"duration_ms":273741,"significance":"If correct, the result is significant: it provides the first fully computable a posteriori error bound for an explicit leapfrog finite element wave solver that simultaneously accounts for mesh change and local time-stepping, thereby opening the way to rigorous adaptive explicit wave propagation. The estimator is parameter-free and does not rely on unknown constants, and the numerical experiments confirm the expected convergence rates. The analysis builds on prior work by the authors and collaborators but extends it in a nontrivial way to time-varying conforming meshes and LTS. The abstract transfer-operator framework and the explicit treatment of mesh-change indicators are elegant and likely useful for future adaptive algorithms. However, the proof as written has gaps at the initial and final time layers that directly affect the advertised fully computable bound, so the central claim is not yet fully established.","major_comments":[{"comment":"The residuals ρ_n^0 and ρ_1^{n-1/2} are defined in (3.5) only for n = 1, ..., N−1, yet the piecewise constant extensions (3.6) sum over n = 0, ..., N. Consequently the error-residual PDE (4.5) and the bounds (4.28) and (4.32) are used on the first and last half-intervals I_{1/2} and I_{N+1/2}, where they require ρ_0^0, ρ_0^N, ρ_1^{-1/2} and ρ_1^{N-1/2}, together with quantities such as U^{-1}, ω^{-1/2}, V^{N+1/2} and ω^{N+1/2} that the scheme (2.54) never defines. The integration of ||r|| over [0,T] in (4.33) therefore is not justified as written. The authors must either define the missing ghost values and endpoint residuals explicitly, or restrict the theorem to a setting where the first and last half-intervals are handled by a separate argument.","section":"§3.3–§4.4, Eqs. (3.5), (3.6), (4.26)–(4.33)"},{"comment":"The assertion ||σ(0)||_{erg,A} ≤ ||e(0)||_{erg,A} is stated without proof and is not a consequence of the discrete initial data being Ritz/L2 projections. Indeed σ_1(0) = ˘ψ(0) − v(0), and (3.11) defines ˘ψ(0) through an integral of Aω̂ over [t_{−1/2}, 0] plus the term (Δt/2)(R_1Π_1F^0 + ρ_0^0); this generally contains contributions proportional to Δt A_0U^0 (or to the undefined ω^{−1/2}) that are not present in e(0) if e(0) is taken as the projection error (U^0 − u(0), V^{−1/2} − v(0)). If e(0) is meant to include elliptic reconstruction errors, then the estimator should also include ε_0^0 and ε_1^0 with n = 0 in the maxima of (4.19)–(4.20), which it does not. Thus the bound (4.34) needs a derivation or the statement of Theorem 4.4 must be amended with an additional initial-layer indicator.","section":"§4.4, Eq. (4.34)"},{"comment":"The mesh-change indicator µ_n^0 is defined using the intersection V_n ∩ V_{n+1}, but the transfer term it bounds in (4.27) is [R_nΠ_n − R_{n−1}]U^{n−1}, which involves the spaces V_{n−1} and V_n. Lemma A.5, which is cited for this bound, gives the estimate in terms of W ∩ V with W and V being the two finite element spaces actually involved; here that is V_{n−1} ∩ V_n. With the definition as written, the bound (4.27) is not established. The authors should correct the intersection in the definition of µ_n^0 (and in any analogous indicators) so that it matches the mesh change from V_{n−1} to V_n.","section":"§4.3, Eq. (4.13) and §4.4, Eq. (4.27)"},{"comment":"The scheme (2.55), stated as the two-step equivalent of the system form (2.54), is inconsistent with (2.54). From (2.54), U^1 = Π^1 U^0 + V^{1/2}Δt = Π^1[U^0 + V^{−1/2}Δt + (F^0 − fA_0U^0)Δt^2] = Π^1[U^0 + P_0v_0Δt + (F^0 − fA_0U^0)Δt^2/2], where the last equality uses the definition of V^{−1/2}. Equation (2.55) instead contains (F^0 − fA_0U^0)Δt^2 without the factor 1/2. Since the two schemes are claimed to be equivalent, this is an error that should be corrected.","section":"§2.10, Eq. (2.55)"}],"minor_comments":[{"comment":"The index n = ⌈2m⌉ in the definition of ζ_m appears to be a typo: for m = 1 this gives n = 2 even though the integration interval is [t_0, t_{1/2}], which should be associated with n = 1 (or n = 0 depending on convention). Please check the intended map from m to n.","section":"§4.3, Eq. (4.18)"},{"comment":"The notation 'ℓ_n(t)−1/2' in ϑ_n^0(t) is ambiguous; it should likely be 'ℓ_n(t) − 1/2' or a different expression. Please clarify the intended formula.","section":"§4.3, Eq. (4.15)"},{"comment":"The text refers to a 'Gaussian beam', but the exact solution (5.1) is a one-dimensional Gaussian pulse; consider rewording to avoid confusion with a beam in higher dimensions.","section":"§5.1, Eq. (5.1)"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses a timely and important problem, and the general strategy is sound, but the initial/final layer gap and the unproved bound (4.34) are central to the claimed fully computable result. These issues are likely repairable by adding ghost values and an initial-layer indicator or by reformulating the theorem on a time interval that avoids the half-intervals. I would encourage the editor to seek a revised version rather than rejecting, because the contribution is significant and the numerical evidence supports the viability of the estimator."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a serious attempt at the first fully discrete a posteriori error bound for explicit leapfrog with time-varying meshes and local time stepping. That is a genuine advance over Chaumont-Frelet and Ern (fixed mesh) and Karakashian and Makridakis (a priori only). The abstract grid-transfer setup is sensible, the indicator split is clean, and the elliptic estimator is user-defined, which is a nice touch. The derivations are mostly careful, and the numerical results, while limited, are consistent with the claimed rates.\n\nThe soft spots are real, and the stress-test concern hits the load-bearing point. Residuals in (3.5) are only defined for n = 1,...,N−1, but the proof uses them at n = 0 and n = N. The quadratic reconstruction (3.11) on the first interval I_{1/2} requires ω^{−1/2}, hence U^{−1}, which scheme (2.54) never defines. And (4.34) simply asserts ||σ(0)|| ≤ ||e(0)|| with no argument; as written, σ_1(0) contains an integral of Aˆω over [t_{−1/2},0] that depends on the undefined U^{−1} and generally has terms like Δt A_0 U^0 that are not part of ||e(0)|| if e(0) is just (U^0−u_0, V^{−1/2}−v_0). So the advertised fully computable bound is not established; an initial-layer indicator is missing. This is internal to the proof and independent of the mesh-compatibility assumption, which is explicitly stated and is not a flaw.\n\nThe good news is that the gap looks fixable. Extend the scheme one step backwards with U^{−1} := U^0 − Δt V^{−1/2}, define the residuals at n = 0 and n = N, and add the resulting initial-layer terms to the bound. That is a plausible repair, not a rewrite. The numerics are thin—one 1D example, no effectivity indices, no code—but that is a minor complaint next to the layer issue. Self-citations are fine here: they are tools, not the target result.\n\nWho is this for? People working on adaptive explicit wave solvers. With a corrected proof, it is a solid contribution. Without the fix, the central theorem is not proven.\n\nRecommendation: do not desk-reject. Send it to peer review, but tell the referee to check the initial- and final-layer handling and (4.34) very carefully. This paper deserves referee time, but it is not ready as is.","headline":"The right target and a mostly sound machinery, but the main theorem has a genuine hole at the initial and final time layers that needs fixing before the fully computable claim stands.","tokens_in":27249,"tokens_out":4382,"would_cite":false,"duration_ms":39336,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65M15","65M60","65M50","35L05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that for the leapfrog method with time-varying meshes and local time stepping, the full energy-norm error is bounded by a sum of computable indicators, allowing certified adaptive explicit wave propagation.","keywords":["a posteriori error estimates","wave equation","leapfrog method","local time stepping","mesh change","elliptic reconstruction","energy norm","finite elements"],"falsifier":"Take the same leapfrog scheme on a time-varying mesh that is deliberately not compatible in the sense of Appendix A.1 (for example, refine one half of the domain and coarsen the other independently at a single time step), compute both the true maximum energy error and the right-hand side of (4.19), and check whether the bound is violated; a violation would show that the compatibility condition is essential rather than an artifact of the proof.","tokens_in":124,"feed_emoji":"🌊","tokens_out":6761,"duration_ms":114768,"temperature":0.7,"pith_summary":"The paper proves that the error of an explicit leapfrog finite element solution of the wave equation can be bounded a posteriori by a sum of computable indicators, even when the spatial mesh changes at every time step and when finer regions take smaller local time steps. The bound controls the energy norm of the displacement error and the $L^2$ norm of the velocity error at all discrete times. Each contribution to the error—spatial discretization, time discretization, mesh transfer, local time stepping, data approximation, and initial data—is isolated into an indicator that can be evaluated from the computed solution alone. If correct, this removes the last obstacle to fully adaptive, explicit, and certified wave propagation solvers.","feed_headline":"Leapfrog wave solver error now fully computable with mesh change","feed_subtitle":"Estimator accounts for changing meshes and local time stepping, enabling certified adaptive explicit wave simulations.","key_machinery":"The central objects are the elliptic reconstructors $\\omega^n = R_n U^n$ and $\\psi^{n-1/2} = R_n V^{n-1/2}$, which map the discrete displacement and velocity into the continuous space $V$ by inverting the discrete elliptic operator. The argument then builds piecewise linear and quadratic time interpolants on the primal and staggered time grids, so that the reconstruction-exact error $\\sigma = (\\breve\\omega - u,\\breve\\psi - v)$ solves the first-order error-residual system (4.5). The energy estimate (4.7) bounds $\\|\\sigma\\|_{L^\\infty(0,T;\\mathrm{erg},A)}$ by the initial error plus twice the $L^1$ energy norm of the residuals, and each residual term is further decomposed using the mesh-change, local-time-stepping, time, data, and elliptic indicators of Section 4.3.","core_discovery":"The central claim is Theorem 4.4: for the fully discrete leapfrog scheme (2.55) on time-varying finite element spaces, the maximum over all time steps of the energy-norm displacement error and of the $L^2$ velocity error is bounded by the sum of a computable residual estimator, the initial error, and a time-accumulated combination of elliptic, mesh-change, local-time-stepping, time-discretization, and data-approximation indicators. The proof introduces piecewise linear and quadratic reconstructions in time, transfers the discrete solution between consecutive meshes with abstract grid transfer operators, and bounds the resulting residuals by indicators that are fully computable. Numerical experiments with a moving Gaussian pulse confirm that the estimator converges at the optimal rate with mesh refinement.","pith_inferences":["An adaptive algorithm that uses these indicators can in principle drive the whole space-time mesh hierarchy, but the theory does not address the computational cost of evaluating the indicators themselves; in practice the elliptic estimators may dominate the runtime.","The compatibility condition (common macro triangulation) is likely necessary for the Clément-Scott-Zhang estimates used in Lemma A.5, so an arbitrary pair of time-consecutive meshes could make the transfer indicators fail, which is a testable limitation.","The same reconstruction strategy may extend to higher-order time-stepping methods or to nonlinear wave equations, but those extensions are not shown here.","Since the indicators bound the discrete solution error rather than the energy-conservation defect, comparing the mesh-change indicators with the actual energy jump at each mesh change could reveal how much of the energy drift is captured by the estimator."],"forward_implications":["Every term in the bounds (4.19) and (4.20) is fully computable, so an adaptive solver can monitor the actual error estimate during the run and refine or coarsen wherever the local indicators are largest.","The analysis covers leapfrog-based local time stepping with two or more local time steps, including stabilized variants, so the CFL restriction can be relaxed locally without losing the error bound.","On a fixed mesh the estimates reduce to known a posteriori bounds for leapfrog, recovering the optimal convergence rate $O(h)$ in the energy norm.","The numerical example shows that the estimator converges at the expected optimal rate with mesh size even when the mesh moves with the wave front.","The bounds account for mesh-change error explicitly, which is the key ingredient for adaptive refinement and coarsening over long integration times."],"supporting_citations":[{"why":"Supplies the time-reconstruction machinery and the a posteriori estimates for leapfrog and cosine methods that the present analysis builds on.","marker":"Georgoulis et al. [2016]"},{"why":"Introduces the leapfrog-based local time-stepping method whose error is accounted for in the indicator decomposition.","marker":"Diaz and Grote [2009]"},{"why":"Provides the elliptic reconstruction technique and the compatible-mesh interpolation estimates used in the transfer-operator bounds.","marker":"Lakkis and Makridakis [2006]"},{"why":"Supplies the residual-based a posteriori estimation framework underlying the elliptic error indicators.","marker":"Verfürth [2013]"},{"why":"Defines the specific residual estimator used in the numerical experiments.","marker":"Babuška and Rheinboldt [1978]"},{"why":"Establishes the bisection-based mesh compatibility framework (macro triangulation and refinement forests) assumed in Appendix A.1.","marker":"Schmidt and Siebert [2005]"},{"why":"Describes the stabilized leapfrog local time-stepping variant that the analysis also covers.","marker":"Grote et al. [2021]"},{"why":"Provides the a priori mesh-change estimates for nonlinear wave equations that motivate the mesh-change indicators.","marker":"Karakashian and Makridakis [2005]"}],"fun_headline_variants":["Leapfrog error estimator survives mesh changes","Fully computable leapfrog error bounds with adaptive meshes","Moving meshes now get certified leapfrog wave errors","Mesh-change leapfrog: error bounds now fully computable"],"cache_read_input_tokens":29184,"weakest_assumption_plain":"The proof assumes every spatial mesh in the time sequence is derived from one common macro triangulation by bisection, so consecutive meshes are always compatible; the Clément-Scott-Zhang and transfer-operator bounds that make the mesh-change indicators valid depend on this compatibility.","fun_headline_variants_meta":{"raw":{"variants":["Leapfrog error estimator survives mesh changes","Fully computable leapfrog error bounds with adaptive meshes","Moving meshes now get certified leapfrog wave errors","Mesh-change leapfrog: error bounds now fully computable"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000179,"raw_usage":{"total_tokens":1244,"prompt_tokens":833,"completion_tokens":411,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":449,"completion_tokens_details":{"reasoning_tokens":343}},"tokens_in":449,"tokens_out":411,"duration_ms":5043,"temperature":1.0,"reasoning_tokens":343,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T12:44:02.858649+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the same leapfrog scheme on a time-varying mesh that is deliberately not compatible in the sense of Appendix A.1 (for example, refine one half of the domain and coarsen the other independently at a single time step), compute both the true maximum energy error and the right-hand side of (4.19), and check whether the bound is violated; a violation would show that the compatibility condition is essential rather than an artifact of the proof.","supporting_citations":[],"review_version":1}