Papers
Topics
Authors
Recent
Search
2000 character limit reached

Predictive Accuracy of Dynamic Mode Decomposition

Published 5 May 2019 in math.NA | (1905.01587v1)

Abstract: Dynamic mode decomposition (DMD), which the family of singular-value decompositions (SVD), is a popular tool of data-driven regression. While multiple numerical tests demonstrated the power and efficiency of DMD in representing data (i.e., in the interpolation mode), applications of DMD as a predictive tool (i.e., in the extrapolation mode) are scarce. This is due, in part, to the lack of rigorous error estimators for DMD-based predictions. We provide a theoretical error estimator for DMD extrapolation of numerical solutions to linear and nonlinear parabolic equations. This error analysis allows one to monitor and controls the errors associated with DMD-based temporal extrapolation of numerical solutions to parabolic differential equations. We use several computational experiments to verify the robustness of our error estimators and to compare the predictive ability of DMD with that of proper orthogonal decomposition (POD), another member of the SVD family. Our analysis demonstrates the importance of a proper selection of observables, as predicted by the Koopman operator theory. In all the tests considered, DMD outperformed POD in terms of efficiency due to its iteration-free feature. In some of these experiments, POD proved to be more accurate than DMD. This suggests that DMD is preferable for obtaining a fast prediction with slightly lower accuracy, while POD should be used if the accuracy is paramount.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.