Cooley-Tukey FFT on the Connection Machine

DOI10.1016/0167-8191(92)90066-GzbMath0762.65105OpenAlexW2078492923MaRDI QIDQ1195705

S. Lennart Johnsson, Robert L. Krawitz

Publication date: 19 January 1993

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(92)90066-g

zbMATH Keywords

implementation featuresconnection machineCooley-Tukey fast Fourier transformperformance data

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (3)

A distributed memory algorithm for 3-D FFTs ⋮ FFT algorithms and their adaptation to parallel processing ⋮ Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique

This page was built for publication: Cooley-Tukey FFT on the Connection Machine