非线性动力学的迭代稀疏辨识
Iterative Sparse Identification of Nonlinear Dynamics
AI总结:
本文提出迭代 SINDy 方法,通过迭代扩展和压缩字典,在保持与 SINDy 几乎相同性能的同时显著降低计算复杂度,使其适用于高维时间序列数据的控制方程提取。
摘要:
为了从时间序列数据中提取控制方程,人们提出了多种方法。其中,非线性动力学稀疏辨识(SINDy)是一种成功的方法,它利用压缩感知原理,能够以最少的项数对控制方程进行建模。这一依赖少量项数的特性对于可解释性至关重要。SINDy 的有效性取决于其字典中候选函数的选择,以便提取动力系统的控制方程。更大的字典允许包含更多项,从而提高近似质量。然而,计算复杂度随字典规模增长,使得 SINDy 不太适合高维数据集,尽管它已成功应用于低维数据集。为了应对这一挑战,本文提出了迭代 SINDy,其中字典通过迭代进行扩展和压缩。我们还对迭代 SINDy 的收敛性质进行了分析。仿真结果验证了迭代 SINDy 能够取得与 SINDy 几乎相同的性能,同时显著降低计算复杂度。值得注意的是,迭代 SINDy 在高维时间序列数据上表现出有效性,而不会产生与 SINDy 相关的过高计算成本。
英文摘要:
In order to extract governing equations from time-series data, various approaches are proposed. Among those, sparse identification of nonlinear dynamics (SINDy) stands out as a successful method capable of modeling governing equations with a minimal number of terms, utilizing the principles of compressive sensing. This feature, which relies on a small number of terms, is crucial for interpretability. The effectiveness of SINDy hinges on the choice of candidate functions within its dictionary to extract governing equations of dynamical systems. A larger dictionary allows for more terms, enhancing the quality of approximations. However, the computational complexity scales with dictionary size, rendering SINDy less suitable for high-dimensional datasets, even though it has been successfully applied to low-dimensional datasets. To address this challenge, we introduce iterative SINDy in this paper, where the dictionary undergoes expansion and compression through iterations. We also conduct an analysis of the convergence properties of iterative SINDy. Simulation results validate that iterative SINDy can achieve nearly identical performance to SINDy, while significantly reducing computational complexity. Notably, iterative SINDy demonstrates effectiveness with high-dimensional time-series data without incurring the prohibitively high computational cost associated with SINDy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。