A fast algorithm for filtering and wavelet decomposition on the sphere.
Brian Martin, Daniel Potts · 2003
This paper introduces a new fast algorithm for uniform-resolution filtering of functions defined on the sphere. We use a fast summation algorithm based on Nonequispaced Fast Fourier Transforms, building on previous work that used Fast Multipole Methods. The resulting algorithm performs a triangular truncation of the spectral coef- ficients while avoiding the need for fast spherical Fourier transforms. The method requires operations for grid points. Furthermore, we apply these techniques to obtain a fast wavelet decomposition algorithm on the sphere. We present the results of numerical experiments to illustrate the performance of the algorithms.