Fast generalized Fourier transforms
From MaRDI portal
Computational complexity of the fast generalized Fourier transforms is discussed on the basis of the Wedderburn's structure theorem. In the sequel, the upper bound of the linear complexity is confidently estimated.
Recommendations
- scientific article; zbMATH DE number 610966
- scientific article; zbMATH DE number 4037044
- scientific article; zbMATH DE number 3894433
- Fast and precise Fourier transforms
- The techniques of the generalized fast Fourier transform algorithm
- Fast computation of partial Fourier transforms
- The fast generalized Gauss transform
- Fast Fourier transform revisited
- scientific article; zbMATH DE number 1134974
- scientific article; zbMATH DE number 4056957
Cites work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Endliche Gruppen I
- Fast Fourier Transforms for Metabelian Groups
- Fast Fourier Transforms on Finite Non-Abelian Groups
- scientific article; zbMATH DE number 4014644 (Why is no real title available?)
- scientific article; zbMATH DE number 3852384 (Why is no real title available?)
- scientific article; zbMATH DE number 3967873 (Why is no real title available?)
- scientific article; zbMATH DE number 4023201 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
- On computing the Discrete Fourier Transform
- On the computational complexity of the general discrete Fourier transform
- The complexity of group algebra computations
- Young's semi-normal representation of the symmetric group
Cited in
(37)- Efficient computation of Fourier transforms on compact groups
- Fourier transforms with respect to monomial representations
- Double coset decompositions and computational harmonic analysis on groups
- Separation of variables and the computation of Fourier transforms on finite groups. II
- The efficient computation of Fourier transforms on semisimple algebras
- Canonical bases for cyclotomic fields
- Computational bounds for doing harmonic analysis on permutation modules of finite groups
- Random walks on the BMW monoid: an algebraic approach
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Applications of the generalized Fourier transform in numerical linear algebra
- Quantum Fourier transform over symmetric groups -- improved result
- Quantum algorithms for algebraic problems
- Efficient Computation of the Fourier Transform on Finite Groups
- scientific article; zbMATH DE number 3982402 (Why is no real title available?)
- scientific article; zbMATH DE number 4037044 (Why is no real title available?)
- scientific article; zbMATH DE number 4056957 (Why is no real title available?)
- Fast Fourier Transforms for Symmetric Groups: Theory and Implementation
- Computing Irreducible Representations of Supersolvable Groups
- scientific article; zbMATH DE number 1134974 (Why is no real title available?)
- The efficient computation of Fourier transforms on the symmetric group
- scientific article; zbMATH DE number 1960289 (Why is no real title available?)
- Fast structured Jacobi-Jacobi transforms
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
- Parametric versions of the fast Fourier transform
- Fast Fourier transform of small orders.
- Fast Gauss transforms with complex parameters using NFFTs
- Fast reverse jacket transform as an alternative representation of the N-point fast Fourier transform
- Generating fast Fourier transforms of solvable groups
- Computing generalized convolutions faster than brute force
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Fast generalized DFTs for all finite groups
- Computing generalized convolutions faster than brute force
- Computing Fourier transforms and convolutions of \(S_{n - 1}\)-invariant signals on \(S_n\) in time linear in \(n\)
- Improved upper complexity bounds for the discrete Fourier transform
- Fast Fourier analysis for abelian group extensions
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
This page was built for publication: Fast generalized Fourier transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123578)
