Resolvent-Based Optimisation for Approximating the Statistics of a Chaotic Lorenz System
Thomas Burton, Sean Symon, Ati Sharma, Davide Lasagna

TL;DR
This paper introduces a new method combining variational and resolvent analysis to efficiently approximate the statistical properties of chaotic systems like the Lorenz equations, reducing computational complexity.
Contribution
It presents a novel framework that uses resolvent modes and gradient-based optimisation to approximate chaotic attractors without requiring exact unstable periodic orbits.
Findings
Rapid convergence of statistical measures to long-term averages
Effective dimensionality reduction from three to two dimensions in Lorenz system
Approximate trajectories capture key statistical properties of chaos
Abstract
We propose a novel framework for approximating the statistical properties of turbulent flows by combining variational methods for the search of unstable periodic orbits with resolvent analysis for dimensionality reduction. Traditional approaches relying on identifying all short, fundamental unstable periodic orbits to compute ergodic averages via cycle expansion are computationally prohibitive for high-dimensional fluid systems. Our framework stems from the observation in Lasagna, Phys. Rev. E (2020), that a single unstable periodic orbit with a period sufficiently long to span a large fraction of the attractor captures the statistical properties of chaotic trajectories. Given the difficulty of identifying unstable periodic orbits for high-dimensional fluid systems, approximate trajectories residing in a low-dimensional subspace are instead constructed using resolvent modes, which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
