Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems

@article{Tobasco2017OptimalBA,
  title={Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems},
  author={Ian Tobasco and David Goluskin and Charles R. Doering},
  journal={Physics Letters A},
  year={2017},
  volume={382},
  pages={382-386}
}
View PDF on arXiv
43 Citations
Highly Influential Citations
6
Background Citations
18
Methods Citations
13
Results Citations
1

Figures and Tables from this paper

43 Citations

Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization

A convex optimization framework for bounding extreme events in nonlinear dynamical systems governed by ordinary or partial differential equations (ODEs or PDEs) is studied and it is shown that near-optimal auxiliary functions can be used to construct spacetime sets that localize trajectories leading to extreme events.

Optimal time averages in non-autonomous nonlinear dynamical systems

The auxiliary function method allows computation of extremal long-time averages of functions of dynamical variables in autonomous nonlinear ordinary differential equations via convex optimization.…

Convex computation of maximal Lyapunov exponents

We describe an approach for finding upper bounds on an ODE dynamical system’s maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is…

Convex Computation of Extremal Invariant Measures of Nonlinear Dynamical Systems and Markov Processes

We propose a convex-optimization-based framework for computation of invariant measures of polynomial dynamical systems and Markov processes, in discrete and continuous time. The set of all invariant…

Bounding extrema over global attractors using polynomial optimisation

In particular, nonnegativity of certain polynomial expressions is enforced by requiring them to be representable as sums of squares, leading to a convex optimisation problem that can be recast as a semidefinite program and solved computationally.

Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz System

Methods for proving bounds on infinite-time averages in differential dynamical systems rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be proved using Lyapunov functions.

Finding unstable periodic orbits: a hybrid approach with polynomial optimization

Optimal minimax bounds for time and ensemble averages for the incompressible Navier-Stokes equations

The aim is to present a minimax optimization formula that yields optimal bounds for time and/or ensemble averages for the twoand threedimensional Navier-Stokes equations.

Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming

Borders are presented for bounding infinite-time averages in dynamical systems governed by nonlinear PDEs, which constitute the first positive evidence for this conjecture up to finite L, and they offer some guidance for analytical proofs.

Optimal minimax bounds for time and ensemble averages of dissipative infinite-dimensional systems with applications to the incompressible Navier-Stokes equations

The aim is to present a minimax optimization formula that yields optimal bounds for time and ensemble averages of dissipative infinite-dimensional systems, including the two- and three-dimensional Navier-Stokes equations.

34 References

Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization

Methods for proving upper and lower bounds on infinite-time averages in deterministic dynamical systems and on stationary expectations in stochastic systems are described, using sum-of-squares polynomials to formulate sufficient conditions that can be checked by semidefinite programming.

Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz System

Methods for proving bounds on infinite-time averages in differential dynamical systems rely on the construction of nonnegative polynomials with certain properties, similarly to the way nonlinear stability can be proved using Lyapunov functions.

Optimal periodic orbits of continuous time chaotic systems

  • YangHuntOtt
  • Physics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
This work sheds further light on the sense in which optimality is "typically" achieved at low period and finds that, as a system parameter is tuned to be closer to a crisis of the chaotic attractor, optimality may occur at higher period.

Introduction to Ergodic theory

Hyperbolic dynamics studies the iteration of maps on sets with some type of Lipschitz structure used to measure distance. In a hyperbolic system, some directions are uniformly contracted and others…

Convex analysis and variational problems

Preface to the classics edition Preface Part I. Fundamentals of Convex Analysis. I. Convex functions 2. Minimization of convex functions and variational inequalities 3. Duality in convex optimization…

Moments, Positive Polynomials And Their Applications

The semidefinite programming methodology to solve the generalized problem of moments is presented and several applications of the GPM are described in detail (notably in optimization, probability, optimal control andmathematical finance).

Deterministic nonperiodic flow

Finite systems of deterministic ordinary nonlinear differential equations may be designed to represent forced dissipative hydrodynamic flow. Solutions of these equations can be identified with…

Polynomial sum of squares in fluid dynamics: a review with a look ahead

It is proposed to use the bound on the energy dissipation rate as the cost functional in the design of flow control aimed at reducing turbulent drag.

Semidefinite programming relaxations for semialgebraic problems

  • P. Parrilo
  • Mathematics, Computer Science
    Math. Program.
  • 2003
It is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility and provide a constructive approach for finding bounded degree solutions to the Positivstellensatz.

On general minimax theorems

There have been several generalizations of this theorem. J. Ville [9], A. Wald [11], and others [1] variously extended von Neumann's result to cases where M and N were allowed to be subsets of…