In this paper, we propose an algorithm for the stable and efficient computation of Fourier expansions of square integrable functions on the unit sphere S ⊂ ℝ3, as well as for the evaluation of these Fourier expansions at special knots. The heart of the algorithm is an efficient realization of discrete Legendre function transforms based on a modified and stabilized version of the Driscoll-Healy algorithm. © 1998 Elsevier Science Inc. All rights reserved.
Potts, D., Steidl, G., & Tasche, M. (1998). Fast and stable algorithms for discrete spherical Fourier transforms. Linear Algebra and Its Applications, 275–276, 433–450. https://doi.org/10.1016/S0024-3795(97)10013-1