arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2209.06374cs.DSmath.DS
收藏

基于Koopman算子理论的双(半)共轭

Algorithmic (Semi-)Conjugacy via Koopman Operator Theory

William T. Redman, Maria Fonoberova, Ryan Mohr, Ioannis G. Kevrekidis, Igor Mezić

摘要:

迭代算法在决策和控制中具有极其重要的意义。随着越来越多的算法被开发、分发和私有化,对能够提供分类和比较的方法的需求也在类似地增长。通过将迭代算法视为离散时间动力系统,我们利用Koopman算子理论来识别算法之间的(半)共轭,使用它们的谱特性。这提供了一个通用的框架来分类和比较算法。

英文摘要:

Iterative algorithms are of utmost importance in decision and control. With an ever growing number of algorithms being developed, distributed, and proprietarized, there is a similarly growing need for methods that can provide classification and comparison. By viewing iterative algorithms as discrete-time dynamical systems, we leverage Koopman operator theory to identify (semi-)conjugacies between algorithms using their spectral properties. This provides a general framework with which to classify and compare algorithms.

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

↑