Multiprocessor FFTs

From MaRDI portal
Publication:578884

DOI10.1016/0167-8191(87)90018-4zbMath0624.65146OpenAlexW4256206162MaRDI QIDQ578884

Paul N. Swarztrauber

Publication date: 1987

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(87)90018-4



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (25)

Redistribution strategies for portable parallel FFT: a case studyCalculation scheme based on a weighted primitive: application to image processing transformsFast parallel solution of the Poisson equation on irregular domainsFive-step FFT algorithm with reduced computational complexityEFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗A distributed memory algorithm for 3-D FFTsVector and parallel methods for the direct solution of Poisson's equationFFT algorithms and their adaptation to parallel processingThe parallel Fourier pseudospectral methodA Flexible Framework for Multidimensional DFTsTHE VECTOR MULTIPROCESSORA case study in parallel computing. I: Homogeneous turbulence on a hypercubeComplex Patterns and Elementary Structures of Solutal Marangoni Convection: Experimental and Numerical StudiesCirculant preconditioners for second order hyperbolic equationsCommunication efficient multi-processor FFTUltrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputersCongruent Number Theta Coefficients to 1012FFT, FMM, or Multigrid? A comparative Study of State-Of-the-Art Poisson Solvers for Uniform and Nonuniform Grids in the Unit CubeA methodology for designing, modifying, and implementing Fourier transform algorithms on various architecturesPseudospectral methods on massively parallel computersNumerical results on relations between fundamental constants using a new algorithmA new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methodsA PARALLEL FAST FOURIER TRANSFORMParallel integration of ODEs based on convolution algorithmsFault-tolerant algorithm for Fast Fourier Transform on hypercubes




This page was built for publication: Multiprocessor FFTs