scientific article; zbMATH DE number 1971052

DOI10.1023/A:1012991330474MaRDI QIDQ4423150zbMATH OpenOpenAlexFDO

Authors Manfred Tasche, Hm. 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

zbMATH Keywords

average case studycomplexitynumerical stabilityprecomputation methodsprecomputed twiddle factorsrepeated multiplicationroundoff error analysisworst case study

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Worst and average case roundoff error analysis for FFT
• Roundoff error analysis for fast trigonometric transforms
• Roundoff error analysis of the recursive moving window discrete Fourier transform
• A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
• scientific article; zbMATH DE number 1421270

Cited in

(6)

• Fast phylogenetic biodiversity computations under a non-uniform random distribution
• Fixed-point round-off error analysis for the discrete cosine transform
• Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
• Worst and average case roundoff error analysis for FFT
• Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test
• Numerical stability of nonequispaced fast Fourier transforms

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication:

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