Symmetry-based matrix factorization
A symmetry of a given matrix \(M\) is given by a pair \((\phi, \psi)\) of representations of the same group \(G\) such that \[ \phi(g) \cdot M = M \cdot \psi(g), \qquad \forall g \in G. \] This paper studies symmetries, where \(\phi\) and \(\psi\) are restricted to one of the following types of representations: permutations, monomials (also called generalized permutations), and direct sums of (irreducible) permutations. If a matrix \(M\) possesses a nontrivial symmetry of the types above, it is shown how \(M\) can be decomposed into a short product of sparse matrices. This in turn admits the derivation of fast algorithms for performing matrix-vector-multiplications with \(M\). As an application of this general theoretical framework, (known) fast algorithms for discrete Fourier, discrete cosine, Hartley and Haar transforms are derived. Note that a limitation of such an approach is that the obtained algorithm is restricted to a specific matrix \(M\) of fixed dimension. Nevertheless, this framework is certainly useful to gain intuition for constructing more general algorithms which apply to whole classes of matrices, possibly of varying dimensions.
- scientific article; zbMATH DE number 4168848
- A Symmetry Preserving Singular Value Decomposition
- Off-diagonal symmetric nonnegative matrix factorization
- Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- Matrix Symmetrization
- Computing symmetric nonnegative rank factorizations
- Symmetric tensor decomposition
- Multivariate symmetry via projection pursuit
- Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
- A wreath product group approach to signal and image processing. I: Multiresolution analysis
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform
- Algorithms explained by symmetries
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Automatic derivation and implementation of signal processing algorithms
- Automatic generation of fast discrete signal transforms
- Calculation of Fourier transforms on finite Abelian groups (Corresp.)
- Decomposing monomial representations of solvable groups.
- Fast Fourier Transforms on Finite Non-Abelian Groups
- scientific article; zbMATH DE number 3852384 (Why is no real title available?)
- scientific article; zbMATH DE number 3896264 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 47594 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610966 (Why is no real title available?)
- scientific article; zbMATH DE number 3014797 (Why is no real title available?)
- scientific article; zbMATH DE number 3212917 (Why is no real title available?)
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Separation of variables and the computation of Fourier transforms on finite groups, I
- The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
- Factorizing matrices by Dirichlet multiplication
- 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
- scientific article; zbMATH DE number 4168848 (Why is no real title available?)
- Symmetries and beam reduction in the matrix formulation of the dynamical theory of fast electrons
- Algorithms explained by symmetries
- Sparse generalized Fourier transforms
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice
This page was built for publication: Symmetry-based matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597055)
