

























Abstract:For continuous-time dynamical systems with reversible trajectories, the nowhere-vanishing eigenfunctions of the Koopman operator of the system form a multiplicative group. Here, we exploit this property to accelerate the systematic numerical computation of the eigenspaces of the operator. Given a small set of (so-called ``principal'') eigenfunctions that are approximated conventionally, we can obtain a much larger set by constructing polynomials of the principal eigenfunctions. This enriches the set, and thus allows us to more accurately represent application-specific observables. Often, eigenfunctions exhibit localized singularities (e.g. in simple, one-dimensional problems with multiple steady states) or extended ones (e.g. in simple, two-dimensional problems possessing a limit cycle, or a separatrix); we discuss eigenfunction matching/continuation across such singularities. By handling eigenfunction singularities and enabling their continuation, our approach supports learning consistent global representations from locally sampled data. This is particularly relevant for multistable systems and applications with sparse or fragmented measurements.
| Subjects: | Dynamical Systems (math.DS); Machine Learning (cs.LG); Numerical Analysis (math.NA) |
| Cite as: | arXiv:2604.21825 [math.DS] |
| (or arXiv:2604.21825v1 [math.DS] for this version) | |
| https://doi.org/10.48550/arXiv.2604.21825 arXiv-issued DOI via DataCite (pending registration) |
From: Zahra Monfared [view email]
[v1]
Thu, 23 Apr 2026 16:17:31 UTC (6,915 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。