pith. sign in

arxiv: 2512.01528 · v2 · pith:6WVX6POHnew · submitted 2025-12-01 · 🧮 math.NA · cs.NA· math.DS

Feedback Integrators: Non-Asymptotic Invariance for One-Step Methods and Gain Selection under Euler Discretization

Juho Bae , Dong Eui Chang This is my paper

Pith reviewed 2026-05-21 18:17 UTC · model grok-4.3

classification 🧮 math.NA cs.NAmath.DS
keywords feedback integratorsone-step methodspositive invarianceEuler discretizationgain selectionfirst integralsmanifold constraintsLyapunov functions
0
0 comments X

The pith

Feedback integrators achieve positive invariance of constraint neighborhoods for small step sizes in one-step methods.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper strengthens feedback integrator theory for systems on manifolds that preserve first integrals by proving non-asymptotic positive invariance: for general one-step methods, discrete trajectories remain inside arbitrarily small sublevel sets of a Lyapunov function measuring deviation from the manifold and integral values whenever the step size is small enough. This closes the previous gap between asymptotic attraction and practical guarantees for finite-time behavior. Specializing to Euler discretization, the analysis shows how feedback gain scales into the Taylor error bound, identifies ranges of scaled gains that preserve invariance, and derives adaptive gain rules that keep trajectories bounded. These findings make explicit gain selection possible for Euler methods while leaving it method-dependent for higher-order schemes, as confirmed by experiments on rigid body motion and Kepler problems.

Core claim

For general one-step methods, positive invariance of arbitrarily small sublevel neighborhoods of the feedback Lyapunov function holds for sufficiently small step sizes. For Euler discretization, ranges of scaled gains guarantee this invariance, a specific scaling minimizes the Taylor-based error bound, and adaptive stepwise or periodic gain rules yield bounded discrete trajectories.

What carries the argument

The feedback Lyapunov function whose sublevel neighborhoods are rendered positively invariant under the discrete map for small enough step sizes, with the gain term controlling attraction toward the manifold and integral constraints.

If this is right

  • Discrete trajectories stay close to the target manifold and integral values for small steps without eventual drift.
  • Explicit scaled-gain intervals and adaptive rules under Euler discretization produce bounded trajectories.
  • Gain selection closes in explicit form only for Euler discretization among one-step methods.
  • The approach supports reliable long-term integration of systems such as rigid-body rotation and Kepler orbits.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Error-expansion techniques used for Euler could be adapted to derive similar gain rules for other low-order methods.
  • Combining these adaptive rules with existing structure-preserving integrators might further reduce accumulated error in conservative systems.
  • The invariance results suggest checking robustness under variable step-size control in stiff manifold problems.

Load-bearing premise

The continuous dynamical system evolves on a manifold and admits first integrals preserved by the flow.

What would settle it

A numerical example in which, for a sequence of sufficiently small step sizes, the discrete trajectory eventually leaves every fixed sublevel neighborhood of the feedback Lyapunov function.

read the original abstract

For dynamical systems evolving on a manifold and admitting first integrals, standard one-step numerical methods generally cause the discrete trajectory to drift off the manifold and the numerical values of the first integrals to deviate from their prescribed values. Feedback integrators address this by extending the dynamics to an ambient Euclidean space and adding a feedback term that drives the numerical trajectory toward the set satisfying both the manifold constraint and the prescribed values of the first integrals. Existing theory, however, has two limitations: it remains asymptotic, guaranteeing only eventual entrance into an attractor containing the desired set, and it does not explain how the feedback gain should be chosen. In this paper, we first close the former gap for general one-step methods by proving positive invariance of arbitrarily small sublevel neighborhoods of the feedback Lyapunov function for sufficiently small step sizes. We then specialize to Euler discretization and analyze how the feedback gain enters the Taylor-based error bound. In this setting, we characterize a range of scaled gains that guarantee positive invariance for sufficiently small step sizes and identify the scaling that minimizes the Taylor-based upper bound. We further propose adaptive gain-selection rules under Euler discretization, including both stepwise and periodically updated variants, and establish corresponding boundedness guarantees for the resulting discrete trajectories. These results identify Euler discretization as the first setting in which gain selection for feedback integrators closes in explicit form, whereas extensions to general higher-order one-step methods remain genuinely method-dependent. Numerical experiments on free rigid body motion in $\operatorname{SO}(3)$, the Kepler problem, and a perturbed Kepler problem with rotational symmetry support the analysis.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript claims to address two limitations in existing feedback integrator theory for dynamical systems on manifolds that admit first integrals: the asymptotic nature of prior invariance guarantees and the lack of guidance on feedback gain selection. It proves non-asymptotic positive invariance of arbitrarily small sublevel neighborhoods of the feedback Lyapunov function for general one-step methods when the step size is sufficiently small. The paper then specializes to Euler discretization, derives Taylor-based error bounds that characterize admissible ranges of scaled gains guaranteeing invariance, identifies the scaling minimizing the bound, proposes stepwise and periodically updated adaptive gain rules with boundedness guarantees, and supports the analysis via numerical experiments on free rigid body motion in SO(3), the Kepler problem, and a perturbed Kepler problem with rotational symmetry.

Significance. If the proofs hold, the work supplies the first non-asymptotic invariance results for feedback integrators and renders gain selection explicit for the Euler method, which is a concrete advance for structure-preserving integration of constrained systems. The explicit scaling analysis and adaptive rules, together with the identification of Euler discretization as the setting where closed-form gain selection is feasible, strengthen the practical utility of the approach while highlighting method-dependent challenges for higher-order integrators.

minor comments (3)
  1. [§3] §3 (general one-step methods): the statement of the positive-invariance theorem should explicitly record the dependence of the admissible step-size upper bound on the Lipschitz constants of the vector field and the feedback term, as well as on the manifold dimension, to clarify uniformity.
  2. [§4.2] §4.2 (Euler gain analysis): the Taylor expansion leading to the error bound (presumably Eq. (4.5) or similar) treats the feedback correction as O(h); a short remark on the remainder term when the gain is scaled as 1/h^α would help readers verify the claimed minimizing value of α.
  3. [Numerical experiments] Numerical section: the experiments report trajectories for specific gains but do not tabulate the observed invariance radius versus the theoretical bound; adding one such comparison table would strengthen the link between analysis and computation.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading and positive assessment of our manuscript. The summary accurately captures our contributions on non-asymptotic positive invariance for general one-step methods and explicit scaled-gain selection under Euler discretization. We appreciate the recognition that this provides concrete advances for structure-preserving integration and renders gain selection explicit in the Euler setting.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The derivation establishes non-asymptotic positive invariance of sublevel sets of the feedback Lyapunov function for one-step methods via standard Lyapunov analysis combined with consistency of the numerical map for small step sizes. The manifold-and-first-integrals setting is used explicitly to construct the feedback but does not create a self-referential loop. No parameter is fitted to data and then relabeled as a prediction, no uniqueness theorem is imported from the authors' prior work to force the result, and the Taylor-based error bounds under Euler discretization are derived directly from the discretization rather than by construction from the target invariance statement. The paper is therefore self-contained against external mathematical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The work rests on standard smoothness and invariance assumptions from continuous dynamical systems together with the existence of a suitable feedback Lyapunov function; no new physical entities are postulated.

axioms (2)
  • domain assumption The continuous system evolves on a manifold and preserves given first integrals.
    Explicitly stated as the problem setting in the abstract.
  • domain assumption A feedback Lyapunov function exists whose sublevel sets characterize the desired manifold-plus-integral set.
    Central object used for the positive-invariance statements.
invented entities (1)
  • Feedback correction term no independent evidence
    purpose: Drives discrete trajectory toward the manifold and prescribed integral values.
    Added to the ambient-space extension of the dynamics.

pith-pipeline@v0.9.0 · 5819 in / 1356 out tokens · 46548 ms · 2026-05-21T18:17:50.866488+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages

  1. [1]

    write newline

    " write newline " cite write " FUNCTION editor.postfix editor num.names #1 > "( )" "( )" if FUNCTION editor.trans.postfix editor num.names #1 > "( )" "( )" if FUNCTION trans.postfix translator num.names #1 > "( )" "( )" if FUNCTION authors.editors.reflist.apa5 'field := 'dot := field num.names 'numnames := numnames 'format.num.names := format.num.names na...

    work page

  2. [2]

    , " * write output.state after.block = add.period write newline

    ENTRY address author booktitle chapter doi edition editor eid howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year eprint archive archivePrefix primaryClass adsurl adsnote version label INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.sta...

    work page

  3. [3]

    write newline

    " write newline "" before.all 'output.state := FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap duplicate "7" = swap duplicate "8" = swap "9" = or or or or or or or or or FUNCTION n.separate 't := "" #0 'numnames := t empty not t #-1 #1 subs...

    work page

  4. [4]

    , " * write output.state after.block = add.period write newline

    ENTRY address archive author booktitle chapter doi edition editor eid eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url volume year archivePrefix primaryClass adsurl adsnote version label extra.label sort.label short.list INTEGERS output.state before.all mid.sentence after.sent...

    work page

  5. [5]

    write newline

    " write newline "" before.all 'output.state := FUNCTION add.period duplicate empty 'skip "." * add.blank if FUNCTION if.digit duplicate "0" = swap duplicate "1" = swap duplicate "2" = swap duplicate "3" = swap duplicate "4" = swap duplicate "5" = swap duplicate "6" = swap duplicate "7" = swap duplicate "8" = swap "9" = or or or or or or or or or FUNCTION ...

    work page

  6. [6]

    write newline

    " write newline "" before.all 'output.state := FUNCTION output.doi doi empty skip "doi:" doi * "" * output if FUNCTION format.archive archivePrefix empty "" archivePrefix ":" * if FUNCTION format.primaryClass primaryClass empty "" " [" primaryClass * "] " * if FUNCTION format.eprint eprint empty "" archive empty " https://arxiv.org/abs/" eprint * " " * " ...

    work page

  7. [7]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTION find.integer 't := #0 'int := int not t empty not and t #1 #1 substring 's :=...

    work page

  8. [8]

    write newline

    " write newline "" before.all 'output.state := FUNCTION string.to.integer 't := t text.length 'k := #1 'char.num := t char.num #1 substring 's := s is.num s "." = or char.num k = not and char.num #1 + 'char.num := while char.num #1 - 'char.num := t #1 char.num substring FUNCTION find.integer 't := #0 'int := int not t empty not and t #1 #1 substring 's :=...

    work page

  9. [9]

    , " * write output.state after.block = add.period write newline

    ENTRY address archive author booktitle chapter edition editor eprint howpublished institution journal key keywords month note number organization pages publisher school series title type url doi volume year archivePrefix primaryClass eid adsurl adsnote version label INTEGERS output.state before.all mid.sentence after.sentence after.block FUNCTION init.sta...

    work page

  10. [10]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize " " * FUNCT...

    work page

  11. [11]

    Available from:

    ENTRY address assignee author booktitle chapter cartographer day edition editor howpublished institution inventor journal key keywords month note number organization pages part publisher school series title type volume word year eprint doi url lastchecked updated archive archivePrefix primaryClass eid adsurl adsnote version label INTEGERS output.state bef...

    work page

  12. [12]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 global.max substring 't := if while FUNCTION word.in bbl.in capitalize ":" * " " *...

    work page