A Vector Implementation of the Fast Fourier Transform Algorithm

DOI10.2307/2007735zbMath0455.65090OpenAlexW4253680765MaRDI QIDQ3904013

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

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

Related Items (2)

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

Cites Work

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

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