A fast algorithm for multiresolution mode decomposition

From MaRDI portal




Abstract: emph{Multiresolution mode decomposition} (MMD) is an adaptive tool to analyze a time series f(t)=sumk=1Kfk(t), where fk(t) is a emph{multiresolution intrinsic mode function} (MIMF) of the form �egin{eqnarray*} f_k(t)&=&sum_{n=-N/2}^{N/2-1} a_{n,k}cos(2pi nphi_k(t))s_{cn,k}(2pi N_kphi_k(t))\&&+sum_{n=-N/2}^{N/2-1}b_{n,k} sin(2pi nphi_k(t))s_{sn,k}(2pi N_kphi_k(t)) end{eqnarray*} with time-dependent amplitudes, frequencies, and waveforms. The multiresolution expansion coefficients an,k, bn,k, and the shape function series scn,k(t) and ssn,k(t) provide innovative features for adaptive time series analysis. The MMD aims at identifying these MIMF's (including their multiresolution expansion coefficients and shape functions series) from their superposition. This paper proposes a fast algorithm for solving the MMD problem based on recursive diffeomorphism-based spectral analysis (RDSA). RDSA admits highly efficient numerical implementation via the nonuniform fast Fourier transform (NUFFT); its convergence and accuracy can be guaranteed theoretically. Numerical examples from synthetic data and natural phenomena are given to demonstrate the efficiency of the proposed method.





Describes a project that uses

Uses Software






This page was built for publication: A fast algorithm for multiresolution mode decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5112043)