FFT as Nested Multiplication, with a Twist

DOI10.1137/0901009zbMath0459.65098OpenAlexW2047453706MaRDI QIDQ3909984

Carl De Boor

Publication date: 1980

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0901009

zbMATH Keywords

fast Fourier transformFortran programnested multiplication

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items

On arithmetical algorithms over finite fields ⋮ A simple derivation of Glassman's general N fast Fourier transform ⋮ Nesting strategies for prime factor FFT algorithms ⋮ Self-sorting mixed-radix fast Fourier transforms ⋮ Algorithm for the computation of Bessel function integrals