Papers › Robust computation of higher-dimensional invariant tori from individual trajectories
Robust computation of higher-dimensional invariant tori from individual trajectories
Maximilian Ruth, Jackson Kulik, Joshua Burby
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a method for computing invariant tori of dimension greater than one. The method uses a single short trajectory of a dynamical system without any continuation or initial guesses. No preferred coordinate system is required, meaning the method is practical for physical systems where the user does not have much \textit{a priori} knowledge. Three main tools are used to obtain the rotation vector of the invariant torus: the reduced rank extrapolation method, Bayesian maximum a posteriori estimation, and a Korkine-Zolatarev lattice basis reduction. The parameterization of the torus is found via a least-squares approach. The robustness of the algorithm is demonstrated by accurately computing many two-dimensional invariant tori of a standard map example. Examples of islands and three-dimensional invariant tori are shown as well.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections