Roundoff Error Analysis of the Fast Fourier Transform

DOI10.2307/2004342zbMATH Open0227.65068OpenAlexW4231507308MaRDI QIDQ5634823FDOQ5634823

Authors: 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)

Cites Work

• Title not available (Why is that?)
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Title not available (Why is that?)
• Accumulation of Round-Off Error in Fast Fourier Transforms
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• On computing the fast Fourier transform
• Matrix Multiplication and Fast Fourier Transforms

Cited In (10)

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

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

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