
This paper gives an error bound in computing the Fourier transform for a square summable function by means of the discrete Fourier transform. In detail description, the error bound depends on the number of samples, the interval where the samples are taken, the interval where the Fourier transform is being approximated, the local averaging in the time, and the frequency domain.
discrete Fourier transform, Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type, error bound, Fourier transform, Numerical methods for trigonometric approximation and interpolation, Numerical methods for integral transforms, Nyquist-Shannon hyperbola
discrete Fourier transform, Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type, error bound, Fourier transform, Numerical methods for trigonometric approximation and interpolation, Numerical methods for integral transforms, Nyquist-Shannon hyperbola
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 17 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
