Computation of minimal periods for ordinary differential equations

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Parker, Jeremy P.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911211981897728
author Parker, Jeremy P.
author_facet Parker, Jeremy P.
contents We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the state space of the corresponding dynamical system and satisfying a certain pointwise inequality, we can obtain a global lower bound for such periods. We give a method valid for the case of bounding the period of only those solutions which are invariant under a symmetry transformation, as well as bounds for general periodic orbits. If the governing equations are polynomial in the state variables, we can use semidefinite programming to find such auxiliary functions computationally, and thus compute lower bounds which can be rigorously validated using rational arithmetic. We apply our method to the Lorenz and Henon-Heiles systems. For both systems we are able to give validated bounds which are sharp to several decimal places.
format Preprint
id arxiv_https___arxiv_org_abs_2510_13650
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Computation of minimal periods for ordinary differential equations
Parker, Jeremy P.
Dynamical Systems
Classical Analysis and ODEs
Chaotic Dynamics
We consider the problem of finding the shortest possible period for an exactly periodic solution to some given autonomous ordinary differential equation. We show that, given a pair of Lyapunov-like observable functions defined over the state space of the corresponding dynamical system and satisfying a certain pointwise inequality, we can obtain a global lower bound for such periods. We give a method valid for the case of bounding the period of only those solutions which are invariant under a symmetry transformation, as well as bounds for general periodic orbits. If the governing equations are polynomial in the state variables, we can use semidefinite programming to find such auxiliary functions computationally, and thus compute lower bounds which can be rigorously validated using rational arithmetic. We apply our method to the Lorenz and Henon-Heiles systems. For both systems we are able to give validated bounds which are sharp to several decimal places.
title Computation of minimal periods for ordinary differential equations
topic Dynamical Systems
Classical Analysis and ODEs
Chaotic Dynamics
url https://arxiv.org/abs/2510.13650