Fast spherical Fourier algorithms

Journal of Computational and Applied Mathematics

Volumn 161, Issue 1, 2003, Pages 75-98

  Kunis, Stefan ^a   Potts, Daniel ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

Associated Legendre functions; Fast discrete transforms; Fast Fourier transform at nonequispaced knots; Spherical Fourier transform; Spherical harmonics

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

FOURIER ALGORITHMS;

FAST FOURIER TRANSFORMS;

FOURIER TRANSFORM; HARMONICS; SPHERE;

EID: 0242626807     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00546-6     Document Type: Article

References (34)

1. G. Baszenski, Programmpaket zur Berechnung diskreter trigonometrischer transformationen, 1995, http://www.iuk.fh-dortmund.de/~baszenski/.
2. Baszenski G. Tasche M. Fast polynomial multiplication and convolution related to the discrete cosine transform Linear Algebra Appl. 252 1997 1-25
3. Beylkin G. On the fast Fourier transform of functions with singularities Appl. Comput. Harmon. Anal. 2 1995 363-381
4. Beylkin G. Cramer R. A multiresolution approach to regularization of singular operators and fast summation SIAM J. Sci. Comput. 24 2002 81-117
5. Boyd J.P. Chebyshev and Fourier Spectral Methods 2nd Edition 2000 Dover Press New York
6. Driscoll J. Healy D. Computing Fourier transforms and convolutions on the 2-sphere Adv. Appl. Math. 15 1994 202-250
7. Driscoll J. Healy D. Rockmore D. Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs SIAM J. Comput. 26 1996 1066-1099
8. Dutt A. Gu M. Rokhlin V. Fast algorithms for polynomial interpolation, integration and differentiation SIAM J. Numer. Anal. 33 1996 1689-1711
9. Dutt A. Rokhlin V. Fast Fourier transforms for nonequispaced data SIAM J. Sci. Statist. Comput. 14 1993 1368-1393
10. Fessler J.A. Sutton B.P. Nonuniform fast Fourier transforms using min-max interpolation IEEE Trans. Signal Process. 51 2003 560-574
11. K. Fourmont, Schnelle Fourier-transformation bei nichtäquidistanten Gittern und tomographische anwendungen, Dissertation, Universität Münster, 1999.
12. Freeden W. Gervens T. Schreiner M. Constructive Approximation on the Sphere 1998 Oxford University Press Oxford
13. Greengard L. Rokhlin V. A fast algorithm for particle simulations J. Comput. Phys. 73 1987 325-348
14. Healy D. Kostelec P. Moore S.S.B. Rockmore D. FFTs for the 2-sphere-Improvements and variations J. Fourier Anal. Appl. 9 2003
15. D. Healy, S.S.B. Moore, D. Rockmore, Efficiency and stability issues in the numerical computation of Fourier transforms and convolutions on the 2-sphere, Technical Report, Dartmouth College, Hanover, 1994.
16. Heinig G. Rost K. Representations of Cauchy matrices with Chebyshev nodes using trigonometric transformations Bini D. Tyrtyshnikov E. Yalamov P. Structured Matrices: Recent Developments in Theory and Computation Advances in Computation: Theory and Practice Vol. 4 2001 135-148 Nova Science New York
17. S. Kunis, D. Potts, NFFT, Softwarepackage, C subroutine library, http://www.math.uni-luebeck.de/potts/nfft, 2002.
18. Lasser R. Orthogonal polynomials hypergroups ii-the symmetric case Trans. Amer. Math. Soc. 341 1994 749-770
19. F.G. Lemoine, E.C. Pavlis, et al., The development of the joint NASA GSFC and NIMA geopotential model EGM96, Technical Report, NASA Goddard Space Flight Center, Greenbelt, Maryland 20771, USA, 1998.
20. H. Mhaskar, F. Narcowich, J. Ward, Quadrature formulas on spheres using scattered data, Math. Comp., to appear.
21. Mohlenkamp M.J. A fast transform for spherical harmonics J. Fourier Anal. Appl. 5 1999 159-184
22. Nieslony A. Steidl G. Sparse approximate factorization of nonuniform Fourier matrices with nonequispaced knots Linear Algebra Appl. 366 2003 337-351
23. Olver F.W.J. Asymptotics and Special Functions 1974 Academic Press New York
24. A. Persson, User guide to ecmwf forecast products, Technical Report, European Center for Medium-Range Weather Forecast, 2000.
25. Potts D. Steidl G. Tasche M. Fast algorithms for discrete polynomial transforms Math. Comp. 67 1998 1577-1590
26. Potts D. Steidl G. Tasche M. Fast and stable algorithms for discrete spherical Fourier transforms Linear Algebra Appl. 275 1998 433-450
27. Potts D. Steidl G. Tasche M. Fast Fourier transforms for nonequispaced data: a tutorial Benedetto J.J. Ferreira P.J.S.G. Modern Sampling Theory: Mathematics and Applications 2001 247-270 Birkhäuser Boston
28. Rao K. Yip P. Discrete Cosine Transforms 1990 Academic Press Boston
29. http://www.ece.cmu.edu/~spiral/.
30. Steidl G. Fast radix-p discrete cosine transform Appl. Algebra Eng. Comm. Comput. 3 1992 39-46
31. Steidl G. Tasche M. A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms Math. Comp. 56 1991 281-296
32. Suda R. Takami M. A fast spherical harmonics transform algorithm Math. Comp. 71 2001 703-715
33. Wang Z. Fast algorithms for the discrete W transform and for the discrete Fourier transform IEEE Trans. Acoust. Speech Signal Process. 32 1984 803-816
34. Ware A.F. Fast approximate Fourier transforms for irregularly spaced data SIAM Rev. 40 1998 838-856