scientific article; zbMATH DE number 610966
From MaRDI portal
Publication:4298259
Abelian groupsdiscrete Fourier transformsfast Fourier transformsfinite groupsgroup circulantslower complexity boundsrepresentation theorysupersolvable groupssymmetric groups
Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Recommendations
Cited in
(50)- Fast generalized Fourier transforms
- Efficient computation of Fourier transforms on compact groups
- Double coset decompositions and computational harmonic analysis on groups
- DFT-based word normalization in finite supersolvable groups.
- Decomposing monomial representations of solvable groups.
- Representation theory and invariant neural networks
- Extensions of irreducible representations
- 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
- Fast and approximate computation of Laplace and Fourier transforms
- Representation theory of the symmetric group in voting theory and game theory
- Implementation of group-covariant positive operator valued measures by orthogonal measurements
- Computing irreducible representations of supersolvable groups over small finite fields
- scientific article; zbMATH DE number 3858374 (Why is no real title available?)
- Self-Sorting In-Place Fast Fourier Transforms
- scientific article; zbMATH DE number 4149313 (Why is no real title available?)
- scientific article; zbMATH DE number 3970070 (Why is no real title available?)
- Fast computation of real discrete Fourier transform for any number of data points
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- scientific article; zbMATH DE number 1318047 (Why is no real title available?)
- scientific article; zbMATH DE number 494440 (Why is no real title available?)
- A recursive fast Fourier transformation algorithm
- 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 1180015 (Why is no real title available?)
- scientific article; zbMATH DE number 1960289 (Why is no real title available?)
- Fast Fourier transforms on finite groups as a method in synthesis for regularity
- Discrete harmonic analysis. Representations, number theory, expanders, and the Fourier transform
- Conversion of FFT’s to Fast Hartley Transforms
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- Rapid Computation of the Discrete Fourier Transform
- Fast Fourier Transform (FFT) on GPUs
- Fast Fourier Transform for Discontinuous Functions
- Matrices of finite abelian groups, finite Fourier transform and codes.
- Parametric versions of the fast Fourier transform
- The Cooley-Tukey FFT and group theory.
- The Fast Fourier Transform
- Fast Fourier transform of small orders.
- QUANTUM SOFTWARE REUSABILITY
- Fast Discrete Curvelet Transforms
- Generating fast Fourier transforms of solvable groups
- Symmetry-based matrix factorization
- Efficient Fourier transforms for transverse momentum dependent distributions
- Fast generalized DFTs for all finite groups
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- How much is a quantum controller controlled by the controlled system?
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
- Fast Fourier transform: algorithms and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4298259)
