Randomized Dynamic Mode Decomposition - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Applied Dynamical Systems Année : 2019

Randomized Dynamic Mode Decomposition

Résumé

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 quickly decaying singular value spectrum.

Dates et versions

hal-02404577 , version 1 (11-12-2019)

Identifiants

Citer

N. Benjamin Erichson, Lionel Mathelin, J. Nathan Kutz, Steven L. Brunton. Randomized Dynamic Mode Decomposition. SIAM Journal on Applied Dynamical Systems, 2019, 18 (4), pp.1867-1891. ⟨10.1137/18M1215013⟩. ⟨hal-02404577⟩
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More