Roundoff Error Analysis of the Fast Fourier Transform
From MaRDI portal
Publication:5634823
Cites work
- scientific article; zbMATH DE number 3140885 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- Accumulation of Round-Off Error in Fast Fourier Transforms
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Matrix Multiplication and Fast Fourier Transforms
- On computing the fast Fourier transform
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
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- Rapid multiplication modulo the sum and difference of highly composite numbers
- 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
- scientific article; zbMATH DE number 3744412 (Why is no real title available?)
- 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)
