Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
From MaRDI portal
Publication:4895599
DOI10.1137/S1064827593247023zbMath0858.65145WikidataQ54087131 ScholiaQ54087131MaRDI QIDQ4895599
Publication date: 14 October 1996
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithms; fast Fourier transform; accuracy; discrete Fourier transform; twiddle factors; high precision arithmetic
65T50: Numerical methods for discrete and fast Fourier transforms
65Y20: Complexity and performance of numerical algorithms
Related Items
A fast algorithm to compute the Ramanujan-Deninger gamma function and some number-theoretic applications, Numerical estimates on the Landau-Siegel zero and other related quantities, Blind image deconvolution using a banded matrix method, On the error propagation of semi-Lagrange and Fourier methods for advection problems, Fast computation of multinomial coefficients, Fast morphological dilation and erosion for grey scale images using the Fourier transform, Accurate pairwise convolutions of non-negative vectors via FFT, An Adaptive Fourier Filter for Relaxing Time Stepping Constraints for Explicit Solvers