scispace - formally typeset
Open AccessJournal ArticleDOI

On Dynamic Mode Decomposition: Theory and Applications

Reads0
Chats0
TLDR
A theoretical framework in which dynamic mode decomposition is defined as the eigendecomposition of an approximating linear operator, which generalizes DMD to a larger class of datasets, including nonsequential time series, and shows that under certain conditions, DMD is equivalent to LIM.
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.

read more

Citations
More filters
Journal ArticleDOI

Modal Analysis of Fluid Flows: An Overview

TL;DR: The intent of this document is to provide an introduction to modal analysis that is accessible to the larger fluid dynamics community and presents a brief overview of several of the well-established techniques.
Journal ArticleDOI

A Data-Driven Approximation of the Koopman Operator: Extending Dynamic Mode Decomposition

TL;DR: This approach is an extension of dynamic mode decomposition (DMD), which has been used to approximate the Koopman eigenvalues and modes, and if the data provided to the method are generated by a Markov process instead of a deterministic dynamical system, the algorithm approximates the eigenfunctions of the Kolmogorov backward equation.
Journal ArticleDOI

Spectral proper orthogonal decomposition and its relationship to dynamic mode decomposition and resolvent analysis

TL;DR: In this article, the spectral proper orthogonal decomposition (SPOD) has been studied in the context of the analysis of the Ginzburg-Landau equation and a turbulent jet.
Journal ArticleDOI

Deep learning for universal linear embeddings of nonlinear dynamics.

TL;DR: It is often advantageous to transform a strongly nonlinear system into a linear one in order to simplify its analysis for prediction and control, so the authors combine dynamical systems with deep learning to identify these hard-to-find transformations.
Journal ArticleDOI

Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization

TL;DR: In many situations across computational science and engineering, multiple computational models are available that describe a system of interest as discussed by the authors, and these different models have varying evaluation costs, i.e.
References
More filters
Journal ArticleDOI

Numerical recipes

Journal ArticleDOI

LIII. On lines and planes of closest fit to systems of points in space

TL;DR: This paper is concerned with the construction of planes of closest fit to systems of points in space and the relationships between these planes and the planes themselves.
Journal ArticleDOI

An Introduction To Compressive Sampling

TL;DR: The theory of compressive sampling, also known as compressed sensing or CS, is surveyed, a novel sensing/sampling paradigm that goes against the common wisdom in data acquisition.
Journal ArticleDOI

Robust Face Recognition via Sparse Representation

TL;DR: This work considers the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise, and proposes a general classification algorithm for (image-based) object recognition based on a sparse representation computed by C1-minimization.
Related Papers (5)