Papers › Level Set Learning for Poincaré Plots of Symplectic Maps
Level Set Learning for Poincaré Plots of Symplectic Maps
Maximilian Ruth, David Bindel
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.
Many important qualities of plasma confinement devices can be determined via the Poincar\'e plot of a symplectic return map. These qualities include the locations of periodic orbits, magnetic islands, and chaotic regions of phase space. However, every evaluation of the magnetic return map requires solving an ODE, meaning a detailed Poincar\'e plot can be expensive to create. Here, we propose a kernel-based method of learning a single labeling function that is approximately invariant under the symplectic map. From the labeling function, we can recover the locations of invariant circles, islands, and chaos with few evaluations of the underlying symplectic map. Additionally, the labeling function comes with a residual, which serves as a measure of how invariant the label function is, and therefore as an indirect measure of chaos and map complexity.
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