{"id":"c498857b-8850-43b2-aaee-79d8e1d85f08","arxiv_id":"2412.02425","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A direct inversion of the small systems from ParaOpt's alpha-circulant preconditioner avoids an extra inner iteration and extends the preconditioner to nonlinear problems.","lead":"This paper makes the ParaOpt time-parallel optimal control algorithm faster by replacing the inner iterative solve of its preconditioner with a single direct boundary value problem solve. The new technique keeps the algorithm's black-box solvers while cutting the number of coarse solves needed for nonlinear problems.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Algorithm 1's inner BVP (19) is not guaranteed well-posed; for g(y)=0, α=1, d_l=1 it is singular, so the claimed direct inversion of (11) fails without an extra assumption.","rationale":"The reader correctly identifies the missing well-posedness of the modified BVP as the load-bearing gap, but the precise condition is not simply invertibility of M0. The g(y)=0 counterexample shows M0 is invertible while the shifted boundary map (19) is singular, so the required condition is invertibility of \\tilde M = M0 + diag(-d*, -d). Lemma 1 only gives |d_l|=1; it does not prevent d_l from coinciding with an eigenvalue of the monodromy map. The numerical section uses a dissipative Burgers problem for which this gap does not manifest, so the demonstration does not establish the general claim. This is a repairable omission: an explicit well-posedness assumption or theorem, verified in the experiments, would make the method stand. The reader's CONDITIONAL verdict remains appropriate; no change is needed.","tokens_in":7771,"tokens_out":13508,"duration_ms":139071,"concrete_test":"Analytic check: for the linear problem g(y)=0 with α=1, L=2, write the coarse propagators (Py=I, Pλ=-(ΔT/γ)I, Qy=0, Qλ=I) and d_1=1, then verify that z(t)≡1, μ(t)≡0 is a nonzero solution of the homogeneous version of (19). This proves the modified BVP is not uniquely solvable, so Algorithm 1 cannot solve (11) for all right-hand sides; a run of the supplied code on this case should show the same failure.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The algebraic factorization leading to (19) is correct, but Algorithm 1 is only valid if the modified BVP in step 2 has a unique solution for every right-hand side. The paper asserts this without proof, and it is not a consequence of M0 being invertible. A concrete counterexample: take the linear problem g(y)=0. Then on one interval the coarse propagators satisfy Py=I, Pλ=-(ΔT/γ)I, Qy=0, Qλ=I. For α=1 and L≥2, one diagonal element is d_l=1, so the inner matrix M in (11) becomes [[0,(ΔT/γ)I],[0,0]], which has nontrivial kernel {(δy,0)} and is not surjective; for example, right-hand sides with δq≠0 have no solution. Correspondingly, the homogeneous version of (19) with d=1 is -z(0)+z(ΔT)=0, μ(0)-μ(ΔT)=0, and z≡const, μ≡0 is a nonzero solution. Thus the modified BVP is not well-posed. This is exactly the failure mode the paper needed to exclude, e.g. by assuming no d_l is an eigenvalue of the monodromy map or by choosing α so that all d_l avoid such values. The dissipative Burgers example is likely well-posed and does not test this gap.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a direct inversion procedure for the small inner systems that arise when applying the diagonalization-based ParaOpt preconditioner. It generalizes the linear preconditioner to nonlinear problems by evaluating the derivative blocks at averaged state/adjoint values, and it derives an algebraic factorization (Eqs. (16)-(17)) that reduces the inner system (11) to a single complex-valued BVP with modified boundary conditions (Eq. (19)). Algorithm 1 implements this inversion using an abstract coarse BVP solver. Numerical experiments on viscous Burgers equation report reductions in the number of coarse BVP solves relative to the inner-iteration approach.","tokens_in":8080,"tokens_out":12445,"duration_ms":133674,"significance":"If the proposed inversion is valid, it is a useful contribution: it avoids an inner Krylov iteration for the ParaOpt preconditioner and preserves the black-box view of the coarse propagators. The algebraic factorization leading to (19) is exact, Lemma 1 is proved cleanly, and the paper ships reproducible code with a numerical demonstration. No free parameters are fitted, and the claimed reduction in BVP counts is achieved in the Burgers examples. However, the central algorithmic claim is not established in general: the modified BVP in Algorithm 1 is only useful if it is well-posed, and the paper neither proves this nor states a condition under which it holds; in fact it fails for a simple linear problem with α=1. The numerical tests use a dissipative example, which likely satisfies the needed property, so they do not test the general claim.","major_comments":[{"comment":"The central claim is that solving the inner system (11) reduces to solving the BVP with boundary conditions (19), but this is only valid if that modified BVP is well-posed for every right-hand side. The paper asserts this implicitly and gives no proof, and the property is not a consequence of M0 being invertible. A concrete counterexample is the linear case g(y)=0. Then the coarse propagators are Py=I, Pλ=-(ΔT/γ)I, Qy=0, Qλ=I. For α=1 and L≥2, one eigenvalue is dℓ=1, so the matrix M in (11) becomes [[0, (ΔT/γ)I],[0,0]], which is singular and not surjective; for a right-hand side with δq≠0 there is no solution. Correspondingly, the homogeneous form of (19) admits the nonzero solution z≡const, μ≡0, so Algorithm 1, Step 2 is not well-posed. This is not an exotic edge case: the numerical examples use α=1. The authors need to add an explicit well-posedness/invertibility condition (e.g., that no dℓ belongs to the spectrum of the monodromy map, or a choice of α that excludes such values), prove or state it as an assumption, and verify it in the numerical experiments.","section":"Section 4, Eqs. (18)-(19), Algorithm 1"},{"comment":"The preliminary inversion of M0 by 'changing the BCs' has the same missing well-posedness hypothesis. To obtain the inverse of M0 by solving (6) with boundary conditions z(Tℓ)=δp and μ(Tℓ-1)=δq, one must know that this boundary value problem has a unique solution for every such pair. This is not automatic for a generic coarse BVP solver, and the later construction inherits the requirement. The paper should state this as an explicit hypothesis on the coarse solver and on the linearized BVP, rather than treating the BVP solve as a black box that accepts arbitrary two-point boundary conditions.","section":"Section 4, Eq. (13)"}],"minor_comments":[{"comment":"The notation C1(α) is used in Eq. (12) but is not defined; it should presumably be C(α), the alpha-circulant matrix introduced in Section 3.1.","section":"Section 3.2, Eq. (12)"},{"comment":"There are typos in the text: 'method of Langrage multipliers' should be 'method of Lagrange multipliers', and 'first-order order optimality conditions' should be 'first-order optimality conditions'.","section":"Section 2"},{"comment":"The phrase 'maintains the black-box property' should be qualified: the abstract BVP solver must now accept complex coefficients and coupled two-point boundary conditions of the form (19), which is a stronger interface than the separated boundary conditions y(Tℓ-1)=Yℓ-1, λ(Tℓ)=Λℓ used by the original propagators P and Q.","section":"Section 4, Algorithm 1"},{"comment":"The numerical experiments report BVP counts but not wall-clock time; since the new method solves a complex-valued BVP with coupled conditions, a timing comparison would strengthen the claim of practical efficiency.","section":"Section 5"}],"recommendation":"major_revision","confidential_remarks":"The paper is in scope for the journal and the algebraic core is correct, but the main algorithmic claim is not valid without a well-posedness assumption on the modified BVP. The counterexample with g=0 and α=1 is simple and directly relevant because α=1 is used in the experiments. I would not reject: the issue is fixable by adding and verifying an explicit condition, and the fixed version would be a solid contribution."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Corentin and colleagues have found a genuinely new algebraic trick, and they have left one unproven assumption that needs to be fixed. The new piece is Section 4: the factorization (16)-(17) moves the d_l factors from the propagator blocks onto the identity, so the inner system (11) becomes a single linear BVP with modified, complex boundary conditions (19). That is a real advance over [2], which required either an inner iteration or a non-black-box solver. The algebra is exact, Lemma 1 is fine, and the nonlinear averaging generalisation in Section 3.2 is the standard ParaDiag trick applied sensibly. The Burgers experiments are honest, show the expected reduction in coarse BVP solves, and the code is released.\n\nThe soft spot is real and load-bearing. Algorithm 1 is only valid if the modified BVP in step 2 is well-posed, and the paper does not prove or even state that as an assumption. It is not implied by invertibility of M0. For g(y)=0 and alpha=1, the alpha-circulant has an eigenvalue d=1, and the propagator block is Py=I, Plambda=-(DeltaT/gamma)I, Qy=0, Qlambda=I. Then the matrix in (18) is [[0,-(DeltaT/gamma)I],[0,0]], which is singular; the homogeneous version of the modified BVP has nonzero solutions (z constant, mu=0). So the direct inversion fails for that simple linear problem. The Burgers example dodges the issue, but the paper needs either a proof of well-posedness under reasonable assumptions (for instance, choosing alpha so that no d_l hits a problematic value, or a spectral condition on the propagator) or an explicit assumption plus numerical checks. This is a gap, not a fatal flaw: the method is correct when the modified BVP is well-posed, and those are likely the cases of interest.\n\nMinor points: only one test problem, and the comparison counts BVP solves rather than wall-clock time, so the practical benefit is plausible but not fully demonstrated. The 'black-box' claim should be qualified: the BVP solver must accept complex boundary conditions.\n\nWho should read this: researchers in parallel-in-time methods, especially those working on optimal control and preconditioning. I would send it to peer review; with a well-posedness statement and a little more testing, it is publishable.","headline":"A correct and useful algebraic trick for inverting ParaOpt inner systems, with a load-bearing well-posedness gap that the authors need to close.","tokens_in":8569,"tokens_out":5606,"would_cite":false,"duration_ms":57403,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65Y05","65F08","65L10"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper claims that the inner systems of the ParaOpt preconditioner can be inverted with a single modified boundary value problem solve, preserving black-box propagators and avoiding extra iterations.","keywords":["ParaOpt","parallel-in-time","preconditioning","alpha-circulant","diagonalization","optimal control","boundary value problem"],"falsifier":"Take a small linear problem (for instance a scalar or two-by-two constant $K$ with $L=3$ or $4$ subintervals), form the $\\alpha$-circulant and the explicit matrix $M$ in (11), and compare the solution from Algorithm 1 with a direct dense solve of $M$ for several right-hand sides $(\\delta p,\\delta q)$. A mismatch, or a BVP failure for a right-hand side that $M$ can invert, would contradict the paper's claim. Also check the premise $|d_\\ell(\\alpha)|=1$ numerically for the chosen $\\alpha$.","tokens_in":7610,"feed_emoji":"⚡","tokens_out":6546,"duration_ms":65533,"temperature":0.7,"pith_summary":"ParaOpt, a parallel-in-time method for optimal control, needs to invert a block-diagonal preconditioner at every quasi-Newton step; each block is a small system tying two subinterval propagators together. The paper shows these inner systems can be solved in a single boundary value problem solve with modified complex boundary conditions, instead of an extra inner GMRES iteration or specialized non-black-box shortcuts. The same direct inversion works for the nonlinear average-based preconditioner after one additional solve of the original optimality system. This lowers the number of coarse BVP solves needed per GMRES iteration and keeps the propagators black-box.","feed_headline":"One BVP solve replaces inner iterations in ParaOpt","feed_subtitle":"The new inversion keeps propagators black-box and cuts coarse solves per quasi-Newton step.","key_machinery":"The load-bearing mechanism is Lemma 1 plus the resulting symmetric phase factorization of the inner matrix. For ParaOpt's $\\alpha$-circulant $C(\\alpha)$, whose first column has a single nonzero entry $a=1$ on the first subdiagonal, every diagonal entry $d_\\ell(\\alpha)$ of the diagonalization has $|d_\\ell(\\alpha)|=1$. Writing $d_\\ell(\\alpha)=e^{i\\theta}$, the inner matrix factors as $-\\operatorname{diag}(e^{i\\theta/2}, e^{-i\\theta/2}) \\tilde M \\operatorname{diag}(e^{i\\theta/2}, e^{-i\\theta/2})$, where $\\tilde M$ is a boundary-value block whose action is exactly inverted by swapping the boundary conditions in the linearized optimality system (6). This factorization moves the phase factors off the propagator derivatives and onto the identity blocks, which is what turns $M^{-1}$ into a single modified BVP solve.","core_discovery":"The central discovery is that the inner system (11), whose matrix is $M$ as defined in the paper, can be inverted by solving one linearized BVP with boundary conditions $-d_\\ell^*(\\alpha) z(T_{\\ell-1}) + z(T_\\ell) = a$ and $\\mu(T_{\\ell-1}) - d_\\ell(\\alpha)\\mu(T_\\ell) = b$, then recovering $\\delta y = -z(T_{\\ell-1})/c$ and $\\delta \\lambda = -c\\,\\mu(T_\\ell)$ with $c = e^{i\\theta/2}$, $\\theta = \\angle d_\\ell(\\alpha)$. This works because, for the $\\alpha$-circulant used in ParaOpt, $|d_\\ell(\\alpha)|=1$, so $d_\\ell(\\alpha)$ is a pure phase that can be split symmetrically around the block $M_0$ containing the propagator derivatives. The paper extends the same inversion to the nonlinear case by evaluating the preconditioner at averaged states and adjoints, and shows on a viscous Burgers optimal-control example that the new inversion lowers the total number of coarse BVP solves.","pith_inferences":["If the phase-factor factorization is generic for circulant preconditioners whose diagonal entries are pure phases, the same one-BVP inversion should apply to other ParaDiag-type block-circulant preconditioners beyond ParaOpt, a testable extension.","The paper's numerical results rely on the modified BVP being well-posed; a direct verification on small linear problems with explicitly formed $M$ would separate the method's claim from the solver's behavior.","Because the derivation only uses locality of the BVP, the inversion may remain valid for nonuniform time grids if the diagonalization is replaced by another transform that diagonalizes the coupling matrix and preserves the phase property."],"forward_implications":["In the linear case, every inner system (11) of the ParaOpt preconditioner can be inverted with one BVP solve, eliminating the extra inner GMRES iteration described in [2].","In the nonlinear case, the same inversion applies to the averaged preconditioner (12) after one additional solve of (3), so the preconditioner is no longer restricted to linear problems.","For both final-value and tracking objectives, the number of coarse BVP solves per GMRES iteration in the Burgers example drops to one derivative BVP plus one preconditioner inversion BVP, tracking the reduction in GMRES iterations.","Black-box propagators are retained: the BVP solver is only required to solve linearized systems (6), not to expose internal structure."],"supporting_citations":[{"why":"Proposes the diagonalization-based ParaOpt preconditioner whose inner systems (11) this paper inverts, and gives the two existing inversion strategies compared here.","marker":"[2]"},{"why":"Introduces ParaOpt and the matching conditions (4) and quasi-Newton iteration (5) that the preconditioner accelerates.","marker":"[1]"},{"why":"Derives the first-order optimality BVP (3) whose linearization (6) is the basis for all BVP solves in the method.","marker":"[3]"},{"why":"Supplies the ParaDiag alpha-circulant diagonalization (9) used to block-diagonalize the preconditioner.","marker":"[6]"},{"why":"Gives the simultaneous diagonalization condition $|\\alpha|=1$ that makes the factorization of $C(\\alpha)$ and $C(\\alpha)^*$ possible.","marker":"[7]"},{"why":"Provides the averaging technique for nonlinear ParaDiag variants that the generalized nonlinear preconditioner (12) adapts.","marker":"[8]"}],"fun_headline_variants":["One BVP solve ends inner loop in ParaOpt","ParaOpt: single coarse BVP per quasi-Newton step","Fast ParaOpt inversion with one linearized BVP","ParaOpt preconditioner inverted in one BVP solve","Single BVP replaces inner iterations in ParaOpt"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire method rests on the assumption that for every right-hand side $(a,b)$, the modified linearized boundary value problem in Algorithm 1 has exactly one solution; if the coarse BVP solver cannot recover the preimage under the boundary-to-boundary map, Algorithm 1 has nothing to return.","fun_headline_variants_meta":{"raw":{"variants":["One BVP solve ends inner loop in ParaOpt","ParaOpt: single coarse BVP per quasi-Newton step","Fast ParaOpt inversion with one linearized BVP","ParaOpt preconditioner inverted in one BVP solve","Single BVP replaces inner iterations in ParaOpt"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000726,"raw_usage":{"total_tokens":3204,"prompt_tokens":849,"completion_tokens":2355,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":465,"completion_tokens_details":{"reasoning_tokens":2278}},"tokens_in":465,"tokens_out":2355,"duration_ms":19130,"temperature":1.0,"reasoning_tokens":2278,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T23:27:28.621786+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a small linear problem (for instance a scalar or two-by-two constant $K$ with $L=3$ or $4$ subintervals), form the $\\alpha$-circulant and the explicit matrix $M$ in (11), and compare the solution from Algorithm 1 with a direct dense solve of $M$ for several right-hand sides $(\\delta p,\\delta q)$. A mismatch, or a BVP failure for a right-hand side that $M$ can invert, would contradict the paper's claim. Also check the premise $|d_\\ell(\\alpha)|=1$ numerically for the chosen $\\alpha$.","supporting_citations":[{"cited_title":"Bouillon, G","cited_arxiv_id":null,"evidence_quote":"Proposes the diagonalization-based ParaOpt preconditioner whose inner systems (11) this paper inverts, and gives the two existing inversion strategies compared here."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces ParaOpt and the matching conditions (4) and quasi-Newton iteration (5) that the preconditioner accelerates."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Derives the first-order optimality BVP (3) whose linearization (6) is the basis for all BVP solves in the method."},{"cited_title":"Bouillon, G","cited_arxiv_id":null,"evidence_quote":"Gives the simultaneous diagonalization condition $|\\alpha|=1$ that makes the factorization of $C(\\alpha)$ and $C(\\alpha)^*$ possible."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the averaging technique for nonlinear ParaDiag variants that the generalized nonlinear preconditioner (12) adapts."}],"review_version":1}