Symmetry-based matrix factorization
From MaRDI portal
Publication:597055
DOI10.1016/j.jsc.2002.06.005zbMath1053.65030MaRDI QIDQ597055
Sebastian Egner, Markus Püschel
Publication date: 6 August 2004
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2002.06.005
fast algorithms; discrete Fourier transform; discrete cosine transform; discrete Hartley transform; matrix factorization; discrete Haar transform; matrix-vector-multiplications; product of sparse matrices
Related Items
Sparse generalized Fourier transforms, Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice, Applications of the generalized Fourier transform in numerical linear algebra, Implementation of group-covariant positive operator valued measures by orthogonal measurements, Minimally disturbing Heisenberg–Weyl symmetric measurements using hard-core collisions of Schrödinger particles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Decomposing monomial representations of solvable groups.
- A wreath product group approach to signal and image processing .I. Multiresolution analysis
- Fast Fourier Transforms on Finite Non-Abelian Groups
- The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
- Algorithms explained by symmetries
- Automatic derivation and implementation of signal processing algorithms
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Automatic generation of fast discrete signal transforms
- Calculation of Fourier transforms on finite Abelian groups (Corresp.)
- Separation of variables and the computation of Fourier transforms on finite groups, I
