A Vector Implementation of the Fast Fourier Transform Algorithm

DOI10.2307/2007735MaRDI QIDQ3904013zbMATH OpenOpenAlexFDO

Authors Bengt Fornberg

Publication date 1981

Full work available at URL https://doi.org/10.2307/2007735

zbMATH Keywords

vector implementationfast Fourier transform algorithm

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Trigonometric interpolation (42A15) Theory of operating systems (68N25)

Cites work

• A Generalization of the Fast Fourier Transform
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Computing the Fast Fourier Transform on a Vector Computer
• On computing the Discrete Fourier Transform

Cited in

(2)

• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
• A high-performance fast Fourier transform algorithm for the Cray-2

This page was built for publication: A Vector Implementation of the Fast Fourier Transform Algorithm

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