Fast Fourier Transforms for Metabelian Groups
From MaRDI portal
Recommendations
- Fast Fourier analysis for abelian group extensions
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
- Efficient Computation of the Fourier Transform on Finite Groups
- Improved upper complexity bounds for the discrete Fourier transform
- Separation of variables and the computation of Fourier transforms on finite groups, I
Cited in
(17)- Fast generalized Fourier transforms
- Double coset decompositions and computational harmonic analysis on groups
- Canonical bases for cyclotomic fields
- Fast Fourier transforms for wreath products
- Efficient Computation of the Fourier Transform on Finite Groups
- scientific article; zbMATH DE number 1985231 (Why is no real title available?)
- scientific article; zbMATH DE number 1504649 (Why is no real title available?)
- scientific article; zbMATH DE number 1504660 (Why is no real title available?)
- A fast generalized DFT for finite groups of Lie type
- Metaplectic group, symplectic Cayley transform, and fractional Fourier transforms
- A new algorithm for fast generalized DFTs
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- From Fourier expansions to arithmetic-Haar expressions on quaternion groups
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Improved upper complexity bounds for the discrete Fourier transform
- Fast group-theoretical transform
- Fast Fourier analysis for abelian group extensions
This page was built for publication: Fast Fourier Transforms for Metabelian Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833610)
