Decimation-in-Frequency Fast Fourier Transforms for the Symmetric Group
In this thesis, we present a new class of algorithms that determine fast Fourier transforms for a given finite group G. These algorithms use eigenspace projections determined by a chain of subgroups of G, and rely on a path algebraic approach to the representation theory of finite groups developed b...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2005
|
| Subjects: | |
| Online Access: | https://scholarship.claremont.edu/hmc_theses/173 https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1176&context=hmc_theses |