A fast transform for spherical harmonics

@article{Mohlenkamp1997AFT,
  title={A fast transform for spherical harmonics},
  author={Martin J. Mohlenkamp},
  journal={Journal of Fourier Analysis and Applications},
  year={1997},
  volume={5},
  pages={159-184}
}
AbstractSpherical harmonics arise on the sphere S2 in the same way that the (Fourier) exponential functions {eikθ}k∈ℤ arise on the circle. Spherical harmonic series have many of the same wonderful properties as Fourier series, but have lacked one important thing: a numerically stable fast transform analogous to the Fast Fourier Transform (FFT). Without a fast transform, evaluating (or expanding in) spherical harmonic series on the computer is slow—for large computations probibitively slow. This… 
A Fast Transform for Spherical Harmonics
TLDR
A fast transform analogous to the Fast Fourier Transform is provided for Spherical Harmonic series and it is shown that although these matrices are dense and oscillatory, locally they can be represented efficiently in trigonometric series.
Fast, exact (but unstable) spin spherical harmonic transforms
TLDR
This work derives algorithms to perform forward and inverse spin spherical harmonic transforms for functions of arbitrary spin number by recasting the spin transform on the two-sphere S^2 as a Fourier transform onthe two-torus T^2, thereby providing an alternative sampling theorem on the sphere.
Fast evaluation of quadrature formulae on the sphere
TLDR
A new fast algorithm for the adjoint problem which can be used to compute expansion coefficients from sampled data by means of quadrature rules and results of numerical tests are provided showing the stability of the obtained algorithm.
High resolution spherical and ellipsoidal harmonic expansions by Fast Fourier Transform
High resolution transformations between regular geophysical data and harmonic model coefficients can be most efficiently computed by Fast Fourier Transform (FFT). However, a prerequisite is that the
Optimization of Spherical Harmonic Transform Computations
TLDR
The computational aspects of spherical Harmonic Transforms and their inverses to very high degrees and orders are discussed with special emphasis on information conservation and numerical stability.
3 The new fast transform algorithm 3 . 1 Fast interpolation of associated Legendre function expansions
TLDR
This paper proposes a fast transform algorithm for spherical harmonic transform using Fast Multipole Method (FMM), and its program is publicly available as FLTSS and some details of the new algorithm and its implementation are discussed.
...
...

References

SHOWING 1-10 OF 17 REFERENCES
Computing Fourier Transforms and Convolutions on the 2-Sphere
TLDR
Convolution theorems generalizing well known and useful results from the abelian case are used to develop a sampling theorem on the sphere, which reduces the calculation of Fourier transforms and convolutions of band-limited functions to discrete computations.
A Fast Algorithm for the Evaluation of Legendre Expansions
TLDR
An algorithm is presented for the rapid calculation of the values and coefficients of finite Legendre series and admits far-reaching generalizations and is currently being applied to several other problems.
The Theory of Spherical and Ellipsoidal Harmonics
Preface 1. The transformation of Laplaces's equation 2. The solution of Laplace's equation in polar coordinates 3. The Legendres associated functions 4. Spherical harmonics 5. Spherical harmonics of
Optimized Local Trigonometric Bases
TLDR
This paper generalizes Malvar–Coifman–Meyer wavelets by extending the choice of bell functions to produce a family of smooth local trigonometric bases that efficiently compress trig onometric functions.
Fast wavelet transforms and numerical algorithms I
TLDR
The algorithms presented here are based on the recently developed theory of wavelets and are applicable to all Calderon-Zygmund and pseudo-differential operators, and indicate that many previously intractable problems become manageable with the techniques presented here.
A Fast Algorithm for Adapted Time–Frequency Tilings
Abstract We first consider orthonormal bases of open face RNconsisting of discretized rescaled Walsh functions, whereNis a power of two. Given a vector, the best basis with respect to an additive
Adapted wavelet analysis from theory to software
This detail-oriented text is intended for engineers and applied mathematicians who must write computer programs to perform wavelet and related analysis on real data. It contains an overview of
Advanced Mathematical Methods For Scientists And Engineers
This book gives a self-contained presentation of the methods of asymptotics and perturbation theory, methods useful for obtaining approximate analytical solutions to differential and difference
...
...