Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1066-1099

  Driscoll, J R ^a   Healy Jr , D M ^b   Rockmore, D N ^b  

^a Driscoll Brewing   (United States)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

Discrete polynomial transform; Distance transitive graph; Fast Fourier transform; FFT; Orthogonal polynomials; Three term recurrence

Indexed keywords

DATA REDUCTION; FAST FOURIER TRANSFORMS; GRAPH THEORY; POLYNOMIALS; SET THEORY; SPECTRUM ANALYSIS; VECTORS;

DISTANCE TRANSITIVE GRAPH; FAST DISCRETE POLYNOMIAL TRANSFORMS; ORTHOGONAL POLYNOMIALS; THREE TERM RECURRENCE;

ALGORITHMS;

EID: 0031209710     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792240121     Document Type: Article

References (33)

1. E. BANNAI AND T. ITO, Algebraic Combinatorics I: Association Schemes, Benjamin/Cummings Publishing Co., Inc., Menlo Park, CA, 1984.
2. R. BAILEY, P. DIACONIS, D. ROCKMORE, AND C. ROWLEY, Representation Theory and ANOVA, Technical Report, Department of Mathematics, Harvard University, Cambridge, MA, 1994.
3. N. BIGGS, Algebraic Graph Theory, Cambridge Tracts in Mathematics 67, Cambridge University Press, Cambridge, UK, 1974.
4. A. BORODIN AND I. MUNRO, The Computational Complexity of Algebraic and Numeric Problems, Elsevier, New York, 1975.
5. J. BOYD, Chebyshev and Fourier Spectral Methods, Springer-Verlag, New York, 1989.
6. N. BSHOUTY, M. KAMINSKI, AND D. KIRKPATRICK, Addition requirements for matrix and transposed matrix products, J. Algorithms, 9 (1988), pp. 354-364.
7. T. S. CHIHARA, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, 1978.
8. P. DIACONIS, Group Representations in Probability and Statistics, Institute for Mathematical Statistics, Hayward, CA, 1988.
9. P. DIACONIS AND D. ROCKMORE, Efficient computation of isotropic projections for the symmetric group, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 11, L. Finkelstein and W. Kantor, eds., AMS, Providence, RI, 1992, pp. 87-104.
10. J. R. DRISCOLL AND D. HEALY, Computing Fourier transforms and convolutions on the 2-sphere, Adv. Appl. Math., 15 (1994), pp. 202-250.
11. D. F. ELLIOTT AND K. R. RAO, Fast Transforms: Algorithms, Analyses, Applications, Academic Press, New York, 1982.
12. W. GAUTSCHI, On the construction of Gaussian quadrature rules from modified moments, Math. Comp., 24 (1970), pp. 245-260.
13. W. GAUTSCHI, Questions of numerical condition related to polynomials, in Studies in Numerical Analysis, G. Golub, ed., MAA, Washington, DC, 1984, pp. 140-177.
14. B. GROSS, Some applications of Gelfand pairs to number theory, Bull. Amer. Math. Soc., 24 (1991), pp. 277-301.
15. D. HEALY, S. MOORE, AND D. ROCKMORE, Efficiency and Stability Issues in the Numerical Computation of Fourier Transforms on the 2-Sphere, Technical Report PCS-TR94-222, Department of Mathematics and Computer Science, Dartmouth College, Hanover, NH, 1993.
16. D. HEALY, D. MASLEN, S. MOORE, D. ROCKMORE, AND M. TAYLOR, Applications of FFT's on the 2-sphere, manuscript.
17. S. HELGASON, Groups and Geometric Analysis, Academic Press, New York, 1984.
18. N. J. HIGHAM, Fast solution of Vandermonde-like systems involving orthogonal polynomials, IMA J. Numer. Anal., 8 (1988), pp. 473-486.
19. S. KARLIN AND J. L. MCGREGOR, The Hahn polynomials, formulas and an application, Scripta Math., 26 (1961), pp. 33-46.
20. D. MASLEN, Fast Transforms and Sampling for Compact Groups, Ph.D. thesis, Department of Mathematics, Harvard University, Cambridge, MA, 1993.
21. S. MOORE, D. HEALY, AND D. ROCKMORE, Symmetry stabilization for polynomial evaluation and interpolation, Linear Algebra Appl., 192 (1993), pp. 249-299.
22. A. F. NIKIFOROV, S. K. SUSLOV, AND V. B. UVAROV, Classical Orthogonal Polynomials of a Discrete Variable, Springer-Verlag, New York, 1991.
23. H. J. NUSSBAUMER, Fast Fourier Transform and Convolution Algorithms, Springer-Verlag, New York, 1982.
24. A. OPPENHEIM AND R. SCHAFER, Discrete-Time Signal Processing, Prentice-Hall, Englewood Cliffs, NJ, 1989.
25. V. PAN, Matrix and polynomial computations, SIAM Review, 34 (1992), pp. 225-262.
26. J. P. SERRE, Linear Representations of Finite Groups, Springer-Verlag, New York, 1986.
27. D. STANTON, Orthogonal polynomials and Chevalley groups, in Special Functions: Group Theoretical Aspects and Applications, R. Askey, T. Koornwinder, and W. Schempp, eds., Reidel, Dordrecht, The Netherlands, 1984, pp. 87-128.
28. D. STANTON, Harmonics on posets, J. Combin. Theory Ser. A, 40 (1985), pp. 136-149.
29. D. STANTON, An introduction to group representations and orthogonal polynomials, in Orthogonal Polynomials, P. Nevai, ed., Kluwer Academic Publishers, Norwell, MA, 1990, pp. 419-433.
30. C. TEMPERTON, On scalar and vector transform methods for global spectral models, Monthly Weather Review, 119 (1991), pp. 1303-1307.
31. R. TOLIMIERI, M. AN, AND C. LU, Algorithms for Discrete Fourier Transform and Convolution, Springer-Verlag, New York, 1989.
32. D. TRAVIS, Spherical functions on finite groups, J. Algebra, 29 (1974), pp. 65-76.
33. H. WIELANDT, Finite Permutation Groups, Academic Press, New York, 1964.