Fast evaluation of quadrature formulae on the sphere

Mathematics of Computation

Volumn 77, Issue 261, 2008, Pages 397-419

  Keiner, Jens ^a   Potts, Daniel ^b  

^a UNIVERSITY OF LÜBECK   (Germany)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

FFT; NFFT; Nonequispaced fast spherical fourier transform; Quadrature; Two sphere

Indexed keywords

EID: 38849204845     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-07-02029-7     Document Type: Article

References (21)

1. S. Belmehdi. On the associated orthogonal polynomials. J. Comput. Appl. Math., 32:311-319, 1991. MR1090883 (92e:33007)
2. M. Böhme and D. Potts. A fast algorithm for filtering and wavelet decomposition on the sphere. Electron. Trans. Numer. Anal., 16:70-92, 2003. MR1988721 (2004f:65220)
3. P. J. Davis and P. Rabinowitz. Methods of Numerical Integration (Second Edition). Academic Press Inc., 1984. MR760629 (86d:65004)
4. J. R. Driscoll and D. Healy. Computing Fourier transforms and convolutions on the 2-sphere. Adv. in Appl. Math., 15:202-250, 1994. MR1277214 (95h:65108)
5. W. Freeden, T. Gervens, and M. Schreiner. Constructive Approximation on the Sphere. Oxford University Press, Oxford, 1998. MR1694466 (2000e:41001)
6. M. Frigo and S. G. Johnson. FFTW, C subroutine library, http://www.fftw.org.
7. D. Healy, P. Kostelec, S. Moore, and D. Rockmore. FFTs for the 2-sphere - Improvements and variations. J. Fourier Anal. Appl., 9:341-385, 2003. MR1999564 (2005d:43014)
8. J. Keiner, S. Kunis, and D. Potts. NFFT3.0, Softwarepackage, C subroutine library. http://www.tu-chemnitz.de/~potts/nfft, 2006.
9. S. Kunis and D. Potts. Fast spherical Fourier algorithms. J. Comput. Appl. Math., 161:75-98, 2003. MR2018576 (2004k:65270)
10. H. N. Mhaskar, F. J. Narcowich, and J. D. Ward. Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature. Math. Comput., 70:1113-1130, 2001. Corrigendum on the positivity of the quadrature weights in 71:453-454, 2002. MR1710640 (2002a:41032)
11. M. J. Mohlenkamp. A fast transform for spherical harmonics. J. Fourier Anal. Appl., 5:159-184, 1999. MR1683208 (2000b:65247)
12. D. Potts, G. Steidl, and M. Tasche. Fast algorithms for discrete polynomial transforms. Math. Comput., 67:1577-1590, 1998. MR1474655 (99b:65183)
13. D. Potts, G. Steidl, and M. Tasche. Fast and stable algorithms for discrete spherical Fourier transforms. Linear Algebra Appl., 275/276:433-450, 1998. MR1628403 (99h:65229)
14. D. Potts, G. Steidl, and M. Tasche. Fast Fourier transforms for nonequispaced data: A tutorial. In J. J. Benedetto and P. J. S. G. Ferreira, editors, Modern Sampling Theory: Mathematics and Applications, pages 247-270. Birkhäuser, Boston, 2001. MR1865690
15. V. Rokhlin and M. Tygert. Fast Algorithms for Spherical Harmonic Expansions. SIAM J. Sci. Comput., 27:1903-1928, 2006. MR2211433 (2006m:65323)
16. I. H. Sloan and R. S. Womersley. Constructive polynomial approximation on the sphere. J. Approx. Theory, 103:91-118, 2000. MR1744380 (2000k:41009)
17. R. Suda and M. Takami. A fast spherical harmonics transform algorithm. Math. Comput., 71:703-715, 2002. MR1885622 (2003b:65145)
18. L. N. Trefethen. Is Gauss quadrature better than Clenshaw-Curtis? SIAM Review, 2007. to appear.
19. J. Waldvogel. Fast construction of Fejer and Clenshaw-Curtis quadrature rules. BIT, 46:195-202, 2006. MR2214855
20. A. F. Ware. Fast approximate Fourier transforms for irregularly spaced data. SIAM Rev., 40:838-856, 1998. MR1659685 (2000i:65228)
21. R. S. Womersley and I. H. Sloan. How good can polynomial interpolation on the sphere be? Adv. Comput. Math., 14:195-226, 2001. MR1845243 (2002e:41022)