Paul N. Swarztrauber

Learn 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 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 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)
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)
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)