Searcharxiv⌕ Search

arXiv · 2609.35389

Forced-Term Modeling in the Koopman Framework for Linear Operator Learning in Nonlinear Dynamical Systems

Abstract

We study the problem of extracting reliable and interpretable linear models from nonlinear dynamical systems with periodic behavior. Dynamic Mode Decomposition (DMD) is a widely used data-driven method for approximating dynamics by a linear system and is commonly interpreted through Koopman operator theory. However, because standard DMD assumes linear evolution in the chosen observables, it can produce misleading results on nonlinear systems. Recent extensions address this limitation by modeling the dynamics as a linear system driven by a nonlinear forcing term, but their relationship to Koopman theory and their reliability remain unclear. We observe that the Koopman theoretical framweork allows for explicit, finite-dimensional, forced linear representations of dynamical systems, independently of the chosen observable space. The main question is therefore how to choose a useful, computable, and interpretable model for the forcing term, since forced linear representations are generally nonunique. In the framework considered here, this modeling question is related to the choice of a defect space: a complementary space that closes the action of the Koopman operator on the chosen observables. Existing forced-DMD approaches can be related to different modeling choices for this defect space, where the structure of the learned linear operator depends on the choice of the defect space. As an example of defect-space modeling for algorithm design, we introduce Correlation-Basis enhanced DMD (CB-DMD), a data-driven method whose goal is to learn an effective autonomous linear operator for periodic nonlinear dynamics. The forcing term is used to absorb nonlinear components that cannot be represented by the learned linear operator. Experiments on three nonlinear periodic systems demonstrate that CB-DMD yields more reliable linear models than standard DMD and related variants in the tested examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paolo Climaco, Jochen Garcke, Xenia F. Gerloff. 2026-09-28. Forced-Term Modeling in the Koopman Framework for Linear Operator Learning in Nonlinear Dynamical Systems. https://arxiv.org/abs/2609.35389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Markov matrix perturbations to optimize dynamical and entropy functionals

An important problem in applied dynamical systems is to compute the external forcing that provokes the largest response of a desired observable quantity. For this, we investigate the perturbation theory of Markov matrices in connection with linear response theory in statistical physics. We use perturbative expansions to derive linear algorithms to optimize physically relevant quantities such as: entropy, Kullback-Liebler-divergence and entropy production of Markov matrices and their related probability vectors. These optimization algorithms are applied to Markov chain representations of discrete and continuous flows in and out of equilibrium. We consider Markov matrix representations originating from Ulam-type approximations of transfer operators and a reduced order model of a turbulent flow based on unstable periodic orbits theory. We also propose a numerical protocol to recast matrix perturbations into vector field perturbations. The results allow to physically interpret the obtained optimizing perturbations without knowledge of the underlying equations, in a data-driven way.

math.DS↗

Synchronization points: growth, asymptotics, congruences, and the synchronization zeta function

In this paper, we introduce the synchronization zeta function associated with a pair of self-maps of a topological space and investigate its properties. We also define the growth rate of synchronization points and derive an explicit formula in the setting of endomorphisms of compact, connected Abelian groups. In addition, we establish Gauss congruences and describe the asymptotic behavior for the sequence of numbers of synchronization points, under the assumption that the synchronization zeta function is rational. Further, we discuss connections with topological entropy.

math.DS↗

Polynomial Interpolation of a Vector Field on a Convex Polyhedral Domain

We develop a method for reconstructing polynomial vector fields from discrete velocity samples on a convex polyhedral domain under an exact no-penetration boundary condition. For a prescribed degree bound, the method computes a polynomial vector field that fits the sampled data in the least-squares sense while satisfying the tangency condition identically on every boundary facet. The central ingredient is an explicit algebraic characterization of the space of polynomial vector fields tangent to the boundary, obtained from the theory of logarithmic derivations of hyperplane arrangements. This characterization reduces the constrained reconstruction problem to finite-dimensional linear algebra. We also discuss extensions incorporating additional linear differential constraints, such as incompressibility, and piecewise polynomial constructions on non-convex polyhedral domains with prescribed smoothness across cell interfaces.

math.DS↗