Computing isotypic projections with the Lanczos iteration

SIAM Journal on Matrix Analysis and Applications

Volumn 25, Issue 3, 2004, Pages 784-803

  Maslen, David K ^a   Orrison, Michael E ^b   Rockmore, Daniel N ^c  

^a Susquehanna Partners GP   (United States)

^b HARVEY MUDD COLLEGE   (United States)

^c Lamont Doherty Earth Observatory   (United States)

Author keywords

Isotypic projection; Lanczos iteration; Separating set

Indexed keywords

EID: 3142754160     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801399778     Document Type: Article

References (23)

1. E. BOLKER, The finite Radon transform, in Integral Geometry (Brunswick, Maine, 1984), AMS, Providence, RI, 1987, pp. 27-50.
2. A. BROUWER, A. COHEN, AND A. NEUMAIER, Distance-regular Graphs, Springer-Verlag, Berlin, 1989.
3. J. CHEN, Group Representation Theory for Physicists, 2nd ed., World Scientific, Teaneck, NJ, 1989.
4. J. CULLUM AND R. WILLOUGHBY, Lánczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. I, Theory, Birkhäuser Boston, Boston, MA, 1985.
5. P. DIACONIS, Group Representations in Probability and Statistics, Institute of Mathematical Statistics, Hayward, CA, 1988.
6. P. DIACONIS, A generalization of spectral analysis with application to ranked data, Ann. Statist., 17 (1989), pp. 949-979.
7. P. DIACONIS AND D. ROCKMORE, Efficient computation of isotypic projections for the symmetric group, in Groups and Computation (New Brunswick, NJ, 1991), AMS, Providence, RI, 1993, pp. 87-104.
8. J. DRISCOLL, D. HEALY, AND D. ROCKMORE, Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs, SIAM J. Comput., 26 (1997), pp. 1066-1099.
9. D. DUMMIT AND R. FOOTE, Abstract Algebra, 2nd ed., John Wiley, New York, 1999.
10. W. GENTLEMAN AND G. SANDE, Fast Fourier transforms for fun and profit, in Proc. AFIPS, Fall Joint Computer Conference, Vol. 29, Spartan Books, NY, 1966, pp. 563-578.
11. J. KATRIEL, Some useful results concerning the representation theory of the symmetric group, J. Phys. A, 24 (1991), pp. 5227-5234.
12. D. MASLEN, The efficient computation of Fourier transforms on the symmetric group, Math. Comp., 67 (1998), pp. 1121-1147.
13. D. MASLEN AND D. ROCKMORE, Generalized FFTs - a survey of some recent results, in Groups and Computation, II, (New Brunswick, NJ, 1995), AMS, Providence, RI, 1997, pp. 183-237.
14. D. MASLEN AND D. ROCKMORE, Separation of variables and the computation of Fourier transforms on finite groups. I, J. Amer. Math. Soc., 10 (1997), pp. 169-214.
15. M. ORRISON, An Eigenspace Approach to Decomposing Representations of Finite Groups, Ph.D. thesis, Dartmouth College, Hanover, NH, 2001.
16. B. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall Inc., Englewood Cliffs, NJ, 1980.
17. D. ROCKMORE, Some applications of generalized FFTs, in Groups and Computation, II (New Brunswick, NJ, 1995), AMS, Providence, RI, 1997, pp. 329-369.
18. B. SAGAN, The Symmetric Group. Representations, Combinatorial Algorithms, and Symmetric Functions, The Wadsworth & Brooks/Cole Mathematics Series, Wadsworth & Brooks/Cole Advanced Books & Software, Pacific Grove, CA, 1991.
19. J.-P. SERRE, Linear Representations of Finite Groups, Springer-Verlag, New York, 1977.
20. R. STANLEY, Enumerative Combinatorics. Vol. 1, Cambridge University Press, Cambridge, UK, 1997.
21. D. STANTON, Orthogonal polynomials and Chevalley groups, in Special Functions: Group Theoretical Aspects and Applications, Reidel, Dordrecht, The Netherlands, 1984, pp. 87-128.
22. L. TREFETHEN AND D. BAU, III, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
23. J. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, UK, 1965.