Fast Fourier analysis for abelian group extensions
The Fourier transform FT of a complex-valued function f on a finite group G is defined as \(\hat f(\rho)=\sum_{s\in G}f(s)\rho(s)\) at an irreducible representation of G. Its inversion formula \(f(s)=(1/| G|)\sum_{\rho}d_{\rho}trace(\hat f(\rho)\rho(s^{-1}))\) determines f at all the irreducible representations of G. When G contains some nontrivial normal subgroup K such that \(G/K\) is abelian, the necessary number of arithmetic operations for the FT is reduced to \(O((| G| /| K|)T(K)+| G| \log (| G| /| K|))\), where \(T(K)\) is the necessary number of arithmetic operations for FT on K. Similar result is obtained for the inverse transform.
- 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
- 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
- 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?)
- Is computing with the finite Fourier transform pure or applied mathematics?
- Representations induced in an invariant subgroup
- Efficient computation of Fourier transforms on compact groups
- The \(p\)-adic finite Fourier transform and theta functions
- Fourier transform imitations
- Double coset decompositions and computational harmonic analysis on groups
- The efficient computation of Fourier transforms on semisimple algebras
- Decomposing monomial representations of solvable groups.
- Fast Fourier transforms for wreath products
- Applications of the generalized Fourier transform in numerical linear algebra
- Quantum algorithms for algebraic problems
- Efficient Computation of the Fourier Transform on Finite Groups
- Fast Fourier Transforms for Metabelian Groups
- True spectrum of a finite Fourier transform
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- Matrices of finite abelian groups, finite Fourier transform and codes.
- Generalized iterated wreath products of cyclic groups and rooted trees correspondence
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Rooted trees and iterated wreath products of cyclic groups
- Improved upper complexity bounds for the discrete Fourier transform
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
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)
