The \(\{P, Q, k + 1 \}\)-reflexive solution to system of matrix equations \(A X = C\), \(X B = D\) (Q1665741): Difference between revisions

Summary: Let \(P \in \mathbb{C}^{m \times m}\) and \(Q \in \mathbb{C}^{n \times n}\) be Hermitian and \(\{k + 1 \}\)-potent matrices; that is, \(P^{k + 1} = P = P \ast\) and \(Q^{k + 1} = Q = Q \ast\), where \(\left(\cdot\right) \ast\) stands for the conjugate transpose of a matrix. A matrix \(X \in \mathbb{C}^{m \times n}\) is called \(\{P, Q, k + 1 \}\)-reflexive (antireflexive) if \(P X Q = X(P X Q = - X)\). In this paper, the system of matrix equations \(A X = C\) and \(X B = D\) subject to \(\{P, Q, k + 1 \}\)-reflexive and antireflexive constraints is studied by converting into two simpler cases: \(k = 1\) and \(k = 2 \). We give the solvability conditions and the general solution to this system; in addition, the least squares solution is derived; finally, the associated optimal approximation problem for a given matrix is considered.