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

稀疏数据下Koopman算子的计算

On Computation of Koopman Operator from Sparse Data

Subhrajit Sinha, Enoch Yeung

摘要:

在本文中,我们提出了一种新的方法来计算稀疏时间序列数据的Koopman算子。近年来,数据驱动的动力系统分析的算子理论方法引起了人们极大的兴趣。用于Koopman算子的近似的现有技术需要足够大的数据集,但是在许多应用中,数据集可能不够大以将算子近似到可接受的极限。在本文中,使用鲁棒优化的思想,我们提出了一个算法来计算稀疏数据的Koopman算子。我们丰富的人工数据点的稀疏数据集,通过添加有界人工噪声和制定的噪声鲁棒学习问题作为一个强大的最优化问题,并表明最优解是Koopman算子的最小误差。我们说明了我们所提出的方法在三个不同的动力系统,即线性系,非线性系统和动力系统所管辖的偏微分方程的效率。

英文摘要:

In this paper we propose a novel approach to compute the Koopman operator from sparse time series data. In recent years there has been considerable interests in operator theoretic methods for data-driven analysis of dynamical systems. Existing techniques for the approximation of the Koopman operator require sufficiently large data sets, but in many applications, the data set may not be large enough to approximate the operators to acceptable limits. In this paper, using ideas from robust optimization, we propose an algorithm to compute the Koopman operator from sparse data. We enrich the sparse data set with artificial data points, generated by adding bounded artificial noise and and formulate the noisy robust learning problem as a robust optimization problem and show that the optimal solution is the Koopman operator with smallest error. We illustrate the efficiency of our proposed approach in three different dynamical systems, namely, a linear system, a nonlinear system and a dynamical system governed by a partial differential equation.

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

↑