Related papers: Kronecker Square Roots and The Block vec Matrix
We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict $k$-Hessenberg matrices and banded matrices.…
In this paper we apply a method of Robinson and Taulbee for computing Kronecker coefficients together with other ingredients and show that the multiplicity of each component in a Kronecker square can be obtained from an evaluation of a…
Hypergraphs and tensors extend classic graph and matrix theory to account for multiway relationships, which are ubiquitous in engineering, biological, and social systems. While the Kronecker product is a potent tool for analyzing the…
A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full…
We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…
This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…
The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that…
The problem of matrix factorization motivated by diffraction or elasticity is studied. A powerful tool for analyzing its solutions is introduced, namely analytical continuation formulae are derived. Necessary condition for commutative…
In this article, we evaluate determinants of block hook matrices, which are block matrices consist of hook matrices. In particular, we deduce that the determinant of a block hook matrix factorizes nicely. In addition we give a combinatorial…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
Kronecker products of unitary Fourier matrices play important role in solving multilevel circulant systems by a multidimensional Fast Fourier Transform. They are also special cases of complex Hadamard (Zeilinger) matrices arising in many…
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…
Translated into the language of representations of quivers, a challenge in matrix pencil theory is to find sufficient and necessary conditions for a Kronecker representation to be a subfactor of another Kronecker representation in terms of…
Superregular matrices, i.e., matrices where all square submatrices are non-singular, have a wide range of applications in communications. A superregular block matrix is a broader concept where all full block submatrices, with the…
We consider the canonical Wiener-Hopf factorisation of $2 \times 2$ symmetric matrices $\mathcal M$ with respect to a contour $\Gamma$. For the case that the quotient $q$ of the two diagonal elements of $\mathcal M$ is a rational function,…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…
We establish necessary and sufficient conditions for the existence of an LU factorization $A=LU$ for an arbitrary square matrix $A$, including singular and rank-deficient cases, without the use of row or column permutations. We prove that…