Fast Fourier analysis for abelian group extensions

DOI10.1016/0196-8858(90)90008-MMaRDI QIDQ921894zbMATH OpenFDO

Authors Daniel N. Rockmore

Publication date 1990

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

zbMATH Keywords

Fourier transformfinite groupirreducible representationmatrix multiplicationinversion formulaFourier inversionAbelian groupirreducible matrix representation

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Representations of groups, semigroups, etc. (aspects of abstract harmonic analysis) (43A65) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical solutions to equations with linear operators (65J10)

Recommendations

• Efficient Computation of the Fourier Transform on Finite Groups
• Fast Fourier Transforms for Metabelian Groups
• Efficient computation of Fourier inversion for finite groups
• scientific article; zbMATH DE number 475354
• Separation of variables and the computation of Fourier transforms on finite groups, I

Cites work

• scientific article; zbMATH DE number 3852384 (Why is no real title available?)
• scientific article; zbMATH DE number 3940297 (Why is no real title available?)
• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 4112856 (Why is no real title available?)
• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• scientific article; zbMATH DE number 3227104 (Why is no real title available?)
• A generalization of spectral analysis with application to ranked data
• Average running time of the fast Fourier transform
• Efficient computation of Fourier inversion for finite groups
• Fast Fourier Transforms for Metabelian Groups
• Fast generalized Fourier transforms
• Is computing with the finite Fourier transform pure or applied mathematics?
• Representations induced in an invariant subgroup

Cited in

(18)

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

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

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