cs.LGNov 27, 2025

Spatially Aware Dictionary-Free Koopman Eigenfunction Identification for Modeling and Control

Authors: David Grasev

Organizations: 1*Department of Aviation Technology, University of Defence, Brno, Czech Republic.

Abstract

A spatially aware dictionary-free eigenfunction discovery (SADFED) framework is proposed for identification of low-rank Koopman models from data without prescribing a lifting dictionary, kernel, or neural-network eigenfunction architecture. A reference trajectory is selected and used to determine the Koopman modes by regularized least squares (LS). Then, a transformed temporal basis allows the eigenfunction values at all sampled initial conditions to be obtained by a second regularized LS projection. Consequently, only the real and imaginary parts of the eigenvalues remain as the optimization variables. Interpolation of the identified eigenfunction samples reveals their spatial structure, enabling numerical estimation of their gradients. A joint objective combines trajectory reconstruction error with a normalized Koopman partial differential equation (KPDE) residual, promoting spatial consistency with the KPDE over the sampled region and serving as a physics-informed regularizer. The method is evaluated on a system with analytical Koopman eigenfunctions, the FitzHugh-Nagumo system, the van der Pol oscillator, the Duffing system, and a two-spool turbojet engine. The examples demonstrate recovery of known eigenfunctions, sensitivity to reference trajectory and hyperparameters, limit-cycle harmonics and isochrons, discontinuous indicator eigenfunctions and isostables, symmetry exploitation, and construction of state-dependent lifted input dynamics. For the turbojet example, the identified model is further used for state estimation and design of a gain-scheduled tracking linear quadratic Gaussian controller. The results indicate the applicability of SADFED to Koopman spectral identification and control-oriented modeling of nonlinear dynamical systems.

Figures & tables

Explore similar work

Jul 31, 2026

Dynamics-aware identification of governing equations from sparse and noisy data

Sparse identification of nonlinear dynamics (SINDy) and PDE functional identification (PDE-FIND) recover parsimonious ordinary and partial differential equations (ODEs and PDEs) from data. However, sparse and noisy temporal measurements can make derivative estimates unreliable. To address this problem, we evaluate Koopman-based upsampling techniques implemented with dynamic mode decomposition (DMD), extended DMD (EDMD), and optimized DMD. These methods learn finite-dimensional approximations of Koopman evolution on selected observables and are used to interpolate and denoise snapshots inside the observed time window before derivative estimation and sparse regression. The empirical benchmark comprises two ODE systems, Lorenz-63 and Van der Pol, and three periodic PDE systems, Burgers, Fisher-Kolmogorov-Petrovskii-Piskunov (Fisher-KPP), and linear advection-diffusion, over sparse and noisy sampling regimes. Polynomial EDMD gives the strongest ODE results, especially in coefficient accuracy. The PDE results are system-dependent: low-rank DMD-assisted reconstructions improve Burgers and advection-diffusion discovery, while the raw baseline (without upsampling) remains competitive for the Fisher-KPP data. A comparison against linear and smoothing-spline interpolation techniques shows that the selected Koopman-based preprocessors provide overall performance gains over these non-dynamical alternatives. We also demonstrate that DMD-assisted upsampling can stabilize Pareto-based non-oracle support-size selection. Overall, Koopman-based upsampling is best viewed as a dynamics-aware preprocessing step that can reduce derivative-estimation error when its observable representation and low-rank structure are appropriate for the data.
Jun 27, 2026

Residual-Guided Dictionary Learning for Spectrally Accurate Koopman Approximation

Koopman theory promises linear structure in nonlinear dynamics, but numerical Koopman spectra are easy to compute and hard to trust. A finite EDMD matrix always has eigenvalues; the problem is that many of them may have nothing to do with the infinite-dimensional operator. In this paper we make spectral reliability the objective of dictionary learning. We train neural-network dictionaries not merely to predict the next snapshot, but to minimize Residual Dynamic Mode Decomposition residuals: operator-level a posteriori errors that test whether computed eigenvalues and modes are genuine Koopman spectral objects. To keep the learned observables from collapsing into an unstable coordinate system, the loss also penalizes the condition number of the lifted data matrix. Thus the method couples two requirements that should not be separated: small Koopman residuals and a well-conditioned representation. The result is a learned dictionary that is expressive, numerically stable, and spectrally disciplined. Across conservative and dissipative benchmark systems, the method sharply reduces spectral pollution, improves residual pseudospectral inclusion, and lowers forecast error relative to standard fixed dictionaries. On sea-surface temperature data, it gives cleaner Koopman diagnostics and substantially better one-step forecasts from noisy observations with no governing equations. The message is simple: neural Koopman learning should be judged not by prediction alone, but by whether its spectral claims can be certified. Residuals provide the certificate; conditioning makes it computable.
Mar 16, 2026

Trustworthy Koopman Operator Learning: Invariance Diagnostics and Error Bounds

Koopman operator theory provides a global linear representation of nonlinear dynamics and underpins many data-driven methods. In practice, however, finite-dimensional feature spaces induced by a user-chosen dictionary are rarely invariant, so closure failures and projection errors lead to spurious eigenvalues, misleading Koopman modes, and overconfident forecasts. This paper addresses a central validation problem in data-driven Koopman methods: how to quantify invariance and projection errors for an arbitrary feature space using only snapshot data, and how to use these diagnostics to produce actionable guarantees and guide dictionary refinement? A unified a posteriori methodology is developed for certifying when a Koopman approximation is trustworthy and improving it when it is not. Koopman invariance is quantified using principal angles between a subspace and its Koopman image, yielding principal observables and a principal angle decomposition (PAD), a dynamics-informed alternative to SVD truncation with significantly improved performance. Multi-step error bounds are derived for Koopman and Perron--Frobenius mode decompositions, including RKHS-based pointwise guarantees, and are complemented by Gaussian process expected error surrogates. The resulting toolbox enables validated spectral analysis, certified forecasting, and principled dictionary and kernel learning, demonstrated on chaotic and high-dimensional benchmarks and real-world datasets, including cavity flow and the Pluto--Charon system.