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...

let $rin textbf{c}^{mtimes m}$ and $sin textbf{c}^{ntimes n}$ be nontrivial involution matrices; i.e., $r=r^{-1}neq pm~i$ and $s=s^{-1}neq pm~i$. an $mtimes n$ complex matrix $a$ is said to be an $(r, s)$-symmetric ($(r, s)$-skew symmetric) matrix if $ras =a$ ($ ras =-a$). the $(r, s)$-symmetric and $(r, s)$-skew symmetric matrices have a number of special properties and widely used in engi...

A solution of two problems related to the matrix equation of Sylvester type is given. In the first problem, the procedures for linear matrix inequalities are used to construct the solution of this equation. In the second problem, when a matrix is given which is not a solution of this equation, it is required to find such solution of the original equation, which most accurately approximates the ...

in this paper, we derive the necessary and sufficient conditions for the quaternion matrix equation xa=b to have the least-square bisymmetric solution and give the expression of such solution when the solvability conditions are met. futhermore, we consider the maximal and minimal inertias of the least-square bisymmetric solution to this equation. as applications, we derive sufficient and necess...

abstract. the main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. properties of the legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. afterwards, an iterative algorithm is examined for solvin...

In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...

in this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s a_jx_jb_j = e$. this method is based on the global least squares (gl-lsqr) method for solving the linear system of equations with the multiple right hand sides. for applying the gl-lsqr algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are de ned. it is ...