The matrix nearness problem associated with the quaternion matrix equation AXA H +BYB H =C

2010 ◽  
Vol 37 (1-2) ◽  
pp. 133-144 ◽  
Author(s):  
Shifang Yuan ◽  
Anping Liao ◽  
Guozhu Yao
2019 ◽  
Vol 2019 ◽  
pp. 1-8 ◽  
Author(s):  
Xin Liu ◽  
Huajun Huang ◽  
Zhuo-Heng He

For a quaternion matrix A, we denote by Aϕ the matrix obtained by applying ϕ entrywise to the transposed matrix AT, where ϕ is a nonstandard involution of quaternions. A is said to be ϕ-Hermitian or ϕ-skew-Hermitian if A=Aϕ or A=−Aϕ, respectively. In this paper, we give a complete characterization of the nonstandard involutions ϕ of quaternions and their conjugacy properties; then we establish a new real representation of a quaternion matrix. Based on this, we derive some necessary and sufficient conditions for the existence of a ϕ-Hermitian solution or ϕ-skew-Hermitian solution to the quaternion matrix equation AX=B. Moreover, we give solutions of the quaternion equation when it is solvable.


2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Ning Li ◽  
Qing-Wen Wang

The matrix equation∑l=1uAlXBl+∑s=1vCsXTDs=F,which includes some frequently investigated matrix equations as its special cases, plays important roles in the system theory. In this paper, we propose an iterative algorithm for solving the quaternion matrix equation∑l=1uAlXBl+∑s=1vCsXTDs=Fover generalized(P,Q)-reflexive matrices. The proposed iterative algorithm automatically determines the solvability of the quaternion matrix equation over generalized(P,Q)-reflexive matrices. When the matrix equation is consistent over generalized(P,Q)-reflexive matrices, the sequence{X(k)}generated by the introduced algorithm converges to a generalized(P,Q)-reflexive solution of the quaternion matrix equation. And the sequence{X(k)}converges to the least Frobenius norm generalized(P,Q)-reflexive solution of the quaternion matrix equation when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate generalized(P,Q)-reflexive solution for a given generalized(P,Q)-reflexive matrixX0can be derived. The numerical results indicate that the iterative algorithm is quite efficient.


2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
Ning Li ◽  
Qing-Wen Wang ◽  
Jing Jiang

We propose an iterative algorithm for solving the reflexive solution of the quaternion matrix equationAXB+CXHD=F. When the matrix equation is consistent over reflexive matrixX, a reflexive solution can be obtained within finite iteration steps in the absence of roundoff errors. By the proposed iterative algorithm, the least Frobenius norm reflexive solution of the matrix equation can be derived when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate reflexive solution to a given reflexive matrixX0can be derived by finding the least Frobenius norm reflexive solution of a new corresponding quaternion matrix equation. Finally, two numerical examples are given to illustrate the efficiency of the proposed methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Caiqin Song ◽  
Jun-e Feng ◽  
Xiaodong Wang ◽  
Jianli Zhao

A new approach is presented for obtaining the solutions to Yakubovich-j-conjugate quaternion matrix equationX−AX^B=CYbased on the real representation of a quaternion matrix. Compared to the existing results, there are no requirements on the coefficient matrixA. The closed form solution is established and the equivalent form of solution is given for this Yakubovich-j-conjugate quaternion matrix equation. Moreover, the existence of solution to complex conjugate matrix equationX−AX¯B=CYis also characterized and the solution is derived in an explicit form by means of real representation of a complex matrix. Actually, Yakubovich-conjugate matrix equation over complex field is a special case of Yakubovich-j-conjugate quaternion matrix equationX−AX^B=CY. Numerical example shows the effectiveness of the proposed results.


2020 ◽  
Vol 43 (15) ◽  
pp. 8506-8517
Author(s):  
Cui'e Yu ◽  
Xin Liu ◽  
Yang Zhang

2012 ◽  
Vol 19 (01) ◽  
pp. 175-180 ◽  
Author(s):  
Lianggui Feng ◽  
Wei Cheng

We give a clear description of the solution set to the quaternion matrix equation [Formula: see text], where A, B are known, X is unknown and [Formula: see text] denotes the usual conjugate of X.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Shi-Fang Yuan

Using the Kronecker product of matrices, the Moore-Penrose generalized inverse, and the complex representation of quaternion matrices, we derive the expressions of least squares solution with the least norm, least squares pure imaginary solution with the least norm, and least squares real solution with the least norm of the quaternion matrix equationAXB+CXD=E, respectively.


2014 ◽  
Vol 21 (03) ◽  
pp. 449-460 ◽  
Author(s):  
Yubao Bao

In this paper, we give the expression of the least square solution of the linear quaternion matrix equation AXB=C subject to a consistent system of quaternion matrix equations D1X=F1, XE2=F2, and derive the maximal and minimal ranks and the least-norm of the above mentioned solution. The finding of this paper extends some known results in the literature.


Sign in / Sign up

Export Citation Format

Share Document