Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system

Abstract

We describe methods for proving bounds on infinite-time averages in differential dynamical systems. The methods rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be proved using Lyapunov functions. Nonnegativity is enforced by requiring the polynomials to be sums of squares, a condition which is then formulated as a semidefinite program (SDP) that can be solved computationally. Although such computations are subject to numerical error, we demonstrate two ways to obtain rigorous results: using interval arithmetic to control the error of an approximate SDP solution, and finding exact analytical solutions to relatively small SDPs. Previous formulations are extended to allow for bounds depending analytically on parametric variables. These methods are illustrated using the Lorenz equations, a system with three state variables $(x,y,z)$ and three parameters $(\beta ,\sigma ,r)$. Bounds are reported for infinite-time averages of all eighteen moments $x^l{y}^m{z}^n$ up to quartic degree that are symmetric under $(x,y)\mapsto (-x,-y)$. These bounds apply to all solutions regardless of stability, including chaotic trajectories, periodic orbits, and equilibrium points. The analytical approach yields two novel bounds that are sharp: the mean of $z^3$ can be no larger than its value of $(r-1{)}^3$ at the nonzero equilibria, and the mean of $x{y}^3$ must be nonnegative. The interval arithmetic approach is applied at the standard chaotic parameters to bound eleven average moments that all appear to be maximized on the shortest periodic orbit. Our best upper bound on each such average exceeds its value on the maximizing orbit by less than 1%. Many bounds reported here are much tighter than would be possible without computer assistance.

33 pages, 2 figures, 5 tables; v3: changes to exposition

References in corpus (3)

• Symmetry groups, semidefinite programs, and sums of squares
• Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
• Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems

Cited by in corpus (19)

• Bounds on mean energy in the Kuramoto-Sivashinsky equation computed using semidefinite programming
• Bounding extreme events in nonlinear dynamics using convex optimization
• Relationship between the methods of bounding time averages
• Bounds on heat transfer for Bénard-Marangoni convection at infinite Prandtl number
• Bounding extrema over global attractors using polynomial optimisation
• Auxiliary Functions as Koopman Observables: Data-Driven Analysis of Dynamical Systems via Polynomial Optimization
• Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization
• Maximum Amplification of Enstrophy in 3D Navier-Stokes Flows
• Finding extremal periodic orbits with polynomial optimisation, with application to a nine-mode model of shear flow
• Systematic Search For Extreme and Singular Behavior in Some Fundamental Models of Fluid Mechanics
• Sparse sum-of-squares (SOS) optimization: A bridge between DSOS/SDSOS and SOS optimization for sparse polynomials
• Optimal cooling of an internally heated disc
• Circuit Bounds on Stochastic Transport in the Lorenz Equations
• Finding unstable periodic orbits: a hybrid approach with polynomial optimization
• Time averages and periodic attractors at high Rayleigh number for Lorenz-like models
• A study of the double pendulum using polynomial optimization
• Minimum wave speeds in monostable reaction-diffusion equations: sharp bounds by polynomial optimization
• Data-driven Discovery of Invariant Measures
• Rotating Rayleigh-Benard convection: Attractors, bifurcations and heat transport via a Galerkin hierarchy