scientific article; zbMATH DE number 1971052

DOI10.1023/A:1012991330474zbMath1030.65145OpenAlexW149408741MaRDI 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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitynumerical stabilityroundoff error analysisaverage case studyworst case studyrepeated multiplicationprecomputation methodsprecomputed twiddle factors

Mathematics Subject Classification ID

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

Related Items (3)

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

• mctoolbox

This page was built for publication: