The multiplicative complexity of the discrete Fourier transform
From MaRDI portal
Publication:1060552
DOI10.1016/0196-8858(84)90005-8zbMath0568.65096MaRDI QIDQ1060552
Ephraim Feig, Louis Auslander, Shmuel Winograd
Publication date: 1984
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(84)90005-8
68Q25: Analysis of algorithms and problem complexity
42A15: Trigonometric interpolation
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
Modified FFTs for Fused Multiply-Add Architectures, Abelian semi-simple algebras and algorithms for the discrete Fourier transform, On algebras related to the discrete cosine transform, The multiplicative complexity of discrete cosine transforms
Cites Work