Related papers: A matrix equation $X^n = aI$
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
We compute the PI-exponent of the matrix ring with coefficients in an associative algebra. As a consequence, we prove the following. Let $\mathcal{R}$ be a PI-algebra with a positive PI-exponent. If $M_n(\mathcal{R})$ and $M_m(\mathcal{R})$…
In this paper, a matrix is said to be prime if the row and column of this matrix are both prime numbers. We establish various necessary and sufficient conditions for developing matrices into the sum of tensor products of prime matrices. For…
With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing representation learning techniques that can incorporate known physical…
This paper addresses the numerical solution of the matrix square root problem. Two fixed point iterations are proposed by rearranging the nonlinear matrix equation $A - X^2 = 0$ and incorporating a positive scaling parameter. The proposals…
Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…
We develop a finite-dimensional, symmetric matrix framework associated with the Riemann zeta function for complex arguments s with Real(s) unequal 1/2.
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.
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
We determine sufficient conditions for certain classes of $(n+k) \times n$ matrices $E$ to have all order-$n$ minors to be nonzero. For a special class of $(n+1) \times n$ matrices $E,$ we give the formula for the order-$n$ minors. As an…
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 stability vis a vis adversarial noise of matrix factorization algorithm for matrix completion. In particular, our results include: (I) we bound the gap between the solution matrix of the factorization method and the ground…
We give the first algorithm for Matrix Completion whose running time and sample complexity is polynomial in the rank of the unknown target matrix, linear in the dimension of the matrix, and logarithmic in the condition number of the matrix.…
The Jacobi system on a full-line lattice is considered when it contains additional weight factors. A factorization formula is derived expressing the scattering from such a generalized Jacobi system in terms of the scattering from its…
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…
The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…
A real square matrix $A$ is called a $Q$-matrix if the linear complementarity problem $LCP(A,q)$ has a solution for all $q \in \mathbb{R}^n$. This means that for every vector $q$ there exists a vector $x$ such that $x \geq 0, y=Ax+q\geq 0$…
In this paper we represent a new form of condition for the consistency of the matrix equation AXB=C. If the matrix equation AXB=C is consistent, we determine a form of general solution which contains both reproductive and non-reproductive…
Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n}…
This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…