Papers
Topics
Authors
Recent
Search
2000 character limit reached

Adjoint-based variational method for constructing periodic orbits of high-dimensional chaotic systems

Published 13 Jul 2020 in nlin.CD and physics.flu-dyn | (2007.06427v1)

Abstract: Chaotic dynamics in systems ranging from low-dimensional nonlinear differential equations to high-dimensional spatio-temporal systems including fluid turbulence is supported by non-chaotic, exactly recurring time-periodic solutions of the governing equations. These unstable periodic orbits capture key features of the turbulent dynamics and sufficiently large sets of orbits promise a framework to predict the statistics of the chaotic flow. Computing periodic orbits for high-dimensional spatio-temporally chaotic systems remains challenging as known methods either show poor convergence properties because they are based on time-marching of a chaotic system causing exponential error amplification; or they require constructing Jacobian matrices which is prohibitively expensive. We propose a new matrix-free method that is unaffected by exponential error amplification, is globally convergent and can be applied to high-dimensional systems. The adjoint-based variational method constructs an initial value problem in the space of closed loops such that periodic orbits are attracting fixed points for the loop-dynamics. We introduce the method for general autonomous systems. An implementation for the one-dimensional Kuramoto-Sivashinsky equation demonstrates the robust convergence of periodic orbits underlying spatio-temporal chaos. Convergence does not require accurate initial guesses and is independent of the period of the respective orbit.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.