Fast and parallel spectral transform algorithms for global shallow water models. Doctoral thesis
Abstract
The dissertation examines spectral transform algorithms for the solution of the shallow water equations on the sphere and studies their implementation and performance on shared memory vector multiprocessors. Beginning with the standard spectral transform algorithm in vorticity divergence form and its implementation in the Fortran based parallel programming language Force, two modifications are researched. First, the transforms and matrices associated with the meridional derivatives of the associated Legendre functions are replaced by corresponding operations with the spherical harmonic coefficients. Second, based on the fast Fourier transform and the fast multipole method, a lower complexity algorithm is derived that uses fast transformations between Legendre and interior Fourier nodes, fast surface spherical truncation and a fast spherical Helmholz solver. Because the global shallow water equations are similar to the horizontal dynamical component of general circulation models, the results can be applied to spectral transform numerical weather prediction and climate models. In general, the derived algorithms may speed up the solution of time dependent partial differential equations in spherical geometry.
 Authors:
 Publication Date:
 Research Org.:
 National Center for Atmospheric Research, Boulder, CO (United States)
 OSTI Identifier:
 5479370
 Report Number(s):
 PB94115029/XAB; NCAR/CT144
 Resource Type:
 Technical Report
 Resource Relation:
 Other Information: Doctoral thesis
 Country of Publication:
 United States
 Language:
 English
 Subject:
 54 ENVIRONMENTAL SCIENCES; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; AIRWATER INTERACTIONS; CLIMATE MODELS; ATMOSPHERIC CIRCULATION; COMPUTERIZED SIMULATION; MATHEMATICAL MODELS; SIMULATION 540120*  Environment, Atmospheric Chemicals Monitoring & Transport (1990); 990200  Mathematics & Computers
Citation Formats
Jakob, R. Fast and parallel spectral transform algorithms for global shallow water models. Doctoral thesis. United States: N. p., 1993.
Web.
Jakob, R. Fast and parallel spectral transform algorithms for global shallow water models. Doctoral thesis. United States.
Jakob, R. 1993.
"Fast and parallel spectral transform algorithms for global shallow water models. Doctoral thesis". United States.
doi:.
@article{osti_5479370,
title = {Fast and parallel spectral transform algorithms for global shallow water models. Doctoral thesis},
author = {Jakob, R.},
abstractNote = {The dissertation examines spectral transform algorithms for the solution of the shallow water equations on the sphere and studies their implementation and performance on shared memory vector multiprocessors. Beginning with the standard spectral transform algorithm in vorticity divergence form and its implementation in the Fortran based parallel programming language Force, two modifications are researched. First, the transforms and matrices associated with the meridional derivatives of the associated Legendre functions are replaced by corresponding operations with the spherical harmonic coefficients. Second, based on the fast Fourier transform and the fast multipole method, a lower complexity algorithm is derived that uses fast transformations between Legendre and interior Fourier nodes, fast surface spherical truncation and a fast spherical Helmholz solver. Because the global shallow water equations are similar to the horizontal dynamical component of general circulation models, the results can be applied to spectral transform numerical weather prediction and climate models. In general, the derived algorithms may speed up the solution of time dependent partial differential equations in spherical geometry.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 1993,
month = 1
}

Short communication.

Parallel algorithms for the spectral transform method
The spectral transform method is a standard numerical technique for solving partial differential equations on a sphere and is widely used in atmospheric circulation models. Recent research has identified several promising algorithms for implementing this method on massively parallel computers; however, no detailed comparison of the different algorithms has previously been attempted. In this paper, we describe these different parallel algorithms and report on computational experiments that we have conducted to evaluate their efficiency on parallel computers. The experiments used a testbed code that solves the nonlinear shallow water equations or a sphere; considerable care was taken to ensure thatmore » 
A VorticityDivergence Global SemiLagrangian Spectral Model for the Shallow Water Equations
The shallow water equations modeling flow on a sphere are useful for the development and testing of numerical algorithms for atmospheric climate and weather models. A new formulation of the shallow water equations is derived which exhibits an advective form for the vorticity and divergence. This form is particularly well suited for numerical computations using a semiLagrangian spectral discretization. A set of test problems, standard for the shallow water equations on a sphere, are solved and results compared with an Eulerian spectral model. The semiLagrangian transport method was introduced into atmospheric modeling by Robert, Henderson, and Turnbull. A formulation basedmore » 
Efficient parallel algorithms on the network model. Doctoral thesis
We develop efficient parallel algorithms for several fundamental problems on the hypercube, the shuffleexchange, the cubeconnected cycles and the butterfly. Those problems are related to load balancing, packet routing list ranking, graph theory and VLSI routing. Load balancing, sorting routing problems have been studied heavily on various parallel models. There are some optimal algorithms for these problems on few networks. We introduce a new simple and efficient algorithm for load balancing on our networks, and show that load balancing requires more time on our boundeddegree networks than on the weak hypercube. 
Efficient graph algorithms for sequential and parallel computers. Doctoral thesis
This thesis studies graph algorithms, both in sequential and parallel contexts. In the outline of the thesis, algorithm complexities are stated in terms of the the number of vertices n, the number of edges m, the largest absolute value of capacities U, and the largest absolute value of costs C. Chapter 1 introduces a new approach to the maximum flow problem that leads to better algorithms for the problem. Chapter 2 is devoted to the minimum cost flow problem, which is a generalization of the maximum flow problem. Chapter 3 addresses implementation of parallel algorithms through a case study ofmore »