A simple derivation of Glassman's general N fast Fourier transform

DOI10.1016/0898-1221(82)90016-5zbMath0503.65087OpenAlexW2163731974MaRDI QIDQ1173394

Warren E. jun. Ferguson

Publication date: 1982

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(82)90016-5

zbMATH Keywords

fast Fourier transformdiscrete Fourier transformFortran

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical methods for trigonometric approximation and interpolation (65T40) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items (1)

Analysis of an ADA based version of Glassman's general \(N\) point fast Fourier transform

Cites Work

• FFT as Nested Multiplication, with a Twist
• On Computing the Discrete Fourier Transform
• An Algorithm for the Machine Calculation of Complex Fourier Series
• A Generalization of the Fast Fourier Transform

This page was built for publication: A simple derivation of Glassman's general N fast Fourier transform