Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

DOI10.1137/S1064827593247023zbMath0858.65145WikidataQ54087131 ScholiaQ54087131MaRDI QIDQ4895599

James C. Schatzman

Publication date: 14 October 1996

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsfast Fourier transformaccuracydiscrete Fourier transformtwiddle factorshigh precision arithmetic

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (8)

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 ⋮ Blind image deconvolution using a banded matrix method ⋮ Numerical estimates on the Landau-Siegel zero and other related quantities ⋮ On the error propagation of semi-Lagrange and Fourier methods for advection problems ⋮ A fast algorithm to compute the Ramanujan-Deninger gamma function and some number-theoretic applications ⋮ An Adaptive Fourier Filter for Relaxing Time Stepping Constraints for Explicit Solvers

This page was built for publication: Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform