Auxiliary Functions as Koopman Observables: Data-Driven Analysis of Dynamical Systems via Polynomial Optimization
Authors:
Preprint
Abstract
We present a flexible data-driven method for dynamical system analysis that does not require explicit model discovery. The method is rooted in well-established techniques for approximating the Koopman operator from data and is implemented as a semidefinite program that can be solved numerically. Furthermore, the method is agnostic of whether data is generated through a deterministic or stochastic process, so its implementation requires no prior adjustments by the user to accommodate these different scenarios. Rigorous convergence results justify the applicability of the method, while also extending and uniting similar results from across the literature. Examples on discovering Lyapunov functions, performing ergodic optimization, and bounding extrema over attractors for both deterministic and stochastic dynamics exemplify these convergence results and demonstrate the performance of the method.Keywords
All Related Versions
This publication has 70 references indexed in Scilit:
- Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz SystemJournal of Nonlinear Science, 2017
- On Convergence of Extended Dynamic Mode Decomposition to the Koopman OperatorJournal of Nonlinear Science, 2017
- A Data–Driven Approximation of the Koopman Operator: Extending Dynamic Mode DecompositionJournal of Nonlinear Science, 2015
- Sums of Squares, Moment Matrices and Optimization Over Polynomials2008
- Squared Functional Systems and Optimization Problems2000
- The Limit Cycle of the van der Pol Equation Is Not AlgebraicJournal of Differential Equations, 1995
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- Markov Processes1986
- On the speed of convergence in the ergodic theoremMonatshefte für Mathematik, 1978
- Ueber die Darstellung definiter Formen als Summe von FormenquadratenMathematische Annalen, 1888