Computing Isotypic Projections with the Lanczos Iteration

DOI10.1137/S0895479801399778MaRDI QIDQ4650959zbMATH OpenFDO

Authors David K. Maslen, Michael E. Orrison, Daniel N. Rockmore

Publication date 21 February 2005

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

symmetric groupsLanczos iterationseparating setdistance transitive graphsisotypic projection

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• scientific article; zbMATH DE number 475357
• Constructing permutation representations for matrix groups
• An algorithm for computing invariant projectors in representations of wreath products
• An algorithm for decomposing representations of finite groups using invariant projections
• Splitting permutation representations of finite groups by polynomial algebra methods

Cited in

(11)

• A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
• Computational bounds for doing harmonic analysis on permutation modules of finite groups
• A representation-theoretic approach to the calculation of evolutionary distance in bacteria
• Computing projections with LSQR
• A Spectral Analysis Approach for Experimental Designs
• The computation of isotropic vectors
• A fast Fourier transform for the Johnson graph
• Reflections acting efficiently on a building
• scientific article; zbMATH DE number 475357 (Why is no real title available?)
• Separation of variables and the computation of Fourier transforms on finite groups. II
• Primitive decompositions of Johnson graphs

This page was built for publication: Computing Isotypic Projections with the Lanczos Iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650959)