Generating fast Fourier transforms of solvable groups

DOI10.1016/j.jsc.2002.06.006zbMath1052.65122OpenAlexW2007980038MaRDI QIDQ597054

Michael Clausen, Meinard Müller

Publication date: 6 August 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2002.06.006

zbMATH Keywords

fast Fourier transformdiscrete Fourier transformsolvable groupscomplexity bounds

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items

Applications of the generalized Fourier transform in numerical linear algebra, Subquadratic-time algorithms for normal bases, Decomposing monomial representations of solvable groups.

Uses Software

• AREP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence and efficient construction of fast Fourier transforms on supersolvable groups
• On the computational complexity of the general discrete Fourier transform
• Towards a soluble quotient algorithm
• Fast generalized Fourier transforms
• Gaussian elimination is not optimal
• Efficient Computation of the Fourier Transform on Finite Groups
• Computing Irreducible Representations of Supersolvable Groups
• Endliche Gruppen I