{"id":"9456e75e-07c8-488d-8541-b4b7637978fa","arxiv_id":"2507.14881","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"SQQ-PTQ combines Chebyshev interpolation, adaptive time transformation, and Broyden's method to create a faster symplectic integrator for multi-scale gravitational dynamics.","lead":"This paper builds an adaptive-step symplectic integrator, SQQ-PTQ, by adding Chebyshev interpolation, a time transformation, and a Broyden quasi-Newton solver to an existing fixed-step integrator SQQ. Tests on the Kepler problem, a close-encounter three-body problem, and the outer Solar System show bounded energy errors and lower CPU time than the Newton-based variants and ODE45.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Symplecticity claim rests on an implicit solve whose stopping criterion is relative step size, not residual; without residual or iteration data the map is not shown to be symplectic.","rationale":"The reader's weakest assumption correctly identifies that Broyden convergence to the exact solution of Eq. (8) is load-bearing. My stress-test sharpens that concern: even the convergence criterion used in Algorithm 1 does not control the residual, so the assumption 'solved within tolerance epsilon = 1e-12' is not actually verified by the paper. This is a genuine soft spot, not a manufactured one, and it is directly relevant to the central symplecticity claim. However, the paper's numerical evidence for bounded energy error and improved CPU time is real, and the absence of code and residual diagnostics is addressable rather than fatal. The reader's CONDITIONAL verdict already reflects this level of uncertainty, so I do not move the verdict. I agree only partially with the reader because the reader frames the issue as unproven convergence, whereas the more precise problem is that the stated stopping criterion does not measure convergence in the sense required by the symplectic map.","tokens_in":11949,"tokens_out":4030,"duration_ms":47886,"concrete_test":"Instrument Algorithm 1 in the three-body close-encounter example (Section 4.2) and record, for every accepted time step, the final residual norm ||F(x_k)|| and the iteration count under the current stopping rule (epsilon = 1e-12). Then rerun the same experiment with a residual-based stopping criterion, ||F(x_k)|| < 1e-12, and also with ||F(x_k)|| < 1e-14, using a direct Newton solve as fallback if Broyden stalls. If the trajectories, energy errors, and phase-space structures over 500 periods are indistinguishable under all three criteria, the stopping-rule issue is not load-bearing. If residual-based stopping yields different solutions, larger iteration counts, or changed energy/phase errors, then the map being simulated is not the SQQ map and symplecticity is not established.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that SQQ-PTQ is an adaptive symplectic integrator that improves efficiency and applicability while conserving energy. That claim depends on the discrete equations (Eq. 8) being solved accurately at each step. Algorithm 1 stops when the relative update norm, e_k = ||x_{k+1}-x_k||/||x_k||, falls below epsilon, not when the residual ||F(x_k)|| is small. For Broyden's method, a small update does not imply a small residual: if the approximate inverse Jacobian is ill-conditioned, x_{k+1}-x_k = -J^{-1}_k F(x_k) can be small while F(x_k) remains large. The paper reports no residual histories, iteration counts, or failed-convergence diagnostics, so the stated epsilon = 1e-12 is not evidence that Eq. (8) is actually satisfied. The paper's own limitation note in Section 3.3 that quasi-Newton iteration may converge more slowly than Newton makes this residual verification especially important. The only validation offered is bounded energy error over finite integration times, but bounded energy is necessary, not sufficient, for symplecticity; a non-symplectic integrator with small steps can also show bounded energy over hundreds of periods while phase errors accumulate. Therefore the evidence chain supporting the 'symplectic algorithm' conclusion has a concrete gap.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes an adaptive symplectic integrator, SQQ-PTQ, built on the fixed-step generating-function integrator SQQ. It combines Chebyshev interpolation to avoid the Runge phenomenon, a projection method to accelerate interpolation-function evaluation, a time transformation to implement adaptive time steps, and Broyden's quasi-Newton method to solve the resulting nonlinear equations without explicit Jacobians. The method is tested on the Kepler problem at high eccentricity, a three-body close-encounter problem, and an outer Solar System model. The reported experiments show bounded energy error over long integrations and CPU-time reductions relative to SQQ variants and ODE45.","tokens_in":12289,"tokens_out":4200,"duration_ms":50544,"significance":"If the central claim is established, SQQ-PTQ would be a practically useful adaptive symplectic integrator for gravitational N-body dynamics, combining the long-term energy behavior of symplectic methods with adaptive step sizing and reduced Jacobian cost. The paper contains several strengths: the method parameters (a, b, m, n, Delta-tau, epsilon) are user-chosen rather than fitted to the reported errors; the comparisons against SQQ variants and ODE45 provide independent baselines; and the three experiments cover close encounters and long integrations, where adaptive behavior is essential. However, the theoretical basis for the 'symplectic' claim is not demonstrated, and the numerical evidence consists almost entirely of energy-error plots, which are necessary but not sufficient for symplecticity.","major_comments":[{"comment":"The stopping criterion in Algorithm 1 is ek+1 = ||x_{k+1}-x_k||/||x_k|| < epsilon, i.e., a relative update size, not the residual norm ||F(x_k)||. For Broyden's method a small update does not imply a small residual when the approximate inverse Jacobian is ill-conditioned, so the paper does not establish that the converged iterate actually satisfies Eq. (8). Since the symplecticity of the discrete map depends on the nonlinear equations being solved accurately, this is a load-bearing gap. The paper should either prove that the Broyden iteration drives the residual to a prescribed tolerance, or report residual histories, iteration counts, and failure diagnostics for the three experiments.","section":"§3.3, Algorithm 1"},{"comment":"The central claim that SQQ-PTQ is a symplectic integrator is asserted but never proved. The exact generating-function map with a fixed step in transformed time is symplectic only when Eq. (8) is solved exactly; the paper uses an approximate quasi-Newton solve with a loose coupling between the update size and the residual. No theorem, symplecticity-condition check (e.g., J^T Omega J = Omega), or back-error analysis is provided. The conclusion's statement that bounded energy 'confirms its characteristics as a symplectic algorithm' is not logically sufficient, because non-symplectic integrators with small steps can show bounded energy over hundreds of periods while phase errors accumulate.","section":"§2, §3.2, and §5"},{"comment":"All numerical validations report only energy error; no position or phase error is measured. The visual claim that 'the phase-space structure remains nearly intact' in Section 4.1 and Section 4.2 is not a quantitative substitute for a phase-error diagnostic. The paper should compare the computed trajectory against a high-accuracy reference solution (or check the periodicity of the three-body orbit) and report configurational error, since bounded energy can coexist with secular phase drift.","section":"§4.1, §4.2, and §4.3"},{"comment":"The efficiency comparisons are based on CPU time at a single, fixed step size and fixed solver tolerance, rather than on error-vs-cost curves. The statement that SQQ-PTQ 'improves computational efficiency' is not fully supported unless it is shown to reach a given accuracy in position and energy with less cost than the alternatives. In particular, the ODE45 comparison in Table 4 uses a relative tolerance of 1e-10 while the outer Solar System comparisons use 1e-8, and the tables report only energy error; a fair accuracy-controlled comparison would strengthen the efficiency claim.","section":"§4.2 and §4.3, Tables 4-6"},{"comment":"The paper acknowledges that the quasi-Newton method can converge more slowly than Newton and suggests that smaller step sizes mitigate this, but it does not provide any convergence analysis, iteration counts, or evidence that the maximum iteration count kmax is never reached in the reported runs. Because the adaptive time step may produce arbitrarily small steps during close encounters, a detailed account of the solver's behavior in those regimes is needed to rule out silent solver failures.","section":"§3.3, last paragraph"}],"minor_comments":[{"comment":"The reference 'Vogelaere 1900' appears to be a typo; the relevant work by de Vogelaere is from 1956. Please correct the citation and bibliography entry.","section":"§1, References"},{"comment":"The text contains the typo 'The The three-body problem.' Please fix.","section":"§4.2, first paragraph"},{"comment":"The statement that SQQ-PTQ requires 'only 50% of the computational time' relative to SQQ-PN is imprecise: from Table 5 the ratio is 1.1e1 / 2.6e1 = 0.42. Please either say 'about 40%' or correct the numbers.","section":"§4.3, Table 5 discussion"},{"comment":"The relative error definition uses ||x_k|| in the denominator, which can be problematic when components of x_k approach zero; consider a combined absolute/relative tolerance or a safeguard for near-zero norms.","section":"§3.3, Algorithm 1"},{"comment":"For the high-eccentricity Kepler experiments the parameters are listed as m = n = 3, but the figure captions and text do not specify the number of Gaussian quadrature points g; please state g and all related implementation parameters for reproducibility.","section":"§4.1"},{"comment":"The phase-space-trajectory figures would be more informative if the axes were labeled with the specific variables plotted (e.g., q1 vs p1) and if a reference orbit from a high-accuracy solver were overlaid for comparison.","section":"Figures 4 and 8"}],"recommendation":"major_revision","confidential_remarks":"The paper is aimed at an astronomy audience, but its central contribution is numerical analysis. The absence of a symplecticity proof or numerical symplecticity check, together with solver stopping-criterion issues, would likely be a blocker for a math.NA venue; for an A&A-style journal, the authors may be able to satisfy the requirement with a strengthened numerical section. I would encourage the editor to request the additional diagnostics described in the major comments before considering acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper combines Chebyshev interpolation, a projection precomputation, a bounded Darboux-Sundman time transformation, and Broyden's quasi-Newton method on top of the fixed-step SQQ integrator. The specific combination seems new, even though every component is known. The projection trick is clean and the Chebyshev interpolation sensibly avoids the Runge phenomenon at high interpolation order.\n\nWhat the paper does well: the numerical experiments are meaningful. High-eccentricity Kepler orbits, a close-encounter three-body configuration from Liao et al., and a long outer-solar-system integration all show bounded energy error over long times, and the CPU-time gains relative to SQQ-PTN are substantial. The three-body test is a good stress case because the close encounters force strong step-size adaptation.\n\nThe soft spots are real but not fatal. Most importantly, symplecticity is never proven for the discrete map; it is inferred from bounded energy error. That is necessary but not sufficient, especially with an implicit quasi-Newton solve and adaptive stepping. The stress-test concern about the stopping criterion is valid: Algorithm 1 stops on the relative update norm, not the residual. For Broyden's method a small update can coexist with a large residual if the approximate inverse Jacobian is ill-conditioned. The paper reports no residual histories or iteration counts, so the epsilon = 1e-12 threshold does not by itself show that Eq. (8) is satisfied. The energy behavior suggests the solves were adequate in practice, but the symplectic claim needs either a proof or much stronger numerical evidence.\n\nAlso missing: comparisons against the existing adaptive symplectic integrators that the paper itself cites (Mikkola-Tanikawa, Preto-Tremaine, Wang-Nitadori). CPU times against SQQ-PTN and ODE45 do not locate the method in the broader literature. There is also no position or phase error diagnostic, and no code or data, which limits reproducibility. The parameters are user-chosen, not fitted to the reported errors, so the circularity burden is low; I agree with the reader on that.\n\nThis paper is for readers in celestial mechanics and geometric integration who want an adaptive symplectic option built on the SQQ family. It deserves a serious referee, but it needs major revision: prove or rigorously test symplecticity, report residual and iteration data, compare against standard adaptive symplectic methods, and release code and data. I would send it to peer review.","headline":"A modest but useful engineering extension of the SQQ symplectic integrator with adaptive time stepping; the numerical evidence is decent, but symplecticity is asserted rather than proven and the paper skips comparisons against the standard adaptive symplectic methods.","tokens_in":12775,"tokens_out":1759,"would_cite":false,"duration_ms":20163,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["65P10","70F10","65H10"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that SQQ-PTQ, an adaptive symplectic integrator built from SQQ with a time transformation, Chebyshev interpolation, and Broyden's quasi-Newton solver, improves efficiency and applicability while keeping energy bounded…","keywords":["symplectic integrator","adaptive time step","time transformation","quasi-Newton method","Broyden's method","generating function","gravitational N-body","Chebyshev interpolation"],"falsifier":"Compare SQQ-PTQ's orbital phase, such as perihelion time or longitude, against a high-precision reference over 10,000 Kepler periods, and rerun the three-body test with the nonlinear tolerance loosened to 1e-8 and tightened to 1e-14; if phase error grows linearly while energy error stays bounded, or if the close-encounter timing shifts without an energy-error change, the energy diagnostic is masking a loss of symplecticity.","tokens_in":11784,"feed_emoji":"🪐","tokens_out":10399,"duration_ms":101201,"temperature":0.7,"pith_summary":"The paper sets out to show that a fixed-step symplectic integrator can be made adaptive without giving up its long-term energy behavior. It introduces SQQ-PTQ, a variant of the generating-function integrator SQQ, which adds a time transformation for adaptive step sizes, Chebyshev interpolation to avoid the Runge phenomenon, a projection method to speed up interpolation evaluations, and Broyden's quasi-Newton method to solve the resulting implicit equations. The reported experiments—Kepler orbits with eccentricity up to 0.99, a three-body configuration with close encounters, and the outer Solar System—show bounded energy error over thousands of periods, with CPU times substantially below Newton-based and non-adaptive alternatives. A sympathetic reader would take the contribution to be a practical adaptive symplectic integrator for gravitational N-body problems.","feed_headline":"Adaptive symplectic integrator keeps energy bounded for 10,000 orbits","feed_subtitle":"A quasi-Newton solver plus a time transformation make the SQQ integrator faster and able to handle close encounters.","key_machinery":"The machinery is the generating-function action S(q(ta), q(tb)): stationarity of the discretized action yields the nonlinear system whose solution defines the map from one endpoint to the other. SQQ is a fixed-step symplectic integrator built from this least-action generating function with generalized coordinates as independent variables at both ends. SQQ-PTQ approximates the action with Chebyshev interpolation and Gaussian quadrature, accelerates the interpolation evaluations with a projection method that precomputes basis functions on a reference interval, makes the step size adaptive through the time transformation dt/dτ = σ(p,q) with the Darboux-Sundman Hamiltonian K = σ(H - H0), and solves the implicit equations with Broyden's update for the inverse Jacobian.","core_discovery":"The central claim is that the time-transformed Hamiltonian can be integrated symplectically at low cost if the implicit equations are solved by Broyden's method rather than Newton's method. Because Broyden's method reuses an approximate inverse Jacobian from the previous step, it avoids the complicated analytic Jacobian of the transformed system; the paper reports that SQQ-PTQ achieves essentially the same maximum energy error as SQQ-PTN while using one-third to one-sixth of the CPU time. Over 10,000 Jupiter periods the energy error stays bounded near 3.5e-8, which the authors read as confirmation that the map remains symplectic in practice.","pith_inferences":["A sharper test of the symplectic claim would track phase error, such as perihelion passage time, over 10,000 orbits, since bounded energy error does not by itself rule out secular phase drift.","Because Broyden's method is warm-started from the previous step, very stiff encounters not covered by these examples might require periodic Jacobian refresh; the paper does not explore that regime.","The projection method's speed advantage grows with interpolation order, so the same construction may make higher-order SQQ variants or higher-dimensional systems practical."],"forward_implications":["High-eccentricity Kepler orbits with e = 0.9 and e = 0.99 can be followed for 500 periods with bounded energy error, a regime where fixed-step SQQ becomes inefficient.","A three-body periodic configuration with close encounters down to separation approximately 0.014 is integrated for 500 periods without failure, with energy error oscillating stably.","In the outer Solar System, SQQ-PTQ keeps maximum energy error near 3.5e-8 over 10,000 Jupiter periods and uses about 58% of SQQ-PN's CPU time.","Quasi-Newton solving gives nearly identical energy-error curves to Newton solving while using less than one-third of the Newton-based CPU time in the three-body test and about one-sixth in the outer Solar System test.","The projection method suppresses the Runge phenomenon at high interpolation orders, keeping energy error bounded where plain SQQ drifts."],"supporting_citations":[{"why":"Supplies the base SQQ integrator and its least-action generating-function construction, which SQQ-PTQ extends.","marker":"Gao et al. (2012)"},{"why":"Provides the quasi-Newton update that lets SQQ-PTQ avoid forming the Jacobian of the transformed Hamiltonian.","marker":"Broyden 1965"},{"why":"Establishes that time transformation makes explicit symplectic methods implicit, motivating the nonlinear solve.","marker":"Hairer 1997"},{"why":"Shows how time transformation can implement adaptive stepping while preserving symplectic structure.","marker":"Preto & Tremaine 1999"},{"why":"Supplies the step-size control function and the bounds used in the paper's adaptive step strategy.","marker":"Huang & Leimkuhler 1997"},{"why":"Gives the Darboux-Sundman transformation K = σ(H - H0) that keeps the transformed system Hamiltonian.","marker":"Nacozy 1977"},{"why":"Provides the outer Solar System masses and orbital parameters used in the long-term test.","marker":"Hairer et al. (2006)"},{"why":"Supplies the periodic three-body configuration with close encounters used to test adaptivity.","marker":"Liao et al. (2022)"}],"fun_headline_variants":["Broyden-based symplectic integrator handles close encounters","Quasi-Newton trick speeds symplectic integration without energy drift","Adaptive symplectic integrator saves CPU with Broyden solver","Close encounters handled by adaptive symplectic integrator"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the quasi-Newton iteration converges, at every time step, to the exact solution of the discrete map's nonlinear equations within the 1e-12 tolerance; if that solve is not accurate enough, the map is no longer truly symplectic even when the energy error looks bounded.","fun_headline_variants_meta":{"raw":{"variants":["Broyden-based symplectic integrator handles close encounters","Quasi-Newton trick speeds symplectic integration without energy drift","Adaptive symplectic integrator saves CPU with Broyden solver","Close encounters handled by adaptive symplectic integrator"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00147,"raw_usage":{"total_tokens":5881,"prompt_tokens":885,"completion_tokens":4996,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":501,"completion_tokens_details":{"reasoning_tokens":4924}},"tokens_in":501,"tokens_out":4996,"duration_ms":35042,"temperature":1.0,"reasoning_tokens":4924,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T15:45:05.789285+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compare SQQ-PTQ's orbital phase, such as perihelion time or longitude, against a high-precision reference over 10,000 Kepler periods, and rerun the three-body test with the nonlinear tolerance loosened to 1e-8 and tightened to 1e-14; if phase error grows linearly while energy error stays bounded, or if the close-encounter timing shifts without an energy-error change, the energy diagnostic is masking a loss of symplecticity.","supporting_citations":[{"cited_title":"2012, Int","cited_arxiv_id":null,"evidence_quote":"Supplies the base SQQ integrator and its least-action generating-function construction, which SQQ-PTQ extends."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the quasi-Newton update that lets SQQ-PTQ avoid forming the Jacobian of the transformed Hamiltonian."},{"cited_title":"1997, Appl","cited_arxiv_id":null,"evidence_quote":"Establishes that time transformation makes explicit symplectic methods implicit, motivating the nonlinear solve."},{"cited_title":"& Tremaine, S","cited_arxiv_id":null,"evidence_quote":"Shows how time transformation can implement adaptive stepping while preserving symplectic structure."},{"cited_title":"& Leimkuhler, B","cited_arxiv_id":null,"evidence_quote":"Supplies the step-size control function and the bounds used in the paper's adaptive step strategy."},{"cited_title":"1977, Celest","cited_arxiv_id":null,"evidence_quote":"Gives the Darboux-Sundman transformation K = σ(H - H0) that keeps the transformed system Hamiltonian."},{"cited_title":"2006, Geometric Numerical Integration, 2nd edn","cited_arxiv_id":null,"evidence_quote":"Provides the outer Solar System masses and orbital parameters used in the long-term test."},{"cited_title":"2022, New Astron., 96, 101850","cited_arxiv_id":null,"evidence_quote":"Supplies the periodic three-body configuration with close encounters used to test adaptivity."}],"review_version":1}