Pages that link to "Item:Q1819919"
From MaRDI portal
The following pages link to Two and three dimensional FFTs on highly parallel computers (Q1819919):
Displaying 15 items.
- Efficient 2D FFT implementation on mediaprocessors (Q436199) (← links)
- Performance of the 3D FFT on the 6D network torus QCDOC parallel supercomputer (Q710047) (← links)
- The efficiency of application of dual-processor computers for the analysis of the three-dimensional second harmonic generation problem (Q1037112) (← links)
- An algorithm for distributed computation of FFTs (Q1097679) (← links)
- Banyan models for the parallel implementation of the fast Fourier transform algorithm (Q1107307) (← links)
- Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP (Q1115562) (← links)
- Bluestein's FFT for arbitrary \(N\) on the hypercube (Q1179208) (← links)
- 2-D FFT algorithm by matrix factorization in a 2-D space (Q1316209) (← links)
- Parallel 3-dim fast Fourier transforms with load balancing of the plane waves (Q1686966) (← links)
- Two-dimensional FFT algorithms on hypercube and mesh machines (Q1803430) (← links)
- A distributed memory algorithm for 3-D FFTs (Q1919366) (← links)
- Rotating a three-dimensional array in an optimal position for vector processing: Case study for a three-dimensional fast Fourier transform (Q1923747) (← links)
- High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers (Q1976413) (← links)
- The six-step algorithm for two-dimensional FFTs (Q2738598) (← links)
- Parallel three-dimensional nonequispaced fast Fourier transforms and their application to particle simulation (Q2855673) (← links)
