A distributed memory algorithm for 3-D FFTs

DOI10.1016/0377-0427(95)00163-8zbMath0855.65147OpenAlexW2129320792MaRDI QIDQ1919366

Calin R. Costian, Dan Cristian Marinescu

Publication date: 11 February 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00163-8

zbMATH Keywords

fast Fourier transformcomplexity analysisdivide-and-conquer methoddistributed memory architecturesparallel in-place algorithms

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Multiprocessor FFTs
• Cooley-Tukey FFT on the Connection Machine
• Communication efficient multi-processor FFT

This page was built for publication: A distributed memory algorithm for 3-D FFTs