This paper introduces a data‑driven neural power‑iteration algorithm for approximating the dominant eigenfunctions (modes) of the Koopman operator in nonlinear dynamical systems. By avoiding explicit construction of the operator’s projection, the method sidesteps the curse of dimensionality that plagues expressive neural templates. The authors provide theoretical convergence guarantees tied to sample size and network width, and demonstrate through numerical experiments that the approach yields accurate, smooth mode approximations without the drawbacks of traditional techniques such as extended dynamic mode decomposition.
arXiv:2607. 01819v1 Announce Type: cross Abstract: The Koopman operator has gained considerable attention due to its ability to provide a global linear representation of highly complex dynamical systems.
arXiv:2605. 01835v2 Announce Type: replace Abstract: Nonlinear coupled systems are ubiquitous in science and engineering.
arXiv:2604. 03086v2 Announce Type: replace-cross Abstract: This work establishes a rigorous bridge between infinite-dimensional delay dynamics and finite-dimensional Koopman learning, with explicit and interpretable error guarantees.
The paper introduces Functional Dynamic Mode Decomposition (fDMD), extending traditional DMD to infinite-dimensional systems by learning finite-rank operators from functional data such as observables, densities, or wavefunctions. It demonstrates that conventional DMD algorithms are special cases of fDMD and illustrates the approach with examples involving Koopman, Perron‑Frobenius, and Koopman‑von Neumann operators for graphons, ODEs, and SDEs.
arXiv:2606. 29083v1 Announce Type: cross Abstract: Koopman theory promises linear structure in nonlinear dynamics, but numerical Koopman spectra are easy to compute and hard to trust.
arXiv:2511.22648v2 Announce Type: replace Abstract: A spatially aware dictionary-free eigenfunction discovery (SADFED) framework is proposed for identification of low-rank Koopman models from data wi...
arXiv:2405. 07312v5 Announce Type: replace-cross Abstract: This paper presents a novel Koopman composition operator representation framework for control systems in reproducing kernel Hilbert spaces (RKHSs) that is free of explicit dictionary or input parametrizations.
The paper introduces K$^2$SVD, a method that learns the leading singular functions of the Koopman operator by optimizing a Hilbert-Schmidt objective, producing a low‑rank, interpretable Koopman representation with a compact latent space. In this space, temporal evolution is modeled with a linear Gaussian state‑space model and inference is performed via Kalman filtering to reduce noise accumulation in multi‑step predictions. Experiments demonstrate that K$^2$SVD outperforms state‑of‑the‑art methods on multiple datasets, achieving faster prediction speeds and lower computational cost.
The paper investigates how training shapes the geometry of recurrent network dynamics in Reservoir Computing (RC) networks used for temporal forecasting. It demonstrates that, in a linear continuous-time reservoir with infinite data, training data create an invariant subspace whose dimension matches the number of dominant modes. For a simplified diagonal linear reservoir, the study connects dominant eigenvalues and eigenvectors to the spectrum of a backward Dynamic Mode Decomposition matrix, providing a finite-dimensional approximation of the backward-time Koopman operator, and illustrates these phenomena through simulation while suggesting extensions to nonlinear RC.
arXiv:2606. 05131v1 Announce Type: new Abstract: Koopman theory turns nonlinear dynamics into a linear spectral problem.
arXiv:2605. 27756v2 Announce Type: replace-cross Abstract: Linear dimensionality reduction methods such as proper orthogonal decomposition (POD) make high-dimensional data amenable to analysis by identifying the principal components, or modes, that capture the most variance, or energy, in the data and constructing a low-dimensional representation in the subspace they span.
arXiv:2407. 06312v2 Announce Type: replace-cross Abstract: Many systems resist analytical modeling, making data-driven inference of dynamics important.