Sparsity-promoting dynamic mode decomposition
University of Minnesota · École Polytechnique · +1 more institution
Abstract
Dynamic mode decomposition (DMD) represents an effective means for capturing the essential features of numerically or experimentally generated flow fields. In order to achieve a desirable tradeoff between the quality of approximation and the number of modes that are used to approximate the given fields, we develop a sparsity-promoting variant of the standard DMD algorithm. Sparsity is induced by regularizing the least-squares deviation between the matrix of snapshots and the linear combination of DMD modes with an additional term that penalizes the ℓ1-norm of the vector of DMD amplitudes. The globally optimal solution of the resulting regularized convex optimization problem is computed using the alternating…
Citation impact
- FWCI
- 31.25
- Percentile
- 100%
- References
- 44
Authors
3Topics & keywords
- Dynamic mode decomposition
- Physics
- Norm (philosophy)
- Applied mathematics
- Algorithm
- Flow (mathematics)
- Amplitude
- Convex optimization