A study of the double pendulum using polynomial optimization

Abstract

In dynamical systems governed by differential equations, a guarantee that trajectories emanating from a given set of initial conditions do not enter another given set can be obtained by constructing a barrier function that satisfies certain inequalities on phase space. Often these inequalities amount to nonnegativity of polynomials and can be enforced using sum-of-squares conditions, in which case barrier functions can be constructed computationally using convex optimization over polynomials. To study how well such computations can characterize sets of initial conditions in a chaotic system, we use the undamped double pendulum as an example and ask which stationary initial positions do not lead to flipping of the pendulum within a chosen time window. Computations give semialgebraic sets that are close inner approximations to the fractal set of all such initial positions.

References in corpus (10)

• Control Barrier Function Based Quadratic Programs for Safety Critical Systems
• Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
• Bounds on mean energy in the Kuramoto-Sivashinsky equation computed using semidefinite programming
• Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
• Bounding extreme events in nonlinear dynamics using convex optimization
• Bounding stationary averages of polynomial diffusions via semidefinite programming
• Global stability of fluid flows despite transient growth of energy
• Bounding extrema over global attractors using polynomial optimisation
• Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization
• Finding extremal periodic orbits with polynomial optimisation, with application to a nine-mode model of shear flow