arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.10263math.DSeess.SP
收藏

用水库计算机逼近Koopman算子的两种方法

Two methods to approximate the Koopman operator with a reservoir computer

Marvyn Gulina, Alexandre Mauroy

摘要:

Koopman算子为动力系统的数据驱动分析提供了一个强大的框架。在过去的几年中,丰富的数值方法提供有限维近似的运营商已被提出(如扩展动态模式分解(EDMD)及其变种)。虽然EDMD的收敛结果需要无限数量的字典元素,但最近的研究表明,只要通过适当的训练过程精心选择,只有少数字典元素可以产生Koopman算子的有效近似。然而,该训练过程通常依赖于非线性最优化技术。在本文中,我们提出了两种新的方法的基础上水库计算机训练字典。这些方法仅依赖于线性凸优化。我们说明了几个数值例子的背景下,数据重建,预测和计算的Koopman算子谱的方法的效率。这些结果为库普曼算子框架下油藏计算机的使用铺平了道路。

英文摘要:

The Koopman operator provides a powerful framework for data-driven analysis of dynamical systems. In the last few years, a wealth of numerical methods providing finite-dimensional approximations of the operator have been proposed (e.g. extended dynamic mode decomposition (EDMD) and its variants). While convergence results for EDMD require an infinite number of dictionary elements, recent studies have shown that only few dictionary elements can yield an efficient approximation of the Koopman operator, provided that they are well-chosen through a proper training process. However, this training process typically relies on nonlinear optimization techniques. In this paper, we propose two novel methods based on a reservoir computer to train the dictionary. These methods rely solely on linear convex optimization. We illustrate the efficiency of the method with several numerical examples in the context of data reconstruction, prediction, and computation of the Koopman operator spectrum. These results pave the way to the use of the reservoir computer in the Koopman operator framework.

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

↑