FFT algorithms for vector computers (Q1058842)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: FFT algorithms for vector computers |
scientific article; zbMATH DE number 3901979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FFT algorithms for vector computers |
scientific article; zbMATH DE number 3901979 |
Statements
FFT algorithms for vector computers (English)
0 references
1984
0 references
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.
0 references
fast Fourier transform
0 references
Pease algorithm
0 references
Stockham autosort algorithm
0 references
vectorization
0 references
Cooley-Tukey algorithm
0 references
vector computers
0 references
