Publication:4423150
From MaRDI portal
DOI10.1023/A:1012991330474zbMath1030.65145MaRDI QIDQ4423150
Manfred Tasche, Hansmartin Zeuner
Publication date: 25 August 2003
Published in: Journal of Computational Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012991330474
complexity; numerical stability; roundoff error analysis; average case study; worst case study; repeated multiplication; precomputation methods; precomputed twiddle factors
65G50: Roundoff error
65T50: Numerical methods for discrete and fast Fourier transforms
65Y20: Complexity and performance of numerical algorithms
Related Items
Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test, Numerical stability of nonequispaced fast Fourier transforms, Fast Phylogenetic Biodiversity Computations Under a Non-uniform Random Distribution
Uses Software