اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExtended dynamic mode decomposition with dictionary learning: a data-driven adaptive spectral decomposition of the Koopman operator
84
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Numerical approximation methods for the Koopman operator have advanced considerably in the last few years. In particular, data-driven approaches such as dynamic mode decomposition (DMD) and its generalization, the extended-DMD (EDMD), are becoming increasingly popular in practical applications. The EDMD improves upon the classical DMD by the inclusion of a flexible choice of dictionary of observables that spans a finite dimensional subspace on which the Koopman operator can be approximated. This enhances the accuracy of the solution reconstruction and broadens the applicability of the Koopman formalism. Although the convergence of the EDMD has been established, applying the method in practice requires a careful choice of the observables to improve convergence with just a finite number of terms. This is especially difficult for high dimensional and highly nonlinear systems. In this paper, we employ ideas from machine learning to improve upon the EDMD method. We develop an iterative approximation algorithm which couples the EDMD with a trainable dictionary represented by an artificial neural network. Using the Duffing oscillator and the Kuramoto Sivashinsky PDE as examples, we show that our algorithm can effectively and efficiently adapt the trainable dictionary to the problem at hand to achieve good reconstruction accuracy without the need to choose a fixed dictionary a priori. Furthermore, to obtain a given accuracy we require fewer dictionary terms than EDMD with fixed dictionaries. This alleviates an important shortcoming of the EDMD algorithm and enhances the applicability of the Koopman framework to practical problems.
قيم البحث
اقرأ أيضاً
Starting from measured data, we develop a method to compute the fine structure of the spectrum of the Koopman operator with rigorous convergence guarantees. The method is based on the observation that, in the measure-preserving ergodic setting, the m
oments of the spectral measure associated to a given observable are computable from a single trajectory of this observable. Having finitely many moments available, we use the classical Christoffel-Darboux kernel to separate the atomic and absolutely continuous parts of the spectrum, supported by convergence guarantees as the number of moments tends to infinity. In addition, we propose a technique to detect the singular continuous part of the spectrum as well as two methods to approximate the spectral measure with guaranteed convergence in the weak topology, irrespective of whether the singular continuous part is present or not. The proposed method is simple to implement and readily applicable to large-scale systems since the computational complexity is dominated by inverting an $Ntimes N$ Hermitian positive-definite Toeplitz matrix, where $N$ is the number of moments, for which efficient and numerically stable algorithms exist; in particular, the complexity of the approach is independent of the dimension of the underlying state-space. We also show how to compute, from measured data, the spectral projection on a given segment of the unit circle, allowing us to obtain a finite-dimensional approximation of the operator that explicitly takes into account the point and continuous parts of the spectrum. Finally, we describe a relationship between the proposed method and the so-called Hankel Dynamic Mode Decomposition, providing new insights into the behavior of the eigenvalues of the Hankel DMD operator. A number of numerical examples illustrate the approach, including a study of the spectrum of the lid-driven two-dimensional cavity flow.
A data-driven and equation-free approach is proposed and discussed to model ships maneuvers in waves, based on the dynamic mode decomposition (DMD). DMD is a dimensionality-reduction/reduced-order modeling method, which provides a linear finite-dimen
sional representation of a possibly nonlinear system dynamics by means of a set of modes with associated oscillation frequencies and decay/growth rates. DMD also allows for short-term future estimates of the systems state, which can be used for real-time prediction and control. Here, the objective of the DMD is the analysis and forecast of the trajectories/motions/forces of ships operating in waves, offering a complementary efficient method to equation-based system identification approaches. Results are presented for the course keeping of a free-running naval destroyer (5415M) in irregular stern-quartering waves and for the free-running KRISO Container Ship (KCS) performing a turning circle in regular waves. Results are overall promising and show how DMD is able to identify the most important modes and forecast the systems state with reasonable accuracy up to two wave encounter periods.
Dynamic Mode Decomposition (DMD) is a powerful tool for extracting spatial and temporal patterns from multi-dimensional time series, and it has been used successfully in a wide range of fields, including fluid mechanics, robotics, and neuroscience. T
wo of the main challenges remaining in DMD research are noise sensitivity and issues related to Krylov space closure when modeling nonlinear systems. Here, we investigate the combination of noise and nonlinearity in a controlled setting, by studying a class of systems with linear latent dynamics which are observed via multinomial observables. Our numerical models include system and measurement noise. We explore the influences of dataset metrics, the spectrum of the latent dynamics, the normality of the system matrix, and the geometry of the dynamics. Our results show that even for these very mildly nonlinear conditions, DMD methods often fail to recover the spectrum and can have poor predictive ability. Our work is motivated by our experience modeling multilegged robot data, where we have encountered great difficulty in reconstructing time series for oscillatory systems with slow transients, which decay only slightly faster than a period.
The Dynamic-Mode Decomposition (DMD) is a well established data-driven method of finding temporally evolving linear-mode decompositions of nonlinear time series. Traditionally, this method presumes that all relevant dimensions are sampled through mea
surement. To address dynamical systems in which the data may be incomplete or represent only partial observation of a more complex system, we extend the DMD algorithm by including a Mori-Zwanzig Decomposition to derive memory kernels that capture the averaged dynamics of the unresolved variables as projected onto the resolved dimensions. From this, we then derive what we call the Memory-Dependent Dynamic Mode Decomposition (MDDMD). Through numerical examples, the MDDMD method is shown to produce reasonable approximations of the ensemble-averaged dynamics of the full system given a single time series measurement of the resolved variables.
Extended dynamic mode decomposition (EDMD) provides a class of algorithms to identify patterns and effective degrees of freedom in complex dynamical systems. We show that the modes identified by EDMD correspond to those of compact Perron-Frobenius an
d Koopman operators defined on suitable Hardy-Hilbert spaces when the method is applied to classes of analytic maps. Our findings elucidate the interpretation of the spectra obtained by EDMD for complex dynamical systems. We illustrate our results by numerical simulations for analytic maps.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
