Abstract
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform are proposed to recover difficulty of the computation due to the slow decay and the oscillation of the integrand. In particular, Ooura proposed formulas with continuous Euler transformation and showed their effectiveness. It is, however, also reported that errors of them become large outside some ranges of the frequency. Then, for an illustrating representative of the formulas, we choose parameters in the formula based on its error analysis to compute the Fourier transform with given accuracy in given ranges of the frequency. Furthermore, combining the formula and fractional FFT, a generalization of the fast Fourier transform (FFT), we execute the computation in the same order of computation time as the FFT.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.