#### Filter Results:

#### Publication Year

1975

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

SPHEREPACK 2.0 is a collection of FORTRAN programs that facilitates computer modeling of geophysical processes. The package contains programs for computing certain common differential operators including divergence, vorticity, gradients, and the Laplacian of both scalar and vector functions. Programs are also available for inverting these operators. For… (More)

The purpose of this paper is to describe technical note, NCAR TN/IA-109, which is intended to provide scientists with a package of computer programs which make use of current methods for solving elliptic partial differential equations. Computer models of geophysical processes often require the numerical solution of elliptic partial differential equations.… (More)

The purpose of this paper is to describe technical note, NCAR TN/IA-109, which is intended to provide scientists with a package of computer programs which make use of current methods for solving elliptic partial differential equations. Computer models of geophysical processes often require the numerical solution of elliptic partial differential equations.… (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)

DESCRIPTION 1. Introduction 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, velocity potentials, or vorticity equations and for models that compute the pressure of an incompressible fluid. The numerical solution… (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)

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)