Multiprocessor FFTs
From MaRDI portal
Publication:578884
DOI10.1016/0167-8191(87)90018-4zbMath0624.65146MaRDI QIDQ578884
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
42A15: Trigonometric interpolation
65Y05: Parallel numerical computation
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
A PARALLEL FAST FOURIER TRANSFORM, Redistribution strategies for portable parallel FFT: a case study, EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗, Congruent Number Theta Coefficients to 1012, A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures, Pseudospectral methods on massively parallel computers, Calculation scheme based on a weighted primitive: application to image processing transforms, Five-step FFT algorithm with reduced computational complexity, The parallel Fourier pseudospectral method, Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers, Vector and parallel methods for the direct solution of Poisson's equation, FFT algorithms and their adaptation to parallel processing, A case study in parallel computing. I: Homogeneous turbulence on a hypercube, Circulant preconditioners for second order hyperbolic equations, Communication efficient multi-processor FFT, Parallel integration of ODEs based on convolution algorithms, Fast parallel solution of the Poisson equation on irregular domains, Fault-tolerant algorithm for Fast Fourier Transform on hypercubes, A distributed memory algorithm for 3-D FFTs, A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods, THE VECTOR MULTIPROCESSOR, Numerical results on relations between fundamental constants using a new algorithm
