Related papers: On the Sylvester matrix equation over quaternions
The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero…
In this paper, we prove a conjecture which was presented in a recent paper [Linear Algebra Appl. 2016; 496: 549--593]. We derive some practical necessary and sufficient conditions for the existence of a solution to a system of coupled…
In this paper, we derive some necessary and sufficient solvability conditions for some systems of one sided coupled Sylvester-type real quaternion matrix equations in terms of ranks and generalized inverses of matrices. We also give the…
Sylvester equations $AX-XB=C$ have unique solutions for all $C$ when the spectra of $A$ and $B$ are disjoint. Here $A$ and $B$ are bounded operators in Banach spaces. We discuss the existence of polynomials $p$ such that the spectra of…
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…
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…
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…
We derive the solvability conditions and a formula of a general solution to a Sylvester-type matrix equation over Hamilton quaternions. As an application, we investigate the necessary and sufficient conditions for the solvability of the…
We derive necessary and sufficient conditions for the existence of the exact solution to the Sylvester-type quaternion tensor system $ \mathcal{A}_i\ast_{N}\mathcal{X}_i+ \mathcal{Y}_i\ast_{M}\mathcal{B}_i+\mathcal{C}_i\ast_{N}…
Sylvester-type matrix equations have applications in areas including control theory, neural networks, and image processing. In this paper, we establish the necessary and sufficient conditions for the system of Sylvester-type quaternion…
It is known that the solvability of a Sylvester equation over max-plus algebra can be determined in polynomial time by verifying its principal solution. A succinct representation of the principal solution is presented, with a more accurate…
In this paper, we provide some solvability conditions in terms of ranks for the existence of a general solution to a system of $k$ Sylvester-type quaternion matrix equations with $3k+1$ variables…
We give a new elementary proof of existence and uniqueness of a solution to the Sylvester equation $AX-XB=Y$
In this paper, we give the complete structures of the equivalence canonical form of four matrices over an arbitrary division ring. As applications, we derive some practical necessary and sufficient conditions for the solvability to some…
This paper investigates the necessary and sufficient algebraic conditions to a constrained system of Sylvester-type quaternion tensor equations. An explicit formula of the general solution regarding the Moore-Penrose inverses of some block…
The quaternion equation X^n=A is solved for any integer number n > 1. A is a given quaternion with komplex numbers as its elements. We use the isomorphism between quaternions and (4,4)-matrices to solve this equation.
We employ the M-P inverses and ranks of quaternion matrices to establish the necessary and sufficient conditions for solving a system of the dual quaternion matrix equations $(AX, XC) = (B, D)$, along with providing an expression for its…
Within the framework of the theory of quaternion column-row determinants and using determinantal representations of the Moore-Penrose inverse previously obtained by the author, we get explicit determinantal representation formulas of…
The T-congruence Sylvester equation is the matrix equation $AX+X^{\mathrm{T}}B=C$, where $A\in\mathbb{R}^{m\times n}$, $B\in\mathbb{R}^{n\times m}$, and $C\in\mathbb{R}^{m\times m}$ are given, and $X\in\mathbb{R}^{n\times m}$ is to be…
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…