arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.02494math.DS
收藏

Koopman算子的数据驱动逼近的方差表示与收敛速率

Variance representations and convergence rates for data-driven approximations of Koopman operators

Friedrich M. Philipp, Manuel Schaller, Septimus Boshoff, Sebastian Peitz, Feliks Nüske, Karl Worthmann

AI总结:

本文为EDMD逼近Koopman算子严格推导误差界,证明i.i.d.采样指数收敛及遍历采样超线性收敛,并基于方差表示验证于复杂系统。

摘要:

我们严格推导了扩展动态模态分解(EDMD)逼近Koopman算子的新误差界,适用于离散时间和连续时间(随机)系统;在非限制性假设下,分别针对独立同分布采样和遍历采样。我们证明了独立同分布采样的指数收敛速率,并首次给出了确定性系统遍历采样的超线性收敛速率。证明基于质量矩阵和刚度矩阵的经验估计量的新颖精确方差表示。此外,我们通过数值模拟验证了所推导误差界和收敛速率的准确性,模拟对象包括非线性偏微分方程在内的高度复杂动力系统。

英文摘要:

We rigorously derive novel error bounds for extended dynamic mode decomposition (EDMD) to approximate the Koopman operator for discrete- and continuous time (stochastic) systems; both for i.i.d. and ergodic sampling under non-restrictive assumptions. We show exponential convergence rates for i.i.d. sampling and provide the first superlinear convergence rates for ergodic sampling of deterministic systems. The proofs are based on novel exact variance representations for the empirical estimators of mass and stiffness matrix. Moreover, we verify the accuracy of the derived error bounds and convergence rates by means of numerical simulations for highly-complex dynamical systems including a nonlinear partial differential equation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑