A distributed memory algorithm for 3-D FFTs (Q1919366)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A distributed memory algorithm for 3-D FFTs |
scientific article; zbMATH DE number 908317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A distributed memory algorithm for 3-D FFTs |
scientific article; zbMATH DE number 908317 |
Statements
A distributed memory algorithm for 3-D FFTs (English)
0 references
11 February 1997
0 references
This paper proposes an algorithm for the parallel in-place 3-D fast Fourier transform (FFT) on distributed memory architectures. In this algorithm, calculation is done by partitioning the 3-D input tensor into subtensors (one subtensor per nodes). The local FFTs are computed by the divide-and-conquer method, and the results are combined along the data partitioning strategy for minimum communication between nodes. The complexity of this algorithm is discussed in detail.
0 references
parallel in-place algorithms
0 references
complexity analysis
0 references
fast Fourier transform
0 references
distributed memory architectures
0 references
divide-and-conquer method
0 references
0.8282801508903503
0 references
0.8163073658943176
0 references
