Efficient computation of Fourier transforms on compact groups
From MaRDI portal
Publication:1271501
DOI10.1007/BF02475926zbMath0914.43004MaRDI QIDQ1271501
Publication date: 9 May 1999
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/59551
Fourier transformhomogeneous spacesirreducible unitary representationsclassical groupscompact Lie groupsGel'fand-Tsetlin bases
Numerical methods for discrete and fast Fourier transforms (65T50) General harmonic expansions, frames (42C15) Compact groups (22C05) Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups, etc. (43A30) Software, source code, etc. for problems pertaining to abstract harmonic analysis (43-04)
Related Items
An algebraic approach to multiresolution analysis, Sampling theorem and discrete Fourier transform on the Riemann sphere, Sampling theorem and discrete Fourier transform on the hyperboloid, FFTs on the rotation group, The efficient computation of Fourier transforms on the symmetric group, Nonlinear approximation theory on compact groups, Growth in free groups (and other stories) -- twelve years later, Spectral concentration of positive functions on compact groups, Double coset decompositions and computational harmonic analysis on groups, Uncertainty Propagation for General Stochastic Hybrid Systems on Compact Lie Groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Fast Fourier analysis for abelian group extensions
- Fast generalized Fourier transforms
- The complexity of group algebra computations
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Efficient Computation of the Fourier Transform on Finite Groups
- Fast Fourier Transforms on Finite Non-Abelian Groups
- On the algebraic structure of certain partially observable finite-state Markov processes
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Separation of variables and the computation of Fourier transforms on finite groups, I