Pages that link to "Item:Q1350022"
From MaRDI portal
The following pages link to Implementation of parallel FFT algorithms on distributed memory machines with a minimum overhead of communication (Q1350022):
Displaying 7 items.
- Communication efficient multi-processor FFT (Q1201720) (← links)
- Two-dimensional FFT algorithms on hypercube and mesh machines (Q1803430) (← links)
- A distributed memory algorithm for 3-D FFTs (Q1919366) (← links)
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers (Q1976413) (← links)
- Congruent Number Theta Coefficients to 1012 (Q4931649) (← links)
- A comparison of optimal FFTs on torus and hypercube multicomputers (Q5940995) (← links)
- Minimizing Communication in the Multidimensional FFT (Q6141725) (← links)