The reflexive and Hermitian reflexive solutions of the generalized Sylvester-conjugate matrix equation (Q386814): Difference between revisions

The authors define the generalized reflection matrix and the reflexive and Hermitian-reflexive matrix with respect to a generalized reflection matrix. Moreover, in the introduction they give a broad overview of papers that deal with a solution of a linear matrix equation. The particular equation treated in this paper is the generalized Sylvester-conjugate matrix equation \[ A_1X B_1+A_2 \overline{X} B_2+C_1YD_1+ C_2 \overline{Y} D_2 = E, \] where \(A_i,B_i,C_i,E\) are suitable given matrices and \([X,Y]\) is the unknown reflexive or Hermitian reflexive solution pair. The authors present two gradient based iterative methods -- the first algorithm solves the generalized Sylvester-conjugate matrix equation for a reflexive matrix pair, the second one for a Hermitian reflexive matrix pair. They consider the convergence results -- Theorem 2.1. and Theorem 2.2 -- to be the main result of the paper. The very technical proof of Theorem 2.1. is included. Two numerical experiments demonstrate the efficiency of the presented algorithms.