A fast program generator of fast Fourier transforms

DOI10.1007/3-540-46796-3_4MaRDI QIDQ4502609zbMATH OpenFDO

Authors Michael Clausen, Meinard Müller

Publication date 14 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46796-3_4

zbMATH Keywords

complex group algebrasdiscrete Fourier transformsfinite groupsirreducible representationssupersolvable groups

Mathematics Subject Classification ID

Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Numerical methods for discrete and fast Fourier transforms (65T50) Symbolic computation and algebraic computation (68W30)

Recommendations

• Generating fast Fourier transforms of solvable groups
• Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• A fast generalized DFT for finite groups of Lie type
• Fast Fourier Transforms for Metabelian Groups

Cited in

(6)

• On the computational complexity of the general discrete Fourier transform
• DFT-based word normalization in finite supersolvable groups.
• A fast generalized DFT for finite groups of Lie type
• A new algorithm for fast generalized DFTs
• Generating fast Fourier transforms of solvable groups
• Existence and efficient construction of fast Fourier transforms on supersolvable groups

This page was built for publication: A fast program generator of fast Fourier transforms

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