Search Results for « Log-Koopman »

Monitoring the networked dynamics via the subset of nodes is essential for a variety of scientific and operational purposes. When there is a lack of an explicit model and networked signal space, traditional observability analysis and non-convex methods are insufficient. Current data-driven Koopman linearization, although derives a linear evolution model for selected vector-valued observable of original state-space, may result in a large sampling set due to: (i) the large size of polynomial based observables (O(N2), N number of nodes in network), and (ii) not factoring in the nonlinear dependency between observables. In this work, to achieve linear scaling (O(N)) and a small set of sampling nodes, we propose to combine a novel Log-Koopman operator and nonlinear Graph Fourier Transform (NL-GFT) scheme. First, the Log-Koopman operator is able to reduce the size of observables by transforming multiplicative poly-observable to logarithm summation. Second, a nonlinear GFT concept and sampling theory are provided to exploit the nonlinear dependence of observables for observability analysis using Koopman evolution model. The results demonstrate that the proposed Log-Koopman NL-GFT scheme can (i) linearize unknown nonlinear dynamics using O(N) observables, and (ii) achieve lower number of sampling nodes, compared with the state-of-the art polynomial Koopman based observability analysis.

We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.

We present a low-rank Koopman operator formulation for accelerating deformable subspace simulation. Using a Dynamic Mode Decomposition (DMD) parameterization of the Koopman operator, our method learns the temporal evolution of deformable dynamics and predicts future states through efficient matrix evaluations instead of sequential time integration. This yields log-linear scaling in the number of time steps and allows large portions of the trajectory to be skipped while retaining accuracy. The resulting temporal efficiency is especially advantageous for optimization tasks such as control and initial-state estimation, where the objective often depends largely on the final configuration. To broaden the scope of Koopman-based reduced-order models in graphics, we introduce a discretization-agnostic extension that learns shared dynamic behavior across multiple shapes and mesh resolutions. Prior DMD-based approaches have been restricted to a single shape and discretization, which limits their usefulness for tasks involving geometry variation. Our formulation generalizes across both shape and discretization, which enables fast shape optimization that was previously impractical for DMD models. This expanded capability highlights the potential of Koopman operator learning as a practical tool for efficient deformable simulation and design.

For the class of continuous, measure-preserving automorphisms on compact metric spaces, a procedure is proposed for constructing a sequence of finite-dimensional approximations to the associated Koopman operator on a Hilbert space. These finite-dimensional approximations are obtained from the so-called “periodic approximation” of the underlying automorphism and take the form of permutation operators. Results are established on how these discretizations approximate the Koopman operator spectrally. Specificaly, it is shown that both the spectral measure and the spectral projectors of these permutation operators converge weakly to their infinite-dimensional counterparts. Based on this result, a numerical method is derived for computing the spectra of volume-preserving maps on the unit $m$-torus. The discretized Koopman operator can be constructed by solving a bipartite matching problem with $\mathcal{O}(\tilde{n}^{3m/2})$ time-complexity, where $\tilde{n}$ denotes the gridsize on each dimension. By exploiting the permutation structure of the discretized Koopman operator, it is further shown that the projections and density functions are computable in $\mathcal{O}( m \tilde{n}^{m} \log \tilde{n})$ operations using the FFT algorithm. Our method is illustrated on several classical examples of automorphisms on the torus that contain either a discrete, continuous, or a mixed spectra. In addition, the spectral properties of the Chirikov standard map are examined using our method.

This work proposes a data-driven Koopman modeling approach for nonlinear systems that takes into account the effect of noise, where the underlying noise distribution, autocorrelations, and governing differential equations are unknown. The method uses block coordinate descent to solve a regularized least squares problem by utilizing the extended dynamic mode decomposition (eDMD) framework for linearization and the log-likelihood characterization of the noise. Specifically, it learns a mapping to lift the nonlinear system to a higher-dimensional approximated linear system while also identifying the noise components in the lifted space. Furthermore, we prove theoretically that the identified model, when given new noisy data, can be used to predict the succeeding states with a guaranteed upper bound on the prediction error. Case studies are performed on a Van der Pol oscillator and a four-stage binary distillation column where unknown noise is present.

We propose an alternating optimization algorithm to the nonconvex Koopman operator learning problem for nonlinear dynamic systems. We show that the proposed algorithm will converge to a critical point with rate O(1/T) and $O\left( {\frac{1}{{\log T}}} \right)$ for the constant and diminishing learning rates, respectively, under some mild conditions. To cope with the high dimensional nonlinear dynamical systems, we present the first-ever distributed Koopman operator learning algorithm. We show that the distributed Koopman operator learning has the same convergence properties as the centralized Koopman operator learning, in the absence of optimal tracker, so long as the basis functions satisfy a set of state-based decomposition conditions. Numerical experiments are provided to complement our theoretical results.

Information about the behavior of dynamical systems can oftenbe obtained by analyzing the eigenvalues and corresponding eigenfunctions oflinear operators associated with a dynamical system. Examples of such operatorsare the Perron-Frobenius and the Koopman operator. In this paper, wewill review di erent methods that have been developed over the last decades tocompute nite-dimensional approximations of these in nite-dimensional operators- in particular Ulam's method and Extended Dynamic Mode Decomposition(EDMD) - and highlight the similarities and di erences between theseapproaches. The results will be illustrated using simple stochastic di erentialequations and molecular dynamics examples.

Orchestrated collectives of large language model (LLM) agents that debate and vote are an emerging form of computational intelligence: the intelligent behaviour resides in the \emph{interaction}, not in any single agent. They improve task accuracy, yet remain black boxes at the system level: there is no principled test of convergence, no bound on the rounds needed, and no faithful account of what drove a decision. This paper develops a novel framework based on Koopman operator theory and validates its theoretical guarantees on multi-agent consensus dynamics. Treating the collective as one nonlinear dynamical system on a communication graph, we read its essential behaviour off the spectrum of its Koopman transfer operator, an exact linear representation of the nonlinear dynamics estimated from interaction traces. The spectrum yields three machine-checkable certificates: the sub-dominant eigenvalue $λ_2$ fixes the intrinsic timescale of reasoning and yields a convergence deadline computable \emph{before} the debate runs; its eigenvector names the coherent factions the collective reasons in, and $|λ_2|$ certifies when that explanation is valid; and the leading spectral coordinates form a compressed, auditable message basis. On an attention-consensus model, the deadline tracks observed convergence with log--log correlation $0.93$ and bounds it in 96\% of 24 configurations; attribution is exact whenever the spectrum certifies metastability; eight of 32 coordinates preserve the decision at 99.7\% fidelity; and a certificate learned from 15 debates held on 60/60 held-out debates. The study runs in minutes on a CPU, making spectral certification a practical layer for trustworthy collective reasoning.

We propose a novel operator-theoretic framework to study global stability of nonlinear systems. Based on the spectral properties of the so-called Koopman operator, our approach can be regarded as a natural extension of classic linear stability analysis to nonlinear systems. The main results establish the (necessary and sufficient) relationship between the existence of specific eigenfunctions of the Koopman operator and the global stability property of hyperbolic fixed points and limit cycles. These results are complemented with numerical methods which are used to estimate the region of attraction of the fixed point or to prove in a systematic way global stability of the attractor within a given region of the state space.

A common way to represent a system's dynamics is to specify how the state evolves in time. An alternative viewpoint is to specify how functions of the state evolve in time. This evolution of functions is governed by a linear operator called the Koopman operator, whose spectral properties reveal intrinsic features of a system. For instance, its eigenfunctions determine coordinates in which the dynamics evolve linearly. This review discusses the theoretical foundations of Koopman operator methods, as well as numerical methods developed over the past two decades to approximate the Koopman operator from data, for systems both with and without actuation. We pay special attention to ergodic systems, for which especially effective numerical methods are available. For nonlinear systems with an affine control input, the Koopman formalism leads naturally to systems that are bilinear in the state and the input, and this structure can be leveraged for the design of controllers and estimators.