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… CONTINUE READING
197 Citations
Fast, exact (but unstable) spin spherical harmonic transforms
- Physics, Computer Science
- ArXiv
- 2008
- 16
- Highly Influenced
- PDF
Fast evaluation of quadrature formulae on the sphere
- Computer Science, Mathematics
- Math. Comput.
- 2008
- 39
- PDF
Fast algorithms for spherical harmonic expansions, II
- Mathematics, Computer Science
- J. Comput. Phys.
- 2008
- 88
- PDF
High resolution spherical and ellipsoidal harmonic expansions by Fast Fourier Transform
- Mathematics
- Studia Geophysica et Geodaetica
- 2014
- 10
- PDF
Optimization of Spherical Harmonic Transform Computations
- Computer Science
- International Conference on Computational Science
- 2005
- 4
- PDF
References
SHOWING 1-10 OF 18 REFERENCES
A test of a modified algorithm for computing spherical harmonic coefficients using an FFT
- Mathematics
- 1989
- 10
A Fast Algorithm for the Evaluation of Legendre Expansions
- Mathematics, Computer Science
- SIAM J. Sci. Comput.
- 1991
- 210