?
Two efficient algorithms for the commutative quaternion equality constrained least squares problem
With the development of the applied discipline of commutative quaternions, the commutative quaternion equality constrained least squares (CQLSE) problem is gaining more and more attention as an effective tool. However, the knowledge gap in numerous CQLSE problems is now unresolved. This paper, by means of the complex representation matrix of a commutative quaternion matrix, first studies the QR decomposition and generalized singular value decomposition (GSVD) of commutative quaternion matrices, and gives the corresponding theorems and algorithms. In addition, the algorithms for solving the CQLSE problem based on QR decomposition and GSVD of commutative quaternion matrices are given in this paper. Finally, numerical experiments show the effectiveness of the algorithms proposed in this paper.