Fast spherical Fourier algorithms
By Stefan Kunis, Daniel Potts. 2003
145 citations recorded by the source corpus.
Subfields: Atomic and Molecular Physics, and Optics, Computational Mechanics, Oceanography
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Atomic and Molecular Physics, and Optics
- Helmut Schaeben
- Ralf Hielscher
- Jürgen Prestin
- Jens Keiner
- Antje Vollrath
- Max Welling
- Taco Cohen
- Mario Geiger
In Computational Mechanics
- Mario Geiger
- Helmut Schaeben
- Ralf Hielscher
- Taco Cohen
- Jürgen Prestin
- Jens Keiner
- Antje Vollrath
- Jonas Köhler
In Oceanography
- Helmut Schaeben
- Ralf Hielscher
- Jürgen Prestin
- Jens Keiner
- Antje Vollrath
- Max Welling
- Taco Cohen
- Mario Geiger
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): “On these functions we perform the fast polynomial transform that has been described in [17] and [7] for the sphere S2.”
- Convolutional Networks for Spherical Signals (2017, methodology): “…basis functions by U l (which is either vector-valued or matrix-valued), we can write the GFT of a function f : X → R as This integral can be computed efficiently using a G-FFT algorithm (Kostelec & Rockmore, 2007; 2008; Kunis & Potts, 2003; Driscoll & Healy, 1994; Maslen, 1998; Potts et al., 2009).”
- Irregular sampling of band-limited functions on the sphere (2014, unknown): “4 below, to work properly the algorithm from [8,10,11] requires much denser sets of scattered points on S2 compared with our algorithm.”
- A novel pole figure inversion method: specification of the MTEX algorithm (2008, methodology): “In order to perform computation with ODFs given as the linear combination of radially symmetric functions, numerically we apply fast Fourier techniques on the rotation group SO(3) and the sphere S2, cf. Kunis & Potts (2003) and Keiner et al. (2006).”
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms (2009, methodology): “It was introduced in [Kunis and Potts 2003] while the adjoint variant was developed in [Keiner and Potts 2008].”