Fast and stable algorithms for discrete spherical Fourier transforms
By Daniel Potts, Gabriele Steidl, Manfred Tasche. 1998
Abstract 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 ⊂ R 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.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Taco Cohen
- Mario Geiger
- Max Welling
- Maurice Weiler
- David W. Romero
- Jonas Köhler
- Erik J. Bekkers
- Yoshua Bengio
Citations in the corpus
- Spherical CNNs (2018, background): “Other important works include (Driscoll and Healy, 1994; Healy et al., 2003; Potts et al., 1998; Kunis and Potts, 2003; Drake et al., 2008; Maslen, 1998; Rockmore, 2004; Kostelec and Rockmore, 2007; 2008; Potts et al., 2009; Makadia et al., 2007; Gutman et al., 2008).”
- A fast algorithm for nonequispaced Fourier transforms on the rotation group (2009, methodology): “This technique has been described in [22] as a key step in the development of a stable fast spherical Fourier transform.”