Regular Article: Computing Fourier Transforms and Convolutions on the 2-Sphere
Advances in Applied Mathematics
A fast transform for spherical harmonics
A fast transform for spherical harmonics
Optimization of computations in global geopotential field applications
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Discrete Spherical Harmonic Transforms: Numerical Preconditioning and Optimization
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Spherical harmonic transforms using quadratures and least squares
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Hi-index | 0.00 |
Spherical Harmonic Transforms (SHTs) which are essentially Fourier transforms on the sphere are critical in global geopotential and related applications. Discrete SHTs are more complex to optimize computationally than Fourier transforms in the sense of the well-known Fast Fourier Transforms (FFTs). Furthermore, for analysis purposes, discrete SHTs are difficult to formulate for an optimal discretization of the sphere, especially for applications with requirements in terms of near-isometric grids and special considerations in the polar regions. With the enormous global datasets becoming available from satellite systems, very high degrees and orders are required and the implied computational efforts are very challenging. The computational aspects of SHTs and their inverses to very high degrees and orders (over 3600) are discussed with special emphasis on information conservation and numerical stability. Parallel and grid computations are imperative for a number of geodetic, geophysical and related applications, and these are currently under investigation.