{"id":"2a447cba-dd49-42bb-b6c8-8094a6d3be45","arxiv_id":"1908.08238","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A Galerkin-collocation time discretization for the wave equation is constructed, analyzed with optimal-order error estimates, and extended to twice differentiable solutions via post-processing.","lead":"This paper introduces a new family of time-stepping methods for the wave equation that blend Galerkin and collocation ideas, producing smooth solutions with cheaper linear systems. The authors prove optimal-order error bounds and show that a cheap post-processing step upgrades the method to a smoother, higher-order variant.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.13 rests on an unproved identification of cGP-C1(k) with the post-processed cGP(k-1) scheme of [12]; if that identification fails, the imported stability and boundedness lemmas do not transfer.","rationale":"The reader identified the same load-bearing weakness: the analysis imports stability, boundedness, and initial-value results from [12] via an asserted but unproved correspondence. My independent reading confirms this is the weakest point of the central claim. The ∂t error estimates (Theorem 5.5) are on somewhat firmer ground because Theorem 5.1 and Lemma 5.3 can be checked directly from the scheme, but the error estimates for U_tau,h (Theorem 5.13) rely on Lemma 5.12, which depends on Lemmas 5.9 and 5.10 that are merely recalled from [12]. The paper's language ('related to', 'motivated by', 'could also be interpreted as') explicitly acknowledges the lack of proof. The numerical experiments are consistent with the claimed rates and provide supporting evidence, but they do not replace the missing analytic transfer. The C2 post-processing (Theorem 7.3) also relies on an unpublished companion [16], which is a secondary concern for the paper's broader claims. Overall, the verdict CONDITIONAL is appropriate: the central C1 error analysis should be accepted only if the correspondence is proved or Lemmas 5.9-5.10 are derived directly. My recommendation is therefore UNCHANGED relative to the reader's verdict.","tokens_in":26700,"tokens_out":11174,"duration_ms":92714,"concrete_test":"On one time interval with k=3, take a scalar version of Problem 3.3 (V_h = R, A_h = lambda, F approximated by I_H^tau F). Compute the cGP-C1(3) solution explicitly from (3.1a)-(3.1d). Independently compute the cGP(2) solution using the variational condition with test space P_1 and modified right-hand side I_H^tau F, then apply the post-processing lifting operator L_tau of [12] to obtain a C1 cubic. Compare the two functions on the interval. If they are identical, the asserted correspondence holds for k=3; if not, the imported Lemmas 5.9-5.10 are not justified. Repeat for k=4. Additionally, attempt a direct proof of Lemma 5.9 from the definitions of Problem 3.3; if the stability identity (5.20) holds without invoking [12], the concern reduces to a presentation gap.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central error estimate, Theorem 5.13, is proved through Lemma 5.12, whose proof invokes Lemma 5.9 (stability) and Lemma 5.10 (boundedness). These lemmas are not proved; they are 'recalled from [12]' on the strength of the assertion that 'our polynomial order k is related to k + 1 in [12]' and that the cGP-C1(k) solution 'could also be interpreted as the post-processed solution of a numerically integrated cGP(k-1)-cG(r) scheme ... with a modified right-hand side in that F is replaced by I_H^tau F' (Section 5, paragraph before Lemma 5.9). This correspondence is stated as a motivation, not derived. The scheme of Problem 3.3 is defined by endpoint collocation conditions (3.1b,c) and a reduced test space P_{k-3}, whereas the [12] post-processed solution is a lifting of the cGP(k-1) solution that satisfies the enlarged variational identity (3.3) but is not shown to satisfy the endpoint derivative equations. Identity (3.3) alone does not characterize the discrete solution because the endpoint conditions are additional constraints. Consequently, the objects U_tau,h here and L_tau U_tau,h in [12] may differ, and if they differ, Lemmas 5.9-5.10 as stated for this E_tau,h are unproved. Lemma 5.12 is then unsupported, and with it Theorem 5.13 fails. The paper itself flags the relation only as 'motivated by' and 'could also be interpreted as', making the gap explicit rather than hidden.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces a family of Galerkin-collocation time discretizations for the linear wave equation, called cGP-C1(k)-cG(r) for k ≥ 3, in which the unknown U_τ,h is globally C1 in time. The scheme is defined by combining endpoint collocation conditions (3.1b)-(3.1c) with a reduced test space P_{k-3} and a Hermite-type quadrature rule. The main analytical claim is Theorem 5.13, which asserts optimal-order error estimates, ‖e0(t)‖ + ‖e1(t)‖ ≲ τ^{k+1} + h^{r+1} and ‖∇e0(t)‖ ≲ τ^{k+1} + h^r, together with their L2-in-time analogues, under an initial value U0,h = (R_h u0, R_h u1). The proof is built on an error decomposition and on stability and boundedness lemmas recalled from the prior paper [12], based on an asserted correspondence between the present cGP-C1(k) solution and the post-processed cGP(k−1) solution of [12]. In addition, Section 7 proposes a C2-in-time variant cGP-C2(k) and a post-processing relation (Theorem 7.3) whose proof is deferred to reference [16]. Numerical experiments in Section 8 confirm the predicted convergence orders for k = 3 and k = 4, including the order-increase after post-processing.","tokens_in":26978,"tokens_out":3985,"duration_ms":39037,"significance":"If the central error estimates are valid, the paper makes a useful contribution: it constructs a time discretization that achieves optimal-order convergence for the wave equation while maintaining global C1 regularity in time by construction, and the numerical experiments substantiate the predicted rates. The paper also proves energy conservation at discrete nodes (Lemma 6.1), which is a meaningful structural property, and it provides a computationally cheap post-processing route from the C1 family to the C2 family. The genuine novelty is the scheme itself and the consistency analysis of Section 5.1 (Theorem 5.1), together with the quadrature-based identifications in Lemmas 3.5 and 3.6. However, the verification of the central claim is not self-contained: the decisive stability and boundedness lemmas (Lemmas 5.9 and 5.10) and the initial-value lemma (Lemma 5.3) are imported from [12] under an unproved correspondence, and the key theorem of the C2 extension (Theorem 7.3) is deferred to an 'in preparation' reference. These gaps must be closed before the error estimates can be considered established.","major_comments":[{"comment":"Lemma 5.3, which identifies the initial time derivative ∂_t U_τ,h(0) with (R_h, P_h)∂_t U(0), is also deferred: the proof is referred to [12, Lemma 5.4] under the same correspondence that is not established. This lemma is used in the proof of Theorem 5.5 to verify the discrete initial condition required by Theorem 5.4. The same identification issue therefore also affects the auxiliary error estimate in Theorem 5.5, on which Lemma 5.12 relies. A proof of Lemma 5.3 for the collocation scheme of Problem 3.3 should be included.","section":"Section 5.1, Lemma 5.3"}],"minor_comments":[{"comment":"The regularity assumption is stated as 'we tacitly assume that the solution u ... satisfies all the additional regularity conditions that are required in our analysis', with f ∈ C^s([0,T];H) for 'some sufficiently large parameter s'. The manuscript should state explicitly which Sobolev or C^m norms of u, ∂_t u, and f are needed for Theorems 5.4, 5.5 and 5.13, because the constants in the error estimates depend on these norms.","section":"Section 2.1, Assumption 2.2"},{"comment":"The quadrature formula denoted Q^H_{n,k} in condition (7.1f) is not defined. The text notes that it differs from Q^H_n of (2.11) by using k evaluations of function values, but the definition should be given explicitly, including its exactness properties, before it is used.","section":"Section 7, Problem 7.1"},{"comment":"The paper states that applying the cGP-C2(5) method directly gives 'exactly the same errors' as the post-processed solution ~E, but no data or derivation for this claim is shown. Since the direct method is not implemented in the table, this statement should either be substantiated or removed.","section":"Section 8.2"},{"comment":"Reference [16] is listed as 'in preparation' and reference [6] as 'submitted'. Since both are used in the main text as sources of proofs or details, the manuscript should provide updated references or enough self-contained material so that the claims do not depend on unpublished work.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The paper's central error estimate (Theorem 5.13) is conditional on an unproved identification of the new cGP-C1(k) scheme with the post-processed cGP(k−1) scheme of [12]. The authors should be asked to either prove this correspondence directly or to prove Lemmas 5.9, 5.10 and 5.3 for the scheme of Problem 3.3. Additionally, Theorem 7.3 is deferred to an 'in preparation' reference; for a journal publication, a proof should be included or the claim should be explicitly marked as conjectural. The numerical experiments are well-designed and supportive, but they do not close the analytical gaps. Editor: the heavy reliance on self-authored prior results and 'in preparation' references is a concern for self-containedness, though the technical approach appears sound if the correspondence can be established."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take on 1908.08238. The scheme itself is worth knowing: cGP-C1(k) builds C1-in-time regularity into the discrete solution by imposing collocation at interval endpoints and shrinking the test space to P_{k-3}, with a Hermite-type quadrature. That is a genuine extension of the ODE construction from [17] to the wave equation, and the numerical experiments in Section 8 cleanly show the predicted k+1 order in L2 and k in the energy norm. Energy conservation for f=0 is also a nice touch.\n\nThe proof is where I hesitate. The crucial estimates for Eτ,h (Lemmas 5.9 and 5.10) are not proved; they are recalled from [12] on the strength of the statement that Uτ,h here 'could also be interpreted' as the post-processed solution of a cGP(k−1) scheme from [12]. That identification is not derived, and it is not a formality. Lemma 5.9's stability identity is not true for arbitrary C1 piecewise-polynomial error pairs; it depends on the structure of Eτ,h. So if the correspondence fails, Theorem 5.13 does not follow. The authors may well be able to close this gap — the numerics are consistent with the claimed rates — but a referee should demand either a proof of the identification or a direct proof of Lemmas 5.9–5.10.\n\nSecond issue: Theorem 7.3, the post-processing link from cGP-C1 to cGP-C2, is stated without proof and deferred to [16], listed as 'in preparation'. That is not acceptable for a standalone paper, especially since the abstract overclaims optimal-order estimates for 'the Galerkin-collocation approach' when the analysis covers only the C1 family. The C2 experiments in Section 8.2 are interpreted through this unproved theorem.\n\nMinor: Assumption 2.2 is a blanket regularity assumption, and the statement that direct cGP-C2(5) gives 'exactly the same errors' as post-processing is not backed by shown data.\n\nBottom line: this is a solid method paper with one load-bearing proof gap and one deferred theorem. It deserves a serious referee rather than a desk reject, but I would send it back for major revision: prove the identification or the lemmas, and either prove Theorem 7.3 or trim the C2 claims. If those are fixed, I'd be happy to see it in print.","headline":"New cGP-C1 time discretization for the wave equation with clean numerics, but the central error proof rests on an unproved identification with [12] and the C2 theorem is deferred; deserves peer review with major revision.","tokens_in":27583,"tokens_out":15679,"would_cite":false,"duration_ms":143798,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65M60","65M12","35L05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that a Galerkin-collocation time-stepping family solves the wave equation at optimal order in space and time while producing C1-in-time discrete solutions.","keywords":["wave equation","Galerkin-collocation method","continuous Galerkin-Petrov method","collocation time discretization","Hermite quadrature","error estimates","post-processing","energy conservation"],"falsifier":"Solve the cGP-C1(3)-cG(3) scheme on one time interval and compare it term-by-term with the post-processed cGP(2)-cG(3) solution from the companion analysis using the modified right-hand side $I^H_\\tau f$; if the two do not coincide, or if the energy identity of Lemma 5.9 fails by more than round-off, the proof of Theorem 5.13 collapses. In the same computation, check whether the observed temporal order for $\\|e^0\\|+\\|e^1\\|$ is exactly $\\tau^4$; any systematic order drop falsifies the optimal-order claim.","tokens_in":26446,"feed_emoji":"🌊","tokens_out":10564,"duration_ms":88460,"temperature":0.7,"pith_summary":"This paper introduces a family of time-stepping schemes for the wave equation, called cGP-C1(k)-cG(r), that combine the accuracy of continuous Galerkin-Petrov methods with the cheaper algebraic structure of collocation methods. The paper claims that, with a special Hermite-type quadrature and derivative collocation conditions at the time nodes, the fully discrete solution is globally C1 in time and converges at optimal order: $\\|e^0\\|+\\|e^1\\| \\lesssim \\tau^{k+1}+h^{r+1}$ and $\\|\\nabla e^0\\| \\lesssim \\tau^{k+1}+h^r$ for all times, with the analogous $L^2$-in-time bounds. If true, this gives a way to compute wave propagation with higher time regularity and reduced linear-system cost compared with standard cGP(k) schemes, without losing accuracy. The paper also extends the construction to twice differentiable solutions and shows how a cheap post-processing lifts a cGP-C1(k) solution to a cGP-C2(k+1) solution.","feed_headline":"Galerkin-collocation time stepping hits optimal wave accuracy","feed_subtitle":"cGP-C1(k) stays C1 in time, cuts system cost, and gains a cheap C2 post-processing step","key_machinery":"The mechanism is the matched triple of trial space $P_k$, test space $P_{k-3}$, and the Hermite-type quadrature $Q^H_n$ with derivative weights at the endpoints, together with the Hermite interpolation $I^H_\\tau$ of the right-hand side. Collocation conditions at $t^+_{n-1}$ and $t^-_n$ force the discrete solution to satisfy the differential equation pointwise at interval ends, which yields global $C^1$ continuity; Lemma 3.5 then rewrites the scheme with Gauss-Lobatto quadrature and an enlarged test space $P_{k-2}$. The error proof rests on the decomposition $E=\\Theta+E_{\\tau,h}$, the stability identity of Lemma 5.9, the boundedness estimate of Lemma 5.10, and the consistency-error identity of Lemma 5.7, with the cGP($k-1$) estimates of the companion analysis supplying the core bounds.","core_discovery":"The central claim is that the wave equation can be discretized in time by a Galerkin-collocation scheme whose trial space has polynomial degree $k$, whose test space has degree only $k-3$, and whose endpoint conditions enforce $\\partial_t U_{\\tau,h}(t_\\pm) = -A_h U_{\\tau,h} + P_h F$ at the interval ends. Theorem 5.13 states that, for the error $E=(e^0,e^1)=(u-u^0_{\\tau,h},\\partial_t u-u^1_{\\tau,h})$ with initial value $(R_h u_0,R_h u_1)$, the bounds $\\|e^0(t)\\|+\\|e^1(t)\\| \\lesssim \\tau^{k+1}+h^{r+1}$ and $\\|\\nabla e^0(t)\\| \\lesssim \\tau^{k+1}+h^r$ hold for all $t$, together with the corresponding $L^2(I;H)$ estimates. The proof first bounds the time derivative of the error by viewing $\\partial_t U_{\\tau,h}$ as a cGP($k-1$) approximation of $\\partial_t U$ with a modified right-hand side, then decomposes $U-U_{\\tau,h}$ into an interpolation error and a discrete error and combines weak stability, boundedness, and consistency estimates. If correct, the scheme achieves the same order as the standard cGP(k) method while building C1 regularity into the discrete solution itself, and it conserves the discrete energy $\\|u^1_{\\tau,h}(t_n)\\|^2+\\|\\nabla u^0_{\\tau,h}(t_n)\\|^2$ at time nodes when $f\\equiv 0$.","pith_inferences":["If the asserted identification with the post-processed cGP(k-1) solution is proved directly on each time interval, the whole error analysis becomes a corollary of the companion cGP analysis; that is the most direct route to closing the proof gap.","The built-in C1 regularity makes these discrete solutions well suited for a posteriori error control and adaptive time refinement, since nodal derivative values are already part of the discrete representation; the paper hints at this but does not develop it.","For nonlinear or non-self-adjoint hyperbolic problems the energy conservation lemma will generally fail, but the collocation-plus-reduced-test-space mechanism is a natural candidate for optimal-order convergence if the stability lemma can be adapted."],"forward_implications":["The cGP-C1(k)-cG(r) solution is globally once continuously differentiable in time by construction, so no post-processing is needed for C1 regularity.","For $k=3$ the test space shrinks to piecewise constants in time, which simplifies the block structure of the linear systems and is the advertised computational saving over standard cGP(k).","For vanishing source $f\\equiv 0$, the scheme conserves the discrete energy $\\|u^1_{\\tau,h}(t_n)\\|^2+\\|\\nabla u^0_{\\tau,h}(t_n)\\|^2$ exactly at every time node.","Applying the post-processing of Theorem 7.3 to a cGP-C1(k) solution produces a cGP-C2(k+1) solution, and the numerical experiments show the convergence order rising from $k+1$ to $k+2$.","The construction transfers to other second-order hyperbolic systems, such as elastic waves and Maxwell-type problems, for which the wave equation serves as the prototype."],"supporting_citations":[{"why":"Supplies the stability, boundedness, and initial-value lemmas that the error proof imports, including the identification of the new scheme with the post-processed cGP(k-1) solution.","marker":"[12]"},{"why":"Provides the cGP(k)-cG(r) error theorem, used here as Theorem 5.4 to bound the time derivative of the error.","marker":"[30]"},{"why":"Gives the Hermite-type quadrature formula whose exactness for degree 2k-3 underpins the scheme and Lemma 3.5.","marker":"[28]"},{"why":"Introduces the Galerkin-collocation construction for first-order ODE systems from which the wave-equation scheme adapts its collocation conditions.","marker":"[17]"},{"why":"Listed as the source for the proof of the cGP-C2 post-processing theorem, Theorem 7.3, and is cited as in preparation.","marker":"[16]"}],"fun_headline_variants":["Wave equation time stepping: Galerkin-collocation hits optimal order","Cheaper Galerkin time discretization for wave equation with optimal accuracy","Galerkin-collocation: C1 wave solutions, less cost, same order","Wave equation solver: Galerkin-collocation cuts cost, keeps accuracy","C1 Galerkin-collocation for wave equation: optimal error bounds"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The analysis assumes, without proving it, that the new cGP-C1(k) solution is exactly the post-processed cGP(k-1) solution of the companion analysis, with polynomial degree $k$ matching $k+1$ there; if that identification fails, the imported stability, boundedness, and initial-value lemmas do not apply and Theorem 5.13 does not follow, and the C2 post-processing theorem likewise rests on a proof listed as in preparation.","fun_headline_variants_meta":{"raw":{"variants":["Wave equation time stepping: Galerkin-collocation hits optimal order","Cheaper Galerkin time discretization for wave equation with optimal accuracy","Galerkin-collocation: C1 wave solutions, less cost, same order","Wave equation solver: Galerkin-collocation cuts cost, keeps accuracy","C1 Galerkin-collocation for wave equation: optimal error bounds"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000298,"raw_usage":{"total_tokens":1774,"prompt_tokens":1043,"completion_tokens":731,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":659,"completion_tokens_details":{"reasoning_tokens":634}},"tokens_in":659,"tokens_out":731,"duration_ms":6294,"temperature":1.0,"reasoning_tokens":634,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:45:31.107928+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Solve the cGP-C1(3)-cG(3) scheme on one time interval and compare it term-by-term with the post-processed cGP(2)-cG(3) solution from the companion analysis using the modified right-hand side $I^H_\\tau f$; if the two do not coincide, or if the energy identity of Lemma 5.9 fails by more than round-off, the proof of Theorem 5.13 collapses. In the same computation, check whether the observed temporal order for $\\|e^0\\|+\\|e^1\\|$ is exactly $\\tau^4$; any systematic order drop falsifies the optimal-order claim.","supporting_citations":[{"cited_title":"Post-processed Galerkin approximation of improved order for wave equations","cited_arxiv_id":"1803.03005","evidence_quote":"Supplies the stability, boundedness, and initial-value lemmas that the error proof imports, including the identification of the new scheme with the post-processed cGP(k-1) solution."},{"cited_title":"Karakashian, C","cited_arxiv_id":null,"evidence_quote":"Provides the cGP(k)-cG(r) error theorem, used here as Theorem 5.4 to bound the time derivative of the error."},{"cited_title":"Joulak, B","cited_arxiv_id":null,"evidence_quote":"Gives the Hermite-type quadrature formula whose exactness for degree 2k-3 underpins the scheme and Lemma 3.5."},{"cited_title":"Becher, G","cited_arxiv_id":null,"evidence_quote":"Introduces the Galerkin-collocation construction for first-order ODE systems from which the wave-equation scheme adapts its collocation conditions."},{"cited_title":"Becher, G","cited_arxiv_id":null,"evidence_quote":"Listed as the source for the proof of the cGP-C2 post-processing theorem, Theorem 7.3, and is cited as in preparation."}],"review_version":1}