No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
The full text of this article is not currently available.
Sparsity-promoting dynamic mode decomposition
1. J. Lumley, Stochastic Tools in Turbulence (Dover Publications, Mineola, NY, 2007).
2. L. Sirovich, “Turbulence and the dynamics of coherent structures. Part I: Coherent structures,” Q. Appl. Math. 45(3), 561–571 (1987).
3. D. Sipp, O. Marquet, P. Meliga, and A. Barbagallo, “Dynamics and control of global instabilities in open flows: A linearized approach,” Appl. Mech. Rev. 63, 030801 (2010).
4. B. Moore, “Principal component analysis in linear systems: Controllability, observability and model reduction,” IEEE Trans. Autom. Control AC-26(1), 17–32 (1981).
14. K. K. Chen, J. H. Tu, and C. W. Rowley, “Variants of dynamic mode decomposition: Boundary condition, Koopman, and Fourier analyses,” J. Nonlinear Sci. 22(6), 887–915 (2012).
15. P. J. Goulart, A. Wynn, and D. Pearson, “Optimal mode decomposition for high dimensional systems,” in Proceedings of the 51st IEEE Conference on Decision and Control, 2012 (IEEE, 2012), pp. 4965–4970.
16. A. Wynn, D. Pearson, B. Ganapathisubramani, and P. J. Goulart, “Optimal mode decomposition for unsteady flows,” J. Fluid Mech. 733, 473–503 (2013).
17. S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, New York, NY, 2004).
18. E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inf. Theory 52(2), 489–509 (2006).
20. E. J. Candès and T. Tao, “Near optimal signal recovery from random projections: Universal encoding strategies?,” IEEE Trans. Inf. Theory 52(12), 5406–5425 (2006).
22. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning (Springer, New York, NY, 2009).
24. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learning 3(1), 1–124 (2011).
25. F. Lin, M. Fardad, and M. R. Jovanović, “Design of optimal sparse feedback gains via the alternating direction method of multipliers,” IEEE Trans. Automat. Control 58(9), 2426–2431 (2013).
26. M. Grant
and S. Boyd
, “CVX: Matlab software for disciplined convex programming, version 2.0 beta
, see http://cvxr.com/cvx
27. E. Ghadimi, A. Teixeira, I. Shames, and M. Johansson, “On the optimal step-size selection for the alternating direction method of multipliers,” in Preprints of the 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems, Santa Barbara, CA, 2012 (International Federation of Automatic Control, 2012), pp. 139–144.
28. E. Ghadimi
, A. Teixeira
, I. Shames
, and M. Johansson
, “Optimal parameter selection for the alternating direction method of multipliers (ADMM): Quadratic problems
” IEEE Trans. Automat. Control
(submitted); e-print: arXiv:1306.2454
29. P. J. Schmid and D. S. Henningson, Stability and Transition in Shear Flows (Springer-Verlag, New York, NY, 2001).
33. J. W. Nichols, F. E. Ham, and S. K. Lele, “High-fidelity large-eddy simulation for supersonic rectangular jet noise prediction,” AIAA Paper 2011–2919, 2011.
34. P. G. Constantine and D. F. Gleich, “Tall and skinny QR factorizations in MapReduce architectures,” in Proceedings of the 2nd International Workshop on MapReduce and its Applications, 2011 (ACM, New York, NY, 2011), pp. 43–50.
35. S. Kakac and H. Liu, Heat Exchangers: Selection, Rating and Thermal Design (CRC Press, Boca Raton, FL, 1997).
39. C. Moulinec, M. Pourquié, B. Boersma, T. Buchal, and F. Nieuwstadt, “Direct numerical simulation on a Cartesian mesh of the flow through a tube bundle,” Int. J. Comput. Fluid Dyn. 18, 1–14 (2004).
41. Y. Hassan and H. Barsamian, “Turbulence simulation in tube bundle geometries using the dynamic subgrid-scale model,” Nucl. Tech. J. 128, 58–74 (1999).
See supplementary material at http://dx.doi.org/10.1063/1.4863670
for a brief description of MATLAB
implementation of the Sparsity-Promoting Dynamic Mode Decomposition (DMDSP) algorithm and for additional information about the examples considered in this paper, including Matlab source codes and problem data. [Supplementary Material]
Article metrics loading...
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 direction method of multipliers, an algorithm well-suited for large problems. Several examples of flow fields resulting from numerical simulations and physical experiments are used to illustrate the effectiveness of the developed method.
Full text loading...
Most read this month