A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
From MaRDI portal
Publication:3355211
DOI10.2307/2008406zbMATH Open0729.65116OpenAlexW4232564811MaRDI QIDQ3355211FDOQ3355211
Authors: Daniela Calvetti
Publication date: 1991
Full work available at URL: https://doi.org/10.2307/2008406
Recommendations
- An accurate error analysis model for fast Fourier transform
- A Stochastic Roundoff Error Analysis for the Convolution
- Worst and average case roundoff error analysis for FFT
- Componentwise error analysis for FFTs with applications to fast Helmholtz solvers
- Floating point error analysis of two-dimensional, fast Fourier transform algorithms
algorithmscomparisonnumerical experimentsdiscrete Fourier transformfast Fourier transformstochastic roundoff error analysis
Cited In (26)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The equivalence of decimation in time and decimation in frequency in FFT computations
- A fast algorithm for the inversion of Abel's transform
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Title not available (Why is that?)
- Roundoff error analysis of the recursive moving window discrete Fourier transform
- Error estimates for multiplication based on FFT over the complex numbers
- A note on polynomial transform error analysis
- Accuracy analysis of some fast Fourier transform algorithms for estimation of correlation functions
- A Stochastic Roundoff Error Analysis for the Convolution
- Roundoff error analysis for fast trigonometric transforms
- Componentwise error analysis for FFTs with applications to fast Helmholtz solvers
- Floating point error analysis of two-dimensional, fast Fourier transform algorithms
- A Chebychev-Vandermonde solver
- Title not available (Why is that?)
- Error analysis of some operations involved in the Cooley-Tukey fast Fourier transform
- A collocation method for the numerical Fourier analysis of quasi-periodic functions. II: Analytical error estimates
- Title not available (Why is that?)
- Statistical approach for highest precision numerical differentiation
- Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}]</tex>
- A New Approach to Probabilistic Rounding Error Analysis
- Probabilistic Error Analysis for Inner Products
- Fast and precise Fourier transforms
- Worst and average case roundoff error analysis for FFT
- Title not available (Why is that?)
This page was built for publication: A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355211)