arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.01359math.NAcs.NA
收藏

基于FFT的迭代滤波数值分析及高效实现方法

Numerical Analysis for Iterative Filtering with New Efficient Implementations Based on FFT

Antonio Cicone, Haomin Zhou

AI总结:

本文研究了迭代滤波方法在连续和离散设置下的收敛性分析,基于此提出基于FFT的高效实现方法,将原始迭代算法转化为直接方法,以提高计算效率和可靠性。

摘要:

现实中的信号通常是非平稳和非线性的。开发能够快速可靠地提取其隐藏特征的方法在许多研究领域中具有重要性。本文研究了迭代滤波方法在连续和离散设置下的收敛性分析,以提供对其行为的全面分析。基于这些结果,我们提出基于快速傅里叶变换(FFT)的新思想,用于迭代滤波算法的高效实现,并将原始迭代算法转化为直接方法。

英文摘要:

Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem of further analyzing the convergence of the Iterative Filtering method both in a continuous and a discrete setting in order to provide a comprehensive analysis of its behavior. Based on these results we provide new ideas for efficient implementations of Iterative Filtering algorithm which are based on Fast Fourier Transform (FFT), and the reduction of the original iterative algorithm to a direct method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑