相关论文: A note on solutions of the matrix equation AXB=C
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose $A$ is an $n \times n$ matrix over $\mathbb{C}$ (resp. $\mathbb{R}$), and let $\mathcal{P}$…
Consider the planar linear switched system $\dot x(t)=u(t)Ax(t)+(1-u(t))Bx(t),$ where $A$ and $B$ are two $2\times2$ real matrices, $x \in \R^2$, and $u(.):[0,\infty[\to\{0,1\}$ is a measurable function. In this paper we consider the…
One well-known necessary and sufficient condition for equality in the Frobenius rank inequality due to Tian and Styan is that the matrix equation B = BCX + YAB be solvable for X and Y. We develop an algorithm to construct the matrices X and…
This paper shows how to solve analytically the three fundamental linear matrix inequalities $$ AXB \succcurlyeq C \, (\succ C), \ \ AXA^*\succcurlyeq B \, (\succ B), \ \ AX +(AX)^{*} \succcurlyeq B \, (\succ B) $$ in the L\"owner partial…
By a generalized inverse of a given matrix, we mean a matrix that exists for a larger class of matrices than the nonsingular matrices, that has some of the properties of the usual inverse, and that agrees with inverse when given matrix…
By focusing on the X-matrix part of a density matrix of two qubits we provide an algebraic lower bound for the concurrence. The lower bound is generalized for cases beyond two qubits and can serve as a sufficient condition for…
This paper is about the rate of convergence of the Markov chain $X_{n+1}=AX_{n}+B_{n}$ (mod $p$), where $A$ is an integer matrix with nonzero eigenvalues and ${B_{n}}_{n}$ is a sequence of independent and identically distributed integer…
In this paper, the consimilarity of complex matrices is generalized for the split quaternions. In this regard, coneigenvalue and coneigenvector are defined for split quaternion matrices. Also, the existence of solution to the split…
For a positive integer $m>1$, if the generalized Markoff equation $a^2+b^2+c^2=3abc+m$ has a solution triple, then it has infinitely many solutions. We show that all positive solution triples are generated by a finite set of triples that we…
We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and…
The Sylvester equation $AX-XB=C$ is considered in the setting of quaternion matrices. Conditions that are necessary and sufficient for the existence of a unique solution are well-known. We study the complementary case where the equation…
In this work we introduce a new and richer class of finite order Markov chain models and address the following model selection problem: find the Markov model with the minimal set of parameters (minimal Markov model) which is necessary to…
The low-rank matrix approximation problem is ubiquitous in computational mathematics. Traditionally, this problem is solved in spectral or Frobenius norms, where the accuracy of the approximation is related to the rate of decrease of the…
We investigate the possible regular solutions of the boundary Yang-Baxter equation for the vertex models associated with the $A_{n-1}^{(1)}$ affine Lie algebra. We have classified them in two classes of solutions. The first class consists…
We investigate the regular solutions of the boundary Yang-Baxter equation for the vertex models associated with the $B_{n}^{(1)}$ and $A_{2n}^{(2)}$ affine Lie algebras. In both class of models we find two general solutions with $n+1$ free…
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…
Following the Perron-Frobenius theorem, the spectral radius of a primitive matrix is a simple eigenvalue. It is shown that for a primitive matrix $A$, there is a positive rank one matrix $X$ such that $B = A \circ X$, where $\circ$ denotes…
There is a recently discovered formulation of the multidimensional consistency integrability condition for lattice equations, called consistency-around-a-face-centered-cube(CAFCC), which is applicable to equations defined on a vertex and…
The tensor rank decomposition problem consists of recovering the unique set of parameters representing a robustly identifiable low-rank tensor when the coordinate representation of the tensor is presented as input. A condition number for…
Integral linear systems $Ax=b$ with matrices $A$, $b$ and solutions $x$ are also required to be in integers, can be solved using invariant factors of $A$ (by computing the Smith Canonical Form of $A$). This paper explores a new problem…