Roundoff Error Analysis of the Fast Fourier Transform

DOI10.2307/2004342zbMath0227.65068OpenAlexW4231507308MaRDI QIDQ5634823

George U. Ramos

Publication date: 1971

Full work available at URL: https://doi.org/10.2307/2004342

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (10)

Rapid multiplication modulo the sum and difference of highly composite numbers ⋮ The equivalence of decimation in time and decimation in frequency in FFT computations ⋮ Accuracy analysis of some fast Fourier transform algorithms for estimation of correlation functions ⋮ Componentwise error analysis for FFTs with applications to fast Helmholtz solvers ⋮ A real-time parallel application: The detection of gravitational waves by a network of heterogeneous workstations ⋮ Quantum Fourier transform in computational basis ⋮ Unnamed Item ⋮ Discrete Weighted Transforms and Large-Integer Arithmetic ⋮ A Stochastic Roundoff Error Analysis for the Convolution ⋮ Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation

Cites Work

• Unnamed Item
• Unnamed Item
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On computing the fast Fourier transform
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• Matrix Multiplication and Fast Fourier Transforms
• Accumulation of Round-Off Error in Fast Fourier Transforms

This page was built for publication: Roundoff Error Analysis of the Fast Fourier Transform