A fast algorithm for filtering and wavelet decomposition on the sphere
Electronic transactions on numerical analysis, Tome 16 (2003), pp. 70-92
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 coefficients while avoiding the need for fast spherical Fourier transforms. The method requires operations $\textcent $###$\sterling $########$\ddot $§$\copyright $###
| $ for grid points.$ |
Classification :
65Txx, 33C55, 42C10
Keywords: spherical filter, spherical Fourier transform, spherical harmonics, associated Legendre functions, fast discrete transforms, fast Fourier transform at nonequispaced knots, wavelets, fast discrete summation
Keywords: spherical filter, spherical Fourier transform, spherical harmonics, associated Legendre functions, fast discrete transforms, fast Fourier transform at nonequispaced knots, wavelets, fast discrete summation
@article{ETNA_2003__16__a6,
author = {B\"ohme, Martin and Potts, Daniel},
title = {A fast algorithm for filtering and wavelet decomposition on the sphere},
journal = {Electronic transactions on numerical analysis},
pages = {70--92},
year = {2003},
volume = {16},
zbl = {1030.65148},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_2003__16__a6/}
}
TY - JOUR AU - Böhme, Martin AU - Potts, Daniel TI - A fast algorithm for filtering and wavelet decomposition on the sphere JO - Electronic transactions on numerical analysis PY - 2003 SP - 70 EP - 92 VL - 16 UR - http://geodesic.mathdoc.fr/item/ETNA_2003__16__a6/ LA - en ID - ETNA_2003__16__a6 ER -
Böhme, Martin; Potts, Daniel. A fast algorithm for filtering and wavelet decomposition on the sphere. Electronic transactions on numerical analysis, Tome 16 (2003), pp. 70-92. http://geodesic.mathdoc.fr/item/ETNA_2003__16__a6/