Robust computation of higher-dimensional invariant tori from individual trajectories
Maximilian Ruth, Jackson Kulik, Joshua Burby
TL;DR
The paper addresses the challenge of computing invariant tori of dimension $d>1$ from a single, short trajectory without continuation or initial guesses and without fixing a coordinate system. It develops a four-step pipeline: (i) Birkhoff reduced rank extrapolation to identify multiple frequencies, (ii) Bayesian MAP estimation to infer a valid rotation vector, (iii) Korkine-Zolatarev lattice reduction to select an optimal homology basis, and (iv) a least-squares Fourier parameterization of the torus. The authors demonstrate robustness by recovering many $d=2$ tori in a standard map and extending to $d=3$ tori in the Earth–Moon ER3BP, including island structures, while diagnosing near-resonant and filamentary cases as primary failure modes. The approach is coordinate-agnostic and non-perturbative, enabling practical torus computation in physical systems with limited a priori knowledge, and the accompanying SymplecticMapTools.jl package provides public access to the implementation.
Abstract
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.
