Fast and stable algorithms for discrete spherical Fourier transforms Original Research Article

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 subset of image3, 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.