This paper describes the \fractional Fourier transform", which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discreteâ€¦ (More)

Several multiprocessor FFTs are developed in this paper for both vector multiprocessors with shared memory and the hypercube. Two FFTs for vector multiprocessors are given that compute an orderedâ€¦ (More)

Computer models of geophysical processes often require the numerical solution of elliptic partial differential equations. This is particularly true for models that make use of stream functions,â€¦ (More)

The fast Fourier transform (FFT) is often used to compute numerical approximations to continuous Fourier and Laplace transforms. However, a straightforward application of the FFT to these problemsâ€¦ (More)

We examine design alternatives for ordered FFT algorithms on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication whichâ€¦ (More)