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

Abstract

We present methods for bounding infinite-time averages in dynamical systems governed by nonlinear PDEs. The methods rely on auxiliary functionals, which are similar to Lyapunov functionals but satisfy different inequalities. The inequalities are enforced by requiring certain expressions to be sums of squares of polynomials, and the optimal choice of auxiliary functional is posed as a semidefinite program (SDP) that can be solved computationally. To formulate these SDPs we approximate the PDE by truncated systems of ODEs and proceed in one of two ways. The first approach is to compute bounds for the ODE systems, increasing the truncation order until bounds converge numerically. The second approach incorporates the ODE systems with analytical estimates on their deviation from the PDE, thereby using finite truncations to produce bounds for the full PDE. We apply both methods to the Kuramoto-Sivashinsky equation. In particular, we compute upper bounds on the spatiotemporal average of energy by employing polynomial auxiliary functionals up to degree six. The first approach is used for most computations, but a subset of results are checked using the second approach, and the results agree to high precision. These bounds apply to all odd solutions of period 2πL, where L is varied. Sharp bounds are obtained for L ≤ 10, and trends suggest that more expensive computations would yield sharp bounds at larger L also. The bounds are known to be sharp (to within 0.1% numerical error) because they are saturated by the simplest nonzero steady states, which apparently have the largest mean energy among all odd solutions. Prior authors have conjectured that mean energy remains O(1) for L 1 since no particular solutions with larger energy have been found. Our bounds constitute the first positive evidence for this conjecture, albeit up to finite L, and they offer some guidance for analytical proofs. *

Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow

“…Tobasco et al [24] proved that (4) is a well-posed optimisation problem and that there exist optimal initial conditions a * 0 such that Φ(a * 0 ) = Φ * . In fact, there are clearly infinitely many such optimal initial conditions because Φ[a(t ; a * 0 )] = Φ(a * 0 ) for any fixed time t. The same authors also proved that Φ * can be characterised equivalently as the optimal value of a minimisation problem, originally proposed in [13] and further studied in [14][15][16]31], over continuously differentiable auxiliary functions V : R n → R. Precisely,…”

“…This is due to the poor scalability of general-purpose algorithms for SDPs. To reduce computational cost, one can exploit information about the boundedness and symmetry of V that can be deduced a priori [16,Appendix A]. Theorem 2 below shows that symmetry can be exploited in weighted SOS constraints, too.…”

Inferring symbolic dynamics of chaotic flows from persistence

“…49 Owing to its computational simplicity, nowadays the Kuramoto-Sivashinsky system is frequently chosen as the testing ground for methods to study high-dimensional chaos and turbulence. 43,44,[50][51][52][53] In (1 + 1) dimensions, the Kuramoto-Sivashinsky equation reads…”

Rigorous bounds on the heat transport of rotating convection with Ekman pumping

“…To bound the Nusselt number Nu we follow a general approach [24][25][26][27] and look for a so-called auxiliary functional of the dynamical variables, V T , θ , that is differentiable along solutions of (4a)-(4f), uniformly bounded in time, and satisfies…”