Related papers: Factorizations into Normal Matrices in Indefinite …
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
We propose a specific class of matrices which participate in factorization problems that turn to be equivalent to constant and entwining (non-constant) pentagon, reverse-pentagon or Yang-Baxter maps, expressed in non-commutative variables.…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
This paper establishes that every positive-definite matrix can be written as a positive linear combination of outer products of integer-valued vectors whose entries are bounded by the geometric mean of the condition number and the dimension…
A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…
Finite dimensional linear spaces (both complex and real) with indefinite scalar product [.,.] are considered. Upper and lower bounds are given for the size of an indecomposable matrix that is normal with respect to this scalar product in…
Positive-definite matrices materialize as state transition matrices of linear time-invariant gradient flows, and the composition of such materializes as the state transition after successive steps where the driving potential is suitably…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k =…
We identify and analyse obstructions to factorisation of integer matrices into products $N^T N$ or $N^2$ of matrices with rational or integer entries. The obstructions arise as quadratic forms with integer coefficients and raise the…
We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…
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,…
In factoring matrices into the product of two matrices operations are typically performed with elements restricted to matrix subspaces. Such modest structural assumptions are realistic, for example, in large scale computations. This paper…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
A square matrix is nonderogatory if its Jordan blocks have distinct eigenvalues. We give canonical forms (i) for nonderogatory complex matrices up to unitary similarity and (ii) for pairs of complex matrices up to similarity, in which one…
Nonunique factorization in commutative monoids is often studied using factorization invariants, which assign to each monoid element a quantity determined by the factorization structure. For numerical monoids (co-finite, additive submonoids…
We study regular inclusions of finite-dimensional von Neumann algebras from a matrix-theoretic perspective. To this end, we introduce a new combinatorial invariant of an inclusion, called the normalizer matrix, which encodes the structure…
We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.