Koopman mode decomposition and tensor component analysis (also known as CANDECOMP/PARAFAC or canonical polyadic decomposition) are two popular approaches of decomposing high dimensional data sets into low dimensional modes that capture the most relevant features and/or dynamics. Despite their similar goal, the two methods are largely used by different scientific communities and formulated in distinct mathematical languages. We examine the two together and show that, under a certain (reasonable) condition on the data, the theoretical decomposition given by tensor component analysis is the \textit{same} as that given by Koopman mode decomposition. This provides a "bridge" with which the two communities should be able to more effectively communicate. When this condition is not met, Koopman mode decomposition still provides a tensor decomposition with an \textit{a priori} computable error, providing an alternative to the non-convex optimization that tensor component analysis requires. Our work provides new possibilities for algorithmic approaches to Koopman mode decomposition and tensor component analysis, provides a new perspective on the success of tensor component analysis, and builds upon a growing body of work showing that dynamical systems, and Koopman operator theory in particular, can be useful for problems that have historically made use of optimization theory.
Beyond expectations: Residual Dynamic Mode Decomposition and Variance for Stochastic Dynamical Systems
University of Cambridge(剑桥大学);University of Wisconsin-Madison(威斯康星大学麦迪逊分校);Allen Institute(艾伦研究所);University of Washington(华盛顿大学);Cornell University(康奈尔大学)
Trustworthy Koopman Operator Learning: Invariance Diagnostics and Error Bounds
Centre for Mathematical Sciences, University of Cambridge, UK(剑桥大学数学科学中心,英国);Department of Mathematics, Imperial College London, UK(伦敦帝国理工学院数学系,英国);Department of Mechanical Engineering, University of Washington, USA(美国华盛顿大学机械工程系)
Department of Mathematics, Imperial College London(帝国理工学院数学系);Department of Applied Mathematics and Theoretical Physics, University of Cambridge(剑桥大学应用数学与理论物理系)
Efficient Parametric SVD of Koopman Operator for Stochastic Dynamical Systems
Kim Jaechul Graduate School of AI, KAIST, Daejeon 34141, South Korea(韩国科学技术院人工智能研究生院);Department of EECS, MIT, Cambridge, MA 02139, United States(麻省理工学院电子工程与计算机科学系)
Data-driven approximation of Koopman operators and generators: Convergence rates and error bounds
University of Edinburgh(爱丁堡大学);Lancaster University(兰卡斯特大学);University of Salamanca(萨拉曼卡大学);University of Manchester(曼彻斯特大学);Heriot–Watt University(赫瑞-瓦特大学)