Remarks on the structure of matrix-valued spectral transforms on finite non-Abelian groups

In spectral representations of discrete functions, the main optimization goal is to reduce the number of non-zero spectral coefficients of the function that is represented as a linear combination of a set of basis functions. Fourier transform for matrix-valued functions provides a deterministic way to redistribute the complexity of a spectral representation into a small set of matrix-valued coefficients.