State-Of-The-Art Algorithms For Low-Rank Dynamic Mode Decomposition
arXiv:2108.09160
Abstract
This technical note reviews sate-of-the-art algorithms for linear approximation of high-dimensional dynamical systems using low-rank dynamic mode decomposition (DMD). While repeating several parts of our article "low-rank dynamic mode decomposition: an exact and tractable solution", this work provides additional details useful for building a comprehensive picture of state-of-the-art methods.
arXiv commentarXiv admin note: substantial text overlap with arXiv:1610.02962
References in corpus (5)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Extended dynamic mode decomposition with dictionary learning: a data-driven adaptive spectral decomposition of the Koopman operator
- A Kernel-Based Approach to Data-Driven Koopman Spectral Analysis
- Guaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint
- Low-rank Approximation of Linear Maps