Related papers: On the solution of the linear matrix equation $X=A…
This paper studies the solvability, existence of unique solution, closed-form solution and numerical solution of matrix equation $X=Af(X) B+C$ with $f(X) =X^{\mathrm{T}},$ $f(X) =\bar{X}$ and $f(X) =X^{\mathrm{H}},$ where $X$ is the…
This note is concerned with the linear matrix equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. The first part of this paper set forth the necessary and sufficient conditions for the…
We consider the $\top$-Stein equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. In the first part of this paper, we analyze necessary and sufficient conditions for the existence and…
Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…
Many applications in applied mathematics and control theory give rise to the unique solution of a Sylvester-like matrix equation associated with an underlying structured matrix operator $f$. In this paper, we will discuss the solvability of…
Bayesian inference is conceptually elegant, but calculating posterior expectations can entail a heavy computational cost. Monte Carlo methods are reliable and supported by strong asymptotic guarantees, but do not leverage smoothness of the…
This paper is concerned with the positive definite solutions to the matrix equation $X+A^{\mathrm{H}}\bar{X}^{-1}A=I$ where $X$ is the unknown and $A$ is a given complex matrix. By introducing and studying a matrix operator on complex…
Given a full column rank matrix $A \in \mathbb{R}^{m\times n}$ ($m\geq n$), we consider a special class of linear systems of the form $A^\top Ax=A^\top b+c$ with $x, c \in \mathbb{R}^{n}$ and $b \in \mathbb{R}^{m}$. The occurrence of $c$ in…
We describe an efficient quantum algorithm for solving the linear matrix equation AX+XB=C, where A, B, and C are given complex matrices and X is unknown. This is known as the Sylvester equation, a fundamental equation with applications in…
We consider the convolution equation $F*X=B$, where $F\in\mathbb{R}^{3\times 3}$ and $B\in\mathbb{R}^{m\times n}$ are given, and $X\in\mathbb{R}^{m\times n}$ is to be determined. The convolution equation can be regarded as a linear system…
This paper investigates the distributed computation of the well-known linear matrix equation in the form of $AXB = F$, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective.…
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…
This paper deals with necessary and sufficient condition for consistency of the matrix equation $AXB = C$. We will be concerned with the minimal number of free parameters in Penrose's formula $X = A^(1)CB^(1) + Y - A^(1)AYBB^(1)$ for…
We provide necessary and sufficient conditions for the generalized $\star$-Sylvester matrix equation, $AXB + CX^\star D = E$, to have exactly one solution for any right-hand side E. These conditions are given for arbitrary coefficient…
W.E. Roth (1952) proved that the matrix equation $AX-XB=C$ has a solution if and only if the matrices $\left[\begin{matrix}A&C\\0&B\end{matrix}\right]$ and $\left[\begin{matrix}A&0\\0&B\end{matrix}\right]$ are similar. A. Dmytryshyn and B.…
In this article we consider a consistent matrix equation $AXB = C$ when a particular solution $X_{0}$ is given and we represent a new form of the general solution which contains both reproductive and non-reproductive solutions (it depends…
In this paper, several row and column orthogonal projection methods are proposed for solving matrix equation $AXB=C$, where the matrix $A$ and $B$ are full rank or rank deficient and equation is consistent or not. These methods are…
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 presents a finite step method for computing the binary solution to an overdetermined system of linear algebraic equations Ax = b, where A is an m x n real matrix of rank n < m, and b is a real m-vector. The method uses the…
A solution of linear systems of equations Ax=b and Ax=0 is a vital part of many computational packages. This paper presents a novel formulation based on the projective extension of the Euclidean space using the outer product (extended…