REVIEW 3 cited by
A Kernel-Based Approach to Data-Driven Koopman Spectral Analysis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 3 Pith papers
-
Avoiding spectral pollution for transfer operators using residuals
A residual computation for kernelized dynamic mode decomposition gives a necessary condition for eigenvalues of transfer operators, enabling detection of spectral pollution.
-
Data-driven Reachability Verification with Probabilistic Guarantees under Koopman Spectral Uncertainty
A data-driven Koopman framework bounds time-to-reach intervals for unknown systems, but its core probabilistic guarantee is stated in terms of quantities the data does not provide.
-
Self-Supervised Evolution Operator Learning for High-Dimensional Dynamical Systems
A contrastive self-supervised loss is shown to be equivalent to learning the evolution operator's spectral decomposition, recovering slow modes in proteins, ligand binding, and ENSO climate data.
Discussion (0). Continue with ORCID to comment.