FFT algorithms for vector computers
From MaRDI portal
Publication:1058842
DOI10.1016/S0167-8191(84)90413-7zbMath0565.65086OpenAlexW2127391977WikidataQ56235042 ScholiaQ56235042MaRDI QIDQ1058842
Publication date: 1984
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(84)90413-7
fast Fourier transformvectorizationCooley-Tukey algorithmvector computersPease algorithmStockham autosort algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (14)
Invariant tori through direct solution of the Hamilton-Jacobi equation ⋮ EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗ ⋮ PERFORMANCE ANALYSIS OF A PARALLEL FFT ALGORITHM ON A TRANSPUTER NETWORK ⋮ Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP ⋮ Using the Fast Fourier Transform to Compute Multiple Comparisons With the Best and Subset Selection Critical Values ⋮ SHAVEL: a program for the spherical harmonic analysis of a horizontal vector field sampled in an equiangular grid on a sphere ⋮ A fourth order Hermitian box-scheme with fast solver for the Poisson problem in a square ⋮ Parallel vector multidimensional Slant, Haar, and Walsh-Hadamard transforms ⋮ A high-performance fast Fourier transform algorithm for the Cray-2 ⋮ Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers ⋮ Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Secondary flow structure of turbulent Couette-Poiseuille and Couette flows inside a square duct ⋮ A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures ⋮ An implementation of parallel number-theoretic transform using Intel AVX-512 instructions
Uses Software
This page was built for publication: FFT algorithms for vector computers
