arXiv Analytics

Sign in

arXiv:2405.00539 [math.NA]AbstractReferencesReviewsResources

Data-driven approximation of Koopman operators and generators: Convergence rates and error bounds

Liam Llamazares-Elias, Samir Llamazares-Elias, Jonas Latz, Stefan Klus

Published 2024-05-01Version 1

Global information about dynamical systems can be extracted by analysing associated infinite-dimensional transfer operators, such as Perron-Frobenius and Koopman operators as well as their infinitesimal generators. In practice, these operators typically need to be approximated from data. Popular approximation methods are extended dynamic mode decomposition (EDMD) and generator extended mode decomposition (gEDMD). We propose a unified framework that leverages Monte Carlo sampling to approximate the operator of interest on a finite-dimensional space spanned by a set of basis functions. Our framework contains EDMD and gEDMD as special cases, but can also be used to approximate more general operators. Our key contributions are proofs of the convergence of the approximating operator and its spectrum under non-restrictive conditions. Moreover, we derive explicit convergence rates and account for the presence of noise in the observations. Whilst all these results are broadly applicable, they also refine previous analyses of EDMD and gEDMD. We verify the analytical results with the aid of several numerical experiments.

Related articles: Most relevant | Search more
arXiv:2405.18034 [math.NA] (Published 2024-05-28)
Convergence rates of particle approximation of forward-backward splitting algorithm for granular medium equations
arXiv:2001.07483 [math.NA] (Published 2020-01-21)
Convergence rates of the Semi-Discrete method for stochastic differential equations
arXiv:0803.3824 [math.NA] (Published 2008-03-27)
Convergence rates for adaptive finite elements