Fast Fourier analysis for abelian group extensions

DOI10.1016/0196-8858(90)90008-MzbMath0709.65126MaRDI QIDQ921894

Daniel N. Rockmore

Publication date: 1990

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Fourier transformirreducible representationinversion formulaAbelian groupfinite groupirreducible matrix representationmatrix multiplicationFourier inversion

Mathematics Subject Classification ID

Related Items (12)

Fast Fourier Analysis for SL₂over a Finite Field and Related Numerical Experiments ⋮ Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice ⋮ Existence and efficient construction of fast Fourier transforms on supersolvable groups ⋮ Applications of the generalized Fourier transform in numerical linear algebra ⋮ Rooted trees and iterated wreath products of cyclic groups ⋮ The efficient computation of Fourier transforms on semisimple algebras ⋮ Quantum algorithms for algebraic problems ⋮ Efficient Computation of the Fourier Transform on Finite Groups ⋮ Efficient computation of Fourier transforms on compact groups ⋮ Double coset decompositions and computational harmonic analysis on groups ⋮ Improved upper complexity bounds for the discrete Fourier transform ⋮ Decomposing monomial representations of solvable groups.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast generalized Fourier transforms
• A generalization of spectral analysis with application to ranked data
• Representations induced in an invariant subgroup
• Fast Fourier Transforms for Metabelian Groups
• Average running time of the fast Fourier transform
• Is computing with the finite Fourier transform pure or applied mathematics?
• Efficient computation of Fourier inversion for finite groups

This page was built for publication: Fast Fourier analysis for abelian group extensions