Pith. sign in

REVIEW 1 cited by

Data-driven approximation of the Koopman generator: Model reduction, system identification, and control

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

arxiv 1909.10638 v2 pith:646CTRFH submitted 2019-09-23 math.DS stat.ML

classification math.DSstat.ML
keywords generatoridentificationsystemsapproximationcontroldata-drivenderivedeterministic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We derive a data-driven method for the approximation of the Koopman generator called gEDMD, which can be regarded as a straightforward extension of EDMD (extended dynamic mode decomposition). This approach is applicable to deterministic and stochastic dynamical systems. It can be used for computing eigenvalues, eigenfunctions, and modes of the generator and for system identification. In addition to learning the governing equations of deterministic systems, which then reduces to SINDy (sparse identification of nonlinear dynamics), it is possible to identify the drift and diffusion terms of stochastic differential equations from data. Moreover, we apply gEDMD to derive coarse-grained models of high-dimensional systems, and also to determine efficient model predictive control strategies. We highlight relationships with other methods and demonstrate the efficacy of the proposed methods using several guiding examples and prototypical molecular dynamics problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Learning Koopman Eigenfunctions and Invariant Subspaces from Data: Symmetric Subspace Decomposition

    eess.SY 2019-09 conditional novelty 7.0 of 10

    The paper proves a forward-backward EDMD condition that identifies Koopman eigenfunctions, and presents SSD and SSSD algorithms that provably find the maximal Koopman-invariant subspace in a dictionary's span.

Pith tools