A high-performance fast Fourier transform algorithm for the Cray-2

DOI10.1007/BF00138605MaRDI QIDQ547499zbMATH OpenFDO

Authors D. H. Bailey

Publication date 2 July 2011

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00138605

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Recommendations

• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
• Implementation of a prime factor FFT algorithm on CRAY-1
• FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
• Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
• scientific article; zbMATH DE number 3997125

Cites work

• A Vector Implementation of the Fast Fourier Transform Algorithm
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• An Algorithm for the Machine Calculation of Complex Fourier Series
• FFT algorithms for vector computers
• scientific article; zbMATH DE number 3829220 (Why is no real title available?)
• scientific article; zbMATH DE number 107575 (Why is no real title available?)

Cited in

(5)

• Implementation of a prime factor FFT algorithm on CRAY-1
• Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
• Analysis of an ADA based version of Glassman's general \(N\) point fast Fourier transform
• FAST FOURIER TRANSFORM ALGORITHM DESIGN AND TRADEOFFS ON THE CM-2
• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers

This page was built for publication: A high-performance fast Fourier transform algorithm for the Cray-2

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