Randomized Dynamic Mode Decomposition
arXiv:1702.02912 · doi:10.1137/18M1215013
Abstract
This paper presents a randomized algorithm for computing the near-optimal low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging techniques to compute low-rank matrix approximations at a fraction of the cost of deterministic algorithms, easing the computational challenges arising in the area of `big data'. The idea is to derive a small matrix from the high-dimensional data, which is then used to efficiently compute the dynamic modes and eigenvalues. The algorithm is presented in a modular probabilistic framework, and the approximation quality can be controlled via oversampling and power iterations. The effectiveness of the resulting randomized DMD algorithm is demonstrated on several benchmark examples of increasing complexity, providing an accurate and efficient approach to extract spatiotemporal coherent structures from big data in a framework that scales with the intrinsic rank of the data, rather than the ambient measurement dimension. For this work we assume that the dynamics of the problem under consideration is evolving on a low-dimensional subspace that is well characterized by a fast decaying singular value spectrum.
References in corpus (2)
Cited by in corpus (19)
- Shallow Neural Networks for Fluid Flow Reconstruction with Limited Sensors
- Data-driven resolvent analysis
- LaSDI: Parametric Latent Space Dynamics Identification
- Randomized resolvent analysis
- A Parametric and Feasibility Study for Data Sampling of the Dynamic Mode Decomposition--Range, Resolution, and Universal Convergence States
- A quasi-physical dynamic reduced order model for thermospheric mass density via Hermitian Space Dynamic Mode Decomposition
- A Parametric and Feasibility Study for Data Sampling of the Dynamic Mode Decomposition: Spectral Insights and Further Explorations
- Scalable Extended Dynamic Mode Decomposition using Random Kernel Approximation
- Online dynamic mode decomposition for time-varying systems
- Learning stable reduced-order models for hybrid twins
- Kernel methods for detecting coherent structures in dynamical data
- Modal Analysis of Fluid Flows: Applications and Outlook
- Deeptime: a Python library for machine learning dynamical models from time series data
- Projection-tree reduced order modeling for fast N-body computations
- Randomized linear algebra for model reduction. Part II: minimal residual methods and dictionary-based approximation
- Data-driven identification of the spatio-temporal structure of turbulent flows by streaming Dynamic Mode Decomposition
- Dynamic mode decomposition for compressive system identification
- Error Estimation for Sketched SVD via the Bootstrap
- Diffusion Maps meet Nyström