Bounds on mean energy in the Kuramoto-Sivashinsky equation computed using semidefinite programming
David Goluskin, Giovanni Fantuzzi

TL;DR
This paper develops computational methods using semidefinite programming to bound the long-term average energy in the Kuramoto-Sivashinsky equation, providing evidence that mean energy remains bounded for large domain sizes.
Contribution
It introduces a novel SDP-based approach to compute bounds on PDE solutions' energy, combining polynomial auxiliary functionals with PDE truncation and analytical estimates.
Findings
Computed sharp bounds for energy for L ≤ 10
Results agree with analytical estimates and previous conjectures
Provides first positive computational evidence for bounded mean energy as L increases
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
