Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

DOI10.1137/S1064827593247023MaRDI QIDQ4895599zbMATH OpenWikidataFDO

Authors James C. Schatzman

Publication date 14 October 1996

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

zbMATH Keywords

algorithmsdiscrete Fourier transformfast Fourier transformaccuracytwiddle factorshigh precision arithmetic

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3881847
• Worst and average case roundoff error analysis for FFT
• scientific article; zbMATH DE number 1971052
• On a fast and accurate method for computing Fourier transforms
• Fast and precise Fourier transforms

Cited in

(14)

• Fast computation of multinomial coefficients
• Fast morphological dilation and erosion for grey scale images using the Fourier transform
• Accuracy-optimal evaluation of the Fourier transform for \(C_{L,N,\varepsilon}\) functions
• Blind image deconvolution using a banded matrix method
• High-accuracy formula for discrete calculation of Fourier transforms
• scientific article; zbMATH DE number 3881847 (Why is no real title available?)
• Accuracy analysis of some fast Fourier transform algorithms for estimation of correlation functions
• An adaptive Fourier filter for relaxing time stepping constraints for explicit solvers
• Accurate pairwise convolutions of non-negative vectors via FFT
• On improving the accuracy of Horner's and Goertzel's algorithms
• A fast algorithm to compute the Ramanujan-Deninger gamma function and some number-theoretic applications
• On the error propagation of semi-Lagrange and Fourier methods for advection problems
• Numerical estimates on the Landau-Siegel zero and other related quantities
• The Kummer ratio of the relative class number for prime cyclotomic fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895599)