#### Filter Results:

#### Publication Year

1984

2004

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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 Fourier transform (DFT) is based on integral roots of unity e ;2i=n , the fractional Fourier transform is based on fractional roots of unity e ;2i , where is… (More)

Several multiprocessor FFTs are developed in this paper for both vector multiproces-sors with shared memory and the hypercube. Two FFTs for vector multiprocessors are given that compute an ordered transform and have a stride of one except for a single "link" step. Since multiple FFTs provide additional options for both vectorization and distribution we show… (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 often requires a large FFT to be performed, even though most of the input data to this FFT may be zero and only a small fraction of the output data may be of… (More)

The Connection Machine 2 (CM-2) made by Thinking Machines Corporation is a massively parallel, single instruction multiple data machine with potential for computational rates in the range of several billions of floating point operations per second. A two-dimensional shallow water equations model was run on a CM-2 to obtain an estimate of its performance on… (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 is known to dominate the overall computing time. To this end we combine the order and computational phases of the FFT and also use sequence to processor maps… (More)

The original Cooley-Tukey FFT was published in 1965 and presented for sequences with length N equal to a power of two. However, in the same paper they noted that their algorithm could be generalized to composite N in which the length of the sequence was a product of small primes. In 1967, Bergland presented an algorithm for composite N and variants of his… (More)

The general theory of compatibility conditions for the differentiability of solutions to initial-boundary value problems is well known. This paper introduces the application of that theory to numerical solutions of partial differential equations and its ramifications on the performance of high-order methods. Explicit application of boundary conditions (BCs)… (More)