The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal Construction of Koopman Eigenfunctions for Prediction and Control
Open accessAbstract
This article presents a novel data-driven framework for constructing eigenfunctions of the Koopman operator geared toward prediction and control. The method leverages the richness of the spectrum of the Koopman operator away from attractors to construct a set of eigenfunctions such that the state (or any other observable quantity of interest) is in the span of these eigenfunctions and hence predictable in a linear fashion. The eigenfunction construction is optimization-based with no dictionary selection required. Once a predictor for the uncontrolled part of the system is obtained in this way, the incorporation of control is done through a multistep prediction error minimization, carried out by a simple linear least-squares regression. The predictor so obtained is in the form of a linear controlled dynamical system and can be readily applied within the Koopman model predictive control (MPC) framework of (M. Korda and I. Mezić, 2018) to control nonlinear dynamical systems using linear MPC tools. The method is entirely data-driven and based predominantly on convex optimization. The novel eigenfunction construction method is also analyzed theoretically, proving rigorously that the family of eigenfunctions obtained is rich enough to span the space of all continuous functions. In addition, the method is extended to construct generalized eigenfunctions that also give rise Koopman invariant subspaces and hence can be used for linear prediction. Detailed numerical examples demonstrate the approach, both for prediction and feedback control.**Code for the numerical examples is available from https://homepages.laas.fr/mkorda/Eigfuns.zip.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Cited by
Modern Koopman Theory for Dynamical Systems
Brunton, S. L., Budišić, M., Kaiser, E., & Kutz, J. N. (2022) · SIAM Review · doi:10.1137/21m1401243 · Cited by 576
Data-driven discovery of Koopman eigenfunctions for control
Kaiser, E., Kutz, J. N., & Brunton, S. L. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/abf0f5 · Cited by 318
Metadata
- Authors
- Korda, M., & Mezic, I.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2020-12
- Volume
- 65
- Issue
- 12
- Pages
- 5114-5129
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2969440291
- Cited by
- 164
- References
- 1
- FWCI
- 8.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal Construction of Koopman Eigenfunctions for Prediction and Control. https://app.cochat.ai/papers/10.1109/tac.2020.2978039
- The paper
- Korda, M., & Mezic, I. (2020). Optimal Construction of Koopman Eigenfunctions for Prediction and Control. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2020.2978039
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.