Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Identification of linear time-invariant systems with Dynamic Mode Decomposition (2109.06765v1)

Published 14 Sep 2021 in math.NA, cs.NA, cs.SY, and eess.SY

Abstract: Dynamic mode decomposition (DMD) is a popular data-driven framework to extract linear dynamics from complex high-dimensional systems. In this work, we study the system identification properties of DMD. We first show that DMD is invariant under linear transformations in the image of the data matrix. If, in addition, the data is constructed from a linear time-invariant system, then we prove that DMD can recover the original dynamics under mild conditions. If the linear dynamics are discretized with a Runge-Kutta method, then we further classify the error of the DMD approximation and detail that for one-stage Runge-Kutta methods even the continuous dynamics can be recovered with DMD. A numerical example illustrates the theoretical findings.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Jan Heiland (27 papers)
  2. Benjamin Unger (32 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.