No abstract

No abstract

The characterization of intermittent, multiscale and transient dynamics using datadriven analysis remains an open challenge. We demonstrate an application of the Dynamic Mode Decomposition (DMD) with sparse sampling for the diagnostic analysis of multiscale physics. The DMD method is an ideal spatiotemporal matrix decomposition that correlates spatial features of computational or experimental data to periodic temporal behavior. DMD can be modified into a multiresolution analysis to separate complex dynamics into a hierarchy of multiresolution timescale components, where each level of the hierarchy divides dynamics into distinct background (slow) and foreground (fast) timescales. The multiresolution DMD is capable of characterizing nonlinear dynamical systems in an equation-free manner by recursively decomposing the state of the system into low-rank spatial modes and their temporal Fourier dynamics. Moreover, these multiresolution DMD modes can be used to determine sparse sampling locations which are nearly optimal for dynamic regime classification and full state reconstruction. Specifically, optimized sensors are efficiently chosen using QR column pivots of the DMD library, thus avoiding an NP-hard selection process. We demonstrate the efficacy of the method on several examples, including global sea-surface temperature data, and show that only a small number of sensors are needed for accurate global reconstructions and classification of El Niño events.

Optimal sensor and actuator selection is a central challenge in high-dimensional estimation and control. Nearly all subsequent control decisions are affected by these sensor and actuator locations. In this work, we exploit balanced model reduction and greedy optimization to efficiently determine sensor and actuator selections that optimize observability and controllability. In particular, we determine locations that optimize scalar measures of observability and controllability via greedy matrix QR pivoting on the dominant modes of the direct and adjoint balancing transformations. Pivoting runtime scales linearly with the state dimension, making this method tractable for high-dimensional systems. The results are demonstrated on the linearized Ginzburg-Landau system, for which our algorithm approximates known optimal placements computed using costly gradient descent methods.