Two and three dimensional FFTs on highly parallel computers
From MaRDI portal
Recommendations
Cited in
(19)- scientific article; zbMATH DE number 833642 (Why is no real title available?)
- Parallel three-dimensional nonequispaced fast Fourier transforms and their application to particle simulation
- Efficient 2D FFT implementation on mediaprocessors
- Two-dimensional FFT algorithms on hypercube and mesh machines
- scientific article; zbMATH DE number 123335 (Why is no real title available?)
- The efficiency of application of dual-processor computers for the analysis of the three-dimensional second harmonic generation problem
- Programming the WFTA for two-dimensional data
- Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
- scientific article; zbMATH DE number 4126681 (Why is no real title available?)
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
- P3DFFT: A framework for parallel computations of Fourier transforms in three dimensions
- An algorithm for distributed computation of FFTs
- Banyan models for the parallel implementation of the fast Fourier transform algorithm
- Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer
- The six-step algorithm for two-dimensional FFTs
- Two- and three-dimensional image rotation using the FFT
- scientific article; zbMATH DE number 820533 (Why is no real title available?)
- An Implementation of Multiple and Multivariate Fourier Transforms on Vector Processors
This page was built for publication: Two and three dimensional FFTs on highly parallel computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819919)