Randomized Dynamic Mode Decomposition
From MaRDI portal
Publication:5207530
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.
Recommendations
- Dynamic mode decomposition and its variants
- Scalable extended dynamic mode decomposition using random kernel approximation
- Robust and scalable methods for the dynamic mode decomposition
- Efficiency of randomised dynamic mode decomposition for reduced order modelling
- Multiresolution dynamic mode decomposition
- Consistent Dynamic Mode Decomposition
- Dynamic mode decomposition of numerical and experimental data
- On dynamic mode decomposition: theory and applications
- Singular Dynamic Mode Decomposition
- Dynamic mode decomposition with control
Cites work
- A fast immersed boundary method using a nullspace approach and multi-domain far-field boundary conditions
- A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- A randomized algorithm for principal component analysis
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- A statistical perspective on algorithmic leveraging
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Applications of the dynamic mode decomposition
- ARPACK Users' Guide
- Compressed sensing and dynamic mode decomposition
- Compressive-Projection Principal Component Analysis
- Data-Driven Sparse Sensor Placement for Reconstruction: Demonstrating the Benefits of Exploiting Known Patterns
- Deblurring Images
- Dynamic mode decomposition of numerical and experimental data
- Dynamic mode decomposition with control
- Efficiency of randomised dynamic mode decomposition for reduced order modelling
- Ergodic theory, dynamic mode decomposition, and computation of spectral properties of the Koopman operator
- Extensions of Lipschitz mappings into a Hilbert space
- Fast approximation of matrix coherence and statistical leverage
- Fast monte-carlo algorithms for finding low-rank approximations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 6678650 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- Improved analysis of the subsampled randomized Hadamard transform
- Lattice Boltzmann simulations of thermal convective flows in two dimensions
- Multiresolution dynamic mode decomposition
- On dynamic mode decomposition: theory and applications
- Randomized Algorithms for Matrices and Data
- Recursive dynamic mode decomposition of transient and post-transient wake flows
- Sketching as a tool for numerical linear algebra
- Sparse sensing and DMD-based identification of flow regimes and bifurcations in complex flows
- Spectral analysis of nonlinear flows
- Subspace Iteration Randomization and Singular Value Problems
- The immersed boundary method: a projection approach
- The Modified Truncated SVD Method for Regularization in General Form
- The Optimal Hard Threshold for Singular Values is <inline-formula> <tex-math notation="TeX">\(4/\sqrt {3}\) </tex-math></inline-formula>
- The truncated SVD as a method for regularization
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- Turbulence, coherent structures, dynamical systems and symmetry.
Cited in
(39)- Randomized model order reduction
- Reduced basis decomposition: a certified and fast lossy data compression algorithm
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Low-rank dynamic mode decomposition: an exact and tractable solution
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching
- Projection-tree reduced-order modeling for fast \(N\)-body computations
- A dynamic mode decomposition technique for the analysis of non-uniformly sampled flow data
- Time series, hidden variables and spatio-temporal ordinality networks
- A parallel and streaming dynamic mode decomposition algorithm with finite precision error analysis for large data
- LaSDI: parametric latent space dynamics identification
- Higher-order dynamic mode decomposition on-the-fly: a low-order algorithm for complex fluid flows
- Tensor-based dynamic mode decomposition
- Data-driven resolvent analysis
- Robust and scalable methods for the dynamic mode decomposition
- Application of deterministic and randomized dynamic mode decomposition in epidemiology and fluid dynamics
- Modern Koopman theory for dynamical systems
- On least squares problems with certain Vandermonde-Khatri-Rao structure with applications to DMD
- Shallow neural networks for fluid flow reconstruction with limited sensors
- Kernel methods for detecting coherent structures in dynamical data
- Consistent Dynamic Mode Decomposition
- Multi-scale proper orthogonal decomposition of complex fluid flows
- Modes of homogeneous gradient flows
- Data-driven probability density forecast for stochastic dynamical systems
- Singular Dynamic Mode Decomposition
- Data‐driven identification of the spatiotemporal structure of turbulent flows by streaming dynamic mode decomposition
- Koopman operator learning using invertible neural networks
- Piecewise DMD for oscillatory and Turing spatio-temporal dynamics
- A surrogate non-intrusive reduced order model of quasi-geostrophic turbulence dynamics based on a combination of LSTM and different approaches of DMD
- SRMD: sparse random mode decomposition
- The sparse-grid-based adaptive spectral Koopman method
- Online randomized interpolative decomposition with \textit{a posteriori} error estimator for temporal PDE data reduction
- Adaptive quadrotor control using online dynamic mode decomposition
- A hybrid dynamic mode decomposition algorithm combining random and sparsity promoting and its application to viscoelastic flow around circular cylinder
- Patterns in soil organic carbon dynamics: integrating microbial activity, chemotaxis and data-driven approaches
- A scaled derivative-based DMDc method for modelling multiple-input multiple-output mechanical systems
- Data-driven optimal prediction with control
- A data driven Koopman-Schur decomposition for computational analysis of nonlinear dynamics
- Randomized structured total-least-squares-based higher-order extended dynamic mode decomposition
- New robust principal component analysis for joint image alignment and recovery via affine transformations, Frobenius and \(L_{2,1}\) norms
This page was built for publication: Randomized Dynamic Mode Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207530)
