FFT algorithms for vector computers
type: Item
instance of: scholarly article
title: FFT algorithms for vector computers
zbMATH Open document ID: 0565.65086
DOI: 10.1016/S0167-8191(84)90413-7
author: Paul N. Swarztrauber
published in: Parallel Computing
publication date: 1984-01-01T00:00:00Z
review text: This paper proposes a vectorization of the Cooley-Tukey algorithm. This generalization is of interest for vector computers. In the same manner, the Pease and the Stockham FFT algorithm are adapted for parallel computing. These algorithms are illustrated by Fortran programs, and several points are discussed.
Mathematics Subject Classification ID: 65T40
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 42-04
Mathematics Subject Classification ID: 42B05
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3901979
zbMATH Keywords: fast Fourier transform
zbMATH Keywords: Pease algorithm
zbMATH Keywords: Stockham autosort algorithm
zbMATH Keywords: vectorization
zbMATH Keywords: Cooley-Tukey algorithm
zbMATH Keywords: vector computers
reviewed by: Guy Jumarie
describes a project that uses: FFTPACK
MaRDI profile type: Publication
Wikidata QID: Q56235042
full work available at URL: s0167-8191(84)90413-7
OpenAlex ID: W2127391977
DBLP publication ID: journals/pc/Swarztrauber84
description: scientific article; zbMATH DE number 3901979