A distributed memory algorithm for 3-D FFTs

DOI10.1016/0377-0427(95)00163-8zbMATH Open0855.65147OpenAlexW2129320792MaRDI QIDQ1919366FDOQ1919366

Authors: Calin R. Costian, Dan C. 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

Recommendations

• FFT algorithms and their adaptation to parallel processing
• scientific article; zbMATH DE number 991433
• Two and three dimensional FFTs on highly parallel computers

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Parallel algorithm for SWFFT using 3D data structure
• Efficient calculations of 3-D FFTs on spiral contours
• Parallel Processing and Applied Mathematics

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

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