FFT algorithms for vector computers
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.
scientific article; zbMATH DE number 3901979