Worst and average case roundoff error analysis for FFT
From MaRDI portal
Publication:5952348
DOI10.1023/A:1021923430250zbMath0999.65152OpenAlexW161774598MaRDI QIDQ5952348
Hansmartin Zeuner, Manfred Tasche
Publication date: 9 January 2002
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021923430250
numerical examplesfast Fourier transformnumerical stabilityroundoff errorsfloating point arithmeticCooley-Tukey factorizationdiscrete Fourier transform matrixsubdivision scalingtwiddle factors
Related Items
Accurate pairwise convolutions of non-negative vectors via FFT ⋮ Quantum Fourier transform in computational basis ⋮ Numerical stability of biorthogonal wavelet transforms ⋮ Numerical stability of nonequispaced fast Fourier transforms
Uses Software