pith. sign in

arxiv: 1411.2260 · v4 · pith:B24QZRI7new · submitted 2014-11-09 · 🧮 math.DS

A Kernel-Based Approach to Data-Driven Koopman Spectral Analysis

classification 🧮 math.DS
keywords koopmanapproachcomputationaldataeigenfunctionseigenvaluesexamplefunctions
0
0 comments X
read the original abstract

A data driven, kernel-based method for approximating the leading Koopman eigenvalues, eigenfunctions, and modes in problems with high dimensional state spaces is presented. This approach approximates the Koopman operator using a set of scalar observables, which are functions defined on state space, that is determined {\em implicitly} by the choice of a kernel. This circumvents the computational issues that arise due to the number of basis functions required to span a "sufficiently rich" subspace of the space of scalar observables in these problems. We illustrate this method on the FitzHugh-Nagumo PDE, a prototypical example of a one-dimensional reaction diffusion system, and compare our results with related methods such as Dynamic Mode Decomposition (DMD) that have the same computational cost as our approach. In this example, the resulting approximations of the leading Koopman eigenvalues, eigenfunctions, and modes are both more accurate and less sensitive to the distribution of the data used in the computation than those produced by DMD.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. RKHS method for computing Koopman-based Lyapunov functions

    math.DS 2026-04 unverdicted novelty 7.0

    A kernel method computes Koopman eigenfunctions that preserve the Jacobian spectrum for Lyapunov-based stability analysis of nonlinear dynamical systems.