Dynamic-mode decomposition and optimal prediction
Christopher W. Curtis, Daniel Jay Alford-Lago
Abstract
Dynamic-mode decomposition (DMD) is a well-established data-driven method of finding temporally evolving linear-mode decompositions of a nonlinear time series. Traditionally, this method presumes that all relevant dimensions are sampled through measurement. 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.