Three special kinds of least squares solutions for the quaternion generalized Sylvester matrix equation

<abstract><p>In this paper, we propose an efficient method for some special solutions of the quaternion matrix equation $ AXB+CYD = E $. By integrating real representation of a quaternion matrix with $ \mathcal{H} $-representation, we investigate the minimal norm least squares solution of the previous quaternion matrix equation over different constrained matrices and obtain their expressions. In this way, we first apply $ \mathcal{H} $-representation to solve quaternion matrix equation with special structure, which not only broadens the application scope of $ \mathcal{H} $-representation, but further expands the research idea of solving quaternion matrix equation. The algorithms only include real operations. Consequently, it is very simple and convenient, and it can be applied to all kinds of quaternion matrix equation with similar problems. The numerical example is provided to illustrate the feasibility of our algorithms.</p></abstract>

The least squares Bisymmetric solution of quaternion matrix equation $ AXB = C $

<abstract><p>In this paper, the idea of partitioning is used to solve quaternion least squares problem, we divide the quaternion Bisymmetric matrix into four blocks and study the relationship between the block matrices. Applying this relation, the real representation of quaternion, and M-P inverse, we obtain the least squares Bisymmetric solution of quaternion matrix equation $ AXB = C $ and its compatable conditions. Finally, we verify the effectiveness of the method through numerical examples.</p></abstract>