Efficient Computation of Fourier Transforms on Compact Groups

Journal of Fourier Analysis and Applications

Volumn 4, Issue 1, 1998, Pages 19-52

  Maslen, David K ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Computational complexity; Gel'fand Tsetlin basis; Generalized Fourier transform; Spherical harmonics

Indexed keywords

EID: 1842665792     PISSN: 10695869     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02475926     Document Type: Article

References (39)

1. Atkinson, M. (1977). The complexity of group algebra computations, Theor. Comp. Sci. 5, 205-209.
2. Alpert, B. and Rokhlin, V. (1991). A fast algorithm for the evaluation of Legendre transforms, SIAM J. Sci. Statist. Comput. 12, 158-179.
3. Baum, U. (1991). Existence and efficient construction of fast Fourier transforms for supersolvable groups, Comput. Complexity 1, 235-256.
4. Beth, T. (1984). Verfahren der schnellen Fourier-Transformation, Teubner Studien-bücher, Stuttgart.
5. Bratelli, O. (1972). Inductive limits of finite dimensional C*-algebras, Trans. Am. Math. Soc. 171, 195-234.
6. Clausen, M. (1989). Fast generalized Fourier transforms, Theoret. Comput. Sci. 67, 55-63.
7. Clausen, M. (1988). Beiträge zum Entwurf schneller Spektraltransformationen, Habilitations-schrift, Fakultät für Informatik der Universität Karlsruhe (TH).
8. Clausen, M. and Baum, U. (1993). Fast Fourier Transforms, Wissenschafts - Verlag, Manheim.
9. Cooley, J. and Tukey, J. (1965). An algorithm for machine calculation of complex Fourier series, Math. Comp. 19, 297-301.
10. Diaconis, and Rockmore, D. (1990). Efficient computation of the Fourier transform on finite groups, J. Am. Math. Soc. 3(2), 297-332.
11. Driscoll, J.R. and Healy, Jr., D. (1994). Computing Fourier transforms and convolutions on the 2-sphere, (extended abstract) Proc. 34th IEEE FOCS, (1989), 344-349; Adv. in Appl. Math., 15, 202-250.
12. Driscoll, J.R. and Healy, Jr., D. (1994). Computing Fourier transforms and convolutions on the 2-sphere, (extended abstract) Proc. 34th IEEE FOCS, (1989), 344-349; Adv. in Appl. Math., 15, 202-250.
13. Driscoll, J.R., Healy, Jr., D., and Rockmore, D. Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs, SIAM J. Comput. (to appear).
14. Gel'fand, I.M. and Tsetlin, M. (1950). Finite dimensional representations of the group of unimodular matrices, Dokl. Akad. Nauk SSSR 71, 825-828 (Russian).
15. Goodman, F., de la Harpe, P., and Jones, V. (1989). Coxeter Graphs and Towers of Algebras, Springer-Verlag, New York.
16. Healy, Jr., D. Evaluation of phase polynomials on non-uniform sample sets in the plane, with applications in fast MRI, in preparation.
17. Healy, Jr., D., Maslen, D., Moore, S., Rockmore, D., and Taylor, M. Applications of a fast convolution algorithm on the 2-sphere, in preparation.
18. Healy, Jr., D., Moore, S., and Rockmore, D. (1994). Efficiency and reliability issues in a fast Fourier transform on the 2-sphere, Technical Report, Department of Mathematics and Computer Science, Dartmouth College.
19. Karpovsky, M. (1977). Fast Fourier transforms on finite nonabelian groups, IEEE Trans. Comput. 26(10), 1028-1030.
20. Klimyk, A. (1979). Matrix Elements and Clebsch-Gordan Coefficients of Group Representations, Naukova Dumka, Kiev, (Russian).
21. Klimyk, A. and Vilenkin, N. (1993). Representation of Lie Groups and Special Functions, vol. 2, Mathematics and its Applications (Soviet Series), vol. 74, Kluwer, Boston.
22. Klimyk, A. and Vilenkin, N. (1993). Representation of Lie Groups and Special Functions, vol. 3, Mathematics and its Applications (Soviet Series), vol. 75, Kluwer, Boston.
23. n of orthogonal matrices, Dokl. Akad. Nauk Byelorussian SSR 9, 77-81 (Russian).
24. Lang, S. (1984). Algebra, 2nd ed., Addison-Wesley, Reading, MA.
25. Maslen, D. (1993). Fast transforms and sampling for compact groups, Ph.D. Thesis, Department of Mathematics, Harvard University, Cambridge, MA.
26. Maslen, D. Sampling of functions and sections for compact groups, preprint.
27. Maslen, D. (1995). A polynomial approach to orthogonal polynomial transforms, Max-Planck preprint MPI/95-9.
28. Maslen, D. The efficient computation of Fourier transforms on the symmetric group, preprint IHES/M/96/52, and Math. Comp. (to appear).
29. Maslen, D. and Rockmore, D. (1996). Generalized FFTs - a survey of some recent results, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Groups and Computation, II, L. Finkelstein and W. Kantor, Eds., 183-237.
30. Maslen, D. and Rockmore, D. (1997). Separation of variables and the efficient computation of Fourier transforms on finite groups, I, J. Am. Math. Soc. 10 (1), 169-214.
31. Maslen, D. and Rockmore, D. Separation of variables and the efficient computation of Fourier transforms on finite groups, II, in preparation.
32. Moore, S. (1994). Efficient stabilization methods for fast polynomial transforms, Ph.D. Thesis, Dartmouth College, NH.
33. Moore, S., Healy, Jr., D., and Rockmore, D. (1993). Symmetry stabilization for polynomial evaluation and interpolation, Linear Algebra Appl. 192, 249-299.
34. Rockmore, D. (1990). Fast Fourier analysis for abelian group extensions, Adv. in Appl. Math. 11, 164-204.
35. Rockmore, D. (1996). Some applications of generalized FFTs, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Groups and Computation, II, L. Finkelstein and W. Kantor, Eds., 329-369.
36. Vilenkin, N. (1968). Special functions and the theory of group representations, Transl. Math. Monog. 22 AMS, Providence RI.
37. Wallach, N. (1973). Harmonic Analysis on Homogeneous Spaces, Marcel Dekker, New York.
38. Willsky, A.S. (1978). On the algebraic structure of certain partially observable finite-state Markov processes, Inform. Contr., 38, 179-212.
39. Želobenko, D. (1973). Compact Lie groups and their representations, Transl. Math. Monog. 40 AMS, Providence RI.