scientific article; zbMATH DE number 610966
zbMATH Open0802.65141MaRDI QIDQ4298259FDOQ4298259
Authors: Ulrich Baum, Michael Clausen 
Publication date: 26 July 1994
Title of this publication is not available (Why is that?)
Recommendations
finite groupssupersolvable groupssymmetric groupsrepresentation theoryfast Fourier transformsAbelian groupslower complexity boundsdiscrete Fourier transformsgroup circulants
Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (47)
- A unified FFT-based approach to maximum assignment problems related to transitive finite group actions
- Fast Approximate Fourier Transforms for Irregularly Spaced Data
- Computational bounds for doing harmonic analysis on permutation modules of finite groups
- Title not available (Why is that?)
- The Fast Fourier Transform
- Parametric versions of the fast Fourier transform
- Applications of the generalized Fourier transform in numerical linear algebra
- Fast Fourier transform of small orders.
- Matrices of finite abelian groups, finite Fourier transform and codes.
- The efficient computation of Fourier transforms on the symmetric group
- Efficient computation of Fourier transforms on compact groups
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- Representation theory of the symmetric group in voting theory and game theory
- Efficient Fourier transforms for transverse momentum dependent distributions
- Fast generalized Fourier transforms
- Implementation of group-covariant positive operator valued measures by orthogonal measurements
- Extensions of irreducible representations
- DFT-based word normalization in finite supersolvable groups.
- Fast Fourier transforms on finite groups as a method in synthesis for regularity
- Generating fast Fourier transforms of solvable groups
- Symmetry-based matrix factorization
- Title not available (Why is that?)
- The Cooley-Tukey FFT and group theory.
- Computing irreducible representations of supersolvable groups over small finite fields
- Fast Fourier Transform (FFT) on GPUs
- A recursive fast Fourier transformation algorithm
- Title not available (Why is that?)
- Conversion of FFT’s to Fast Hartley Transforms
- Title not available (Why is that?)
- Fast Fourier transform: algorithms and applications
- Title not available (Why is that?)
- Random walks on the BMW monoid: an algebraic approach
- Fast Discrete Curvelet Transforms
- Linear time Fourier transforms of \(S_{n-k}\)-invariant functions on the symmetric group \(S_n\)
- Representation theory and invariant neural networks
- Self-Sorting In-Place Fast Fourier Transforms
- Title not available (Why is that?)
- Fast Fourier Transform for Discontinuous Functions
- QUANTUM SOFTWARE REUSABILITY
- Fast computation of real discrete Fourier transform for any number of data points
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
- How much is a quantum controller controlled by the controlled system?
- Fast and approximate computation of Laplace and Fourier transforms
- Decomposing monomial representations of solvable groups.
- Discrete harmonic analysis. Representations, number theory, expanders, and the Fourier transform
- Double coset decompositions and computational harmonic analysis on groups
- Rapid Computation of the Discrete Fourier Transform
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)
