arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.06138eess.SYcs.SYmath.DS
收藏

Koopman特征函数和不变子空间的并行学习用于精确的长期预测

Parallel Learning of Koopman Eigenfunctions and Invariant Subspaces For Accurate Long-Term Prediction

Masih Haseli, Jorge Cortés

摘要:

我们提出了一个并行的数据驱动的策略,以确定有限维的功能空间不变下的Koopman运营商与一个未知的动力系统。我们建立在对称子空间分解(SSD)算法,集中的方法,在温和的条件下,数据采样可证明发现最大的Koopman不变的子空间和所有Koopman特征函数在任意有限维的功能空间。一个处理器网络,每个都知道一个共同的字典的功能,并配备了一组本地的数据快照,反复互动的有向通信图。每个处理器接收其邻居对不变字典的估计,并通过将SSD与其本地数据应用于由其自己的字典和邻居的字典跨越的子空间的交集来细化其估计。我们确定条件的网络拓扑,以确保该算法确定的最大Koopman不变子空间的跨度的原始字典,其时间,计算和通信的复杂性,并建立其对通信故障的鲁棒性。

英文摘要:

We present a parallel data-driven strategy to identify finite-dimensional functional spaces invariant under the Koopman operator associated to an unknown dynamical system. We build on the Symmetric Subspace Decomposition (SSD) algorithm, a centralized method that under mild conditions on data sampling provably finds the maximal Koopman-invariant subspace and all Koopman eigenfunctions in an arbitrary finite-dimensional functional space. A network of processors, each aware of a common dictionary of functions and equipped with a local set of data snapshots, repeatedly interact over a directed communication graph. Each processor receives its neighbors' estimates of the invariant dictionary and refines its estimate by applying SSD with its local data on the intersection of the subspaces spanned by its own dictionary and the neighbors' dictionaries. We identify conditions on the network topology to ensure the algorithm identifies the maximal Koopman-invariant subspace in the span of the original dictionary, characterize its time, computational, and communication complexity, and establish its robustness against communication failures.

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

↑