a matrix $pintextmd{c}^{ntimes n}$ is called a generalized reflection matrix if $p^{h}=p$ and $p^{2}=i$‎. ‎an $ntimes n$‎ ‎complex matrix $a$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $p$ if $a=pap$ ($a=-pap$)‎. ‎in this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $axb=c$ and $dxe=f$ over reflexiv...

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

in the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(p,q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} ‎{underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$‎. ‎by this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎when the‎ ‎matrix equation is consistent over...

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

An iterative algorithm is constructed to solve the linear matrix equation pair AXB E, CXD F over generalized reflexive matrix X. When the matrix equation pair AXB E, CXD F is consistent over generalized reflexive matrix X, for any generalized reflexive initial iterative matrix X1, the generalized reflexive solution can be obtained by the iterative algorithm within finite iterative steps in the ...

The general coupled matrix equations (including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations over reflexive matrix solution. When the general coupled matrix equations are consistent over reflexive matrices, the reflex...

We propose an iterative algorithm for solving the reflexive solution of the quaternion matrix equation AXB + CXHD = F. When the matrix equation is consistent over reflexive matrix X, 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 d...

An iterative algorithm is constructed to solve the generalized coupled Sylvester matrix equations AXB − CYD,EXF − GYH M,N , which includes Sylvester and Lyapunov matrix equations as special cases, over generalized reflexive matrices X and Y . When the matrix equations are consistent, for any initial generalized reflexive matrix pair X1, Y1 , the generalized reflexive solutions can be obtained b...

We consider when the quaternion matrix equation AXB+CXD=E has a reflexive (or anti-reflexive) solution with respect to given generalized reflection matrix. adopt real representation method derive solutions it is solvable. Moreover, we obtain explicit expressions of least-squares solutions.

(including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations and their optimal approximation problem over generalized reflexive matrix solution (X1,X2, . . . ,Xq). When the general coupled matrix equations are consistent o...