Originally introduced in the fluid mechanics community, dynamic mode decomposition (DMD) has emerged as a powerful tool for analyzing the dynamics of nonlinear systems. However, existing DMD theory deals primarily with sequential time series for which the measurement dimension is much larger than the number of measurements taken. We present a theoretical framework in which we define DMD as the eigendecomposition of an approximating linear operator. This generalizes DMD to a larger class of datasets, including nonsequential time series. We demonstrate the utility of this approach by presenting novel sampling strategies that increase computational efficiency and mitigate the effects of noise, respectively. We also introduce the concept of linear consistency, which helps explain the potential pitfalls of applying DMD to rank-deficient datasets, illustrating with examples. Such computations are not considered in the existing literature but can be understood using our more general framework. In addition, we show that our theory strengthens the connections between DMD and Koopman operator theory. It also establishes connections between DMD and other techniques, including the eigensystem realization algorithm (ERA), a system identification method, and linear inverse modeling (LIM), a method from climate science. We show that under certain conditions, DMD is equivalent to LIM.
%0 Journal Article
%1 tu2014dynamic
%A Tu, Jonathan H.
%A Rowley, Clarence W.
%A Luchtenburg, Dirk M.
%A Brunton, Steven L.
%A Kutz, J. Nathan
%D 2014
%I American Institute of Mathematical Sciences (AIMS)
%J Journal of Computational Dynamics
%K 37m10-time-series-analysis-of-dynamical-systems 47b39-difference-operators 65p99-numerical-problems-in-dynamical-systems
%N 2
%P 391--421
%R 10.3934/jcd.2014.1.391
%T On dynamic mode decomposition: Theory and applications
%U https://www.aimsciences.org/article/doi/10.3934/jcd.2014.1.391
%V 1
%X Originally introduced in the fluid mechanics community, dynamic mode decomposition (DMD) has emerged as a powerful tool for analyzing the dynamics of nonlinear systems. However, existing DMD theory deals primarily with sequential time series for which the measurement dimension is much larger than the number of measurements taken. We present a theoretical framework in which we define DMD as the eigendecomposition of an approximating linear operator. This generalizes DMD to a larger class of datasets, including nonsequential time series. We demonstrate the utility of this approach by presenting novel sampling strategies that increase computational efficiency and mitigate the effects of noise, respectively. We also introduce the concept of linear consistency, which helps explain the potential pitfalls of applying DMD to rank-deficient datasets, illustrating with examples. Such computations are not considered in the existing literature but can be understood using our more general framework. In addition, we show that our theory strengthens the connections between DMD and Koopman operator theory. It also establishes connections between DMD and other techniques, including the eigensystem realization algorithm (ERA), a system identification method, and linear inverse modeling (LIM), a method from climate science. We show that under certain conditions, DMD is equivalent to LIM.
@article{tu2014dynamic,
abstract = { Originally introduced in the fluid mechanics community, dynamic mode decomposition (DMD) has emerged as a powerful tool for analyzing the dynamics of nonlinear systems. However, existing DMD theory deals primarily with sequential time series for which the measurement dimension is much larger than the number of measurements taken. We present a theoretical framework in which we define DMD as the eigendecomposition of an approximating linear operator. This generalizes DMD to a larger class of datasets, including nonsequential time series. We demonstrate the utility of this approach by presenting novel sampling strategies that increase computational efficiency and mitigate the effects of noise, respectively. We also introduce the concept of linear consistency, which helps explain the potential pitfalls of applying DMD to rank-deficient datasets, illustrating with examples. Such computations are not considered in the existing literature but can be understood using our more general framework. In addition, we show that our theory strengthens the connections between DMD and Koopman operator theory. It also establishes connections between DMD and other techniques, including the eigensystem realization algorithm (ERA), a system identification method, and linear inverse modeling (LIM), a method from climate science. We show that under certain conditions, DMD is equivalent to LIM.},
added-at = {2020-10-27T23:52:35.000+0100},
author = {Tu, Jonathan H. and Rowley, Clarence W. and Luchtenburg, Dirk M. and Brunton, Steven L. and Kutz, J. Nathan},
biburl = {https://www.bibsonomy.org/bibtex/2e24f7d848c4f04806e70968b94d5afaf/gdmcbain},
doi = {10.3934/jcd.2014.1.391},
interhash = {33fee44579d480e2c5327c6a60f5d390},
intrahash = {e24f7d848c4f04806e70968b94d5afaf},
journal = {Journal of Computational Dynamics},
keywords = {37m10-time-series-analysis-of-dynamical-systems 47b39-difference-operators 65p99-numerical-problems-in-dynamical-systems},
number = 2,
pages = {391--421},
publisher = {American Institute of Mathematical Sciences ({AIMS})},
timestamp = {2021-03-31T20:23:04.000+0200},
title = {On dynamic mode decomposition: Theory and applications},
url = {https://www.aimsciences.org/article/doi/10.3934/jcd.2014.1.391},
volume = 1,
year = 2014
}