arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.00835eess.SYcs.SY
收藏

大规模动力系统的计算有效学习:Koopman理论方法

Computationally Efficient Learning of Large Scale Dynamical Systems: A Koopman Theoretic Approach

Subhrajit Sinha, Sai Pushpak Nandanoori, Enoch Yeung

摘要:

近年来,数据驱动的动力系统分析、发现和控制受到了相当大的推动。为此,算子理论方法,即Koopman算子方法已经获得了很大的兴趣。通常,库普曼算子是作为最小二乘问题的解获得的,因此,库普曼算子可以表示为涉及矩阵的Moore-Penrose逆的计算的封闭形式的解。对于高维系统,并且如果所获得的数据集的大小很大,则Moore-Penrose逆的计算在计算上变得具有挑战性。在本文中,我们提供了一个算法计算的Koopman算子的高维系统在一个时间有效的方式。我们进一步证明了所提出的方法在两个不同的系统,即耦合振荡器网络(状态空间维数高达2500)和IEEE 68总线系统(状态空间维数204和高达24,000个时间点)的有效性。

英文摘要:

In recent years there has been a considerable drive towards data-driven analysis, discovery and control of dynamical systems. To this end, operator theoretic methods, namely, Koopman operator methods have gained a lot of interest. In general, the Koopman operator is obtained as a solution to a least-squares problem, and as such, the Koopman operator can be expressed as a closed-form solution that involves the computation of Moore-Penrose inverse of a matrix. For high dimensional systems and also if the size of the obtained data-set is large, the computation of the Moore-Penrose inverse becomes computationally challenging. In this paper, we provide an algorithm for computing the Koopman operator for high dimensional systems in a time-efficient manner. We further demonstrate the efficacy of the proposed approach on two different systems, namely a network of coupled oscillators (with state-space dimension up to 2500) and IEEE 68 bus system (with state-space dimension 204 and up to 24,000 time-points).

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

↑