
TL;DR
This paper proves that the tensor product of GLT sequences results in a new GLT sequence with a symbol given by the tensor product of the original symbols, including explicit permutation matrices for the transformation.
Contribution
It establishes that the tensor product of GLT sequences is itself a GLT sequence with a computable symbol, extending the algebraic properties of GLT sequences.
Findings
Tensor product of GLT sequences yields a GLT sequence.
The symbol of the tensor product is the tensor product of individual symbols.
Permutation matrices for the tensor product are explicitly constructed.
Abstract
The theory of generalized locally Toeplitz (GLT) sequences is an apparatus for computing the spectral and singular value distribution of sequences of matrices that possess a (possibly hidden) Toeplitz-like structure. Sequences of this kind, which are known as GLT sequences, arise in several applications, including the discretization of differential and integral equations. Associated with any GLT sequence is a special function called symbol. In this paper, we prove that, if are GLT sequences with symbols , then their tensor (Kronecker) product is a GLT sequence with symbol , up to suitable permutation matrices that only depend on the dimensions of the involved matrices . The permutation matrices in question are explicitly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Coding theory and cryptography · Wireless Communication Networks Research
