Towards safe and effective high-order Legendre transforms with applications to FFTs for the 2-sphere

Advances in Computational Mathematics

Volumn 21, Issue 1-2, 2004, Pages 59-105

  Healy Jr , D M ^a   Kostelec, P J ^b   Rockmore, D ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b Dartmouth College ^*  (United States)

Author keywords

Fast transform algorithms; Spherical harmonics

Indexed keywords

EID: 4043150726     PISSN: 10197168     EISSN: None     Source Type: Journal    
DOI: 10.1023/b:acom.0000016431.03652.65     Document Type: Article

References (32)

1. G. Chirikjian and A. Kyatkin, Engineering Applications of Noncommutative Harmonic Analysis: With Emphasis on Rotation and Motion Groups (Lewis Pub., 2001).
2. J.W. Cooley and J.W. Tukey, An algorithm for machine calculation of complex Fourier series, Math. Comp. 19 (1965) 297-301.
3. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
4. G.A. Dilts, Computation of spherical harmonic expansion coefficients via FFTs, J. Comput. Phys. 57(3) (1985) 439-453.
5. J.R. Driscoll and D. Healy, Computing Fourier transforms and convolutions on the 2-sphere (extended abstract), in: Proc. of the 34th IEEE FOCS, 1989, pp. 344-349; Adv. in Appl. Math. 15 (1994) 202-250.
6. J.R. Driscoll and D. Healy, Computing Fourier transforms and convolutions on the 2-sphere (extended abstract), in: Proc. of the 34th IEEE FOCS, 1989, pp. 344-349; Adv. in Appl. Math. 15 (1994) 202-250.
7. J.R. Driscoll, D. Healy and D. Rockmore, Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs, SIAM J. Comput. 26(4) (1997) 1066-1099.
8. D.F. Elliott and K.R. Rao, Fast Transforms: Algorithms, Analyses, and Applications (Academic Press, New York, 1982).
9. D. Healy, H. Hendriks and P. Kim, Spherical deconvolution with application to geometric quality assurance, Technical Report, Department of Mathematics and Computer Science, Dartmouth College (1993).
10. D. Healy and P. Kim, An empirical Bayes approach to directional data and efficient computation on the sphere, Ann. Statist. 24(1) (1996) 232-254.
11. D. Healy, S. Moore and D. Rockmore, Efficiency and stability issues in the numerical convolution of Fourier transforms and convolutions on the 2-sphere, Technical Report PCS-TR94-222, Department of Computer Science, Dartmouth College (1994).
12. D. Healy, D. Rockmore, P. Kostelec and S. Moore, FFTs for the 2-sphere - improvements and variations, J. Fourier Anal. Appl., to appear.
13. M.T. Heideman, D.H. Johnson and C.S. Burrus, Gauss and the history of the fast Fourier transform, Arch. Hist. Exact Sci. 34(3) (1985) 265-277.
14. R. Jakob-Chien and B.K. Alpert, A fast spherical filter with uniform resolution, J. Comput. Phys. 136 (1997) 580-584.
15. D. Maslen, Efficient computation of Fourier transforms on compact groups, J. Fourier Anal. Appl. 4(1) (1998) 19-52.
16. D. Maslen, Fast transforms and sampling for compact groups, Ph.D. thesis, Department of Mathematics, Harvard University (1993).
17. D. Maslen and D. Rockmore, Generalized FFTs, in: Groups and Computation II, eds. L. Finkelstein and W. Kantor, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 28 (Amer. Math. Soc., Providence, RI, 1997) pp. 183-237.
18. M.P. Mohlenkamp, A fast transform for spherical harmonics, J. Fourier Anal. Appl. 5(2/3) (1999) 159-184.
19. S. Moore, Efficient stabilization methods for fast polynomial transforms, Ph.D. thesis, Department of Mathematics and Computer Science, Dartmouth College (1994).
20. S. Moore, D. Healy and D. Rockmore, Symmetry stabilization for polynomial evaluation and interpolation, Linear Algebra Appl. 192 (1993) 249-299.
21. S. Moore, D. Healy, D. Rockmore and P. Kostelec, SpharmonicKit is a freely available collection of C programs for doing Legendre and scalar spherical transforms, Developed at Dartmouth College, available at www.cs.dartmouth.edu/~geelong/sphere/.
22. A. Oppenheim and R. Schafer, Discrete-Time Signal Processing (Prentice-Hall, Englewood Cliffs, NJ, 1989).
23. D. Potts, G. Steidl and M. Tasche, Fast and stable algorithms for discrete spherical Fourier transforms, Linear Algebra Appl. 275/276 (1998) 433-450.
24. D. Rockmore, Some applications of generalized FFTs (appendix with D. Healy), in: Groups and Computation II, eds. L. Finkelstein and W. Kantor, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 28 (Amer. Math. Soc., Providence, RI, 1997) pp. 329-369.
25. SPHEREPACK is a freely available collection of FORTRAN programs that facilitates computer modeling of geophysical processes developed at NCAR by J. Adams and P. Swarztrauber.
26. W.F. Spotz and P.N. Swarztrauber, A performance comparison of associated Legendre projections, J. Comput. Phys. 168(2) (2001) 339-355.
27. G. Steidl and M. Tasche, A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms, Math. Comp. 56 (1991) 281-296.
28. P.N. Swarztrauber and W.F. Spotz, Generalized discrete spherical harmonic transforms, J. Comput. Phys. 159(2) (2000) 213-230.
29. C. Temperton, On scalar and vector transform methods for global spectral models, Mon. Wea. Rev. 119 (1991) 1303-1307.
30. C. Van Loan, Computational Framework for the Fast Fourier Transform (SIAM, Philadelphia, PA, 1992).
31. N.J. Vilenkin, Special Functions and the Theory of Group Representations (Amer. Math. Soc., Providence, RI, 1968).
32. N. Yarvin and V. Rokhlin, A generalized one-dimensional fast multipole method with applications to filtering of spherical harmonics, J. Comput. Phys. 147(2) (1998) 5594-5609.