An Iterative algorithm for $\eta$-(anti)-Hermitian least-squares solutions of quaternion matrix equations
Main Article Content
Recently, some research has been devoted to finding the explicit forms of the Î·-Hermitian and Î·-anti-Hermitian solutions of several kinds of quaternion matrix equations and their associated least-squares problems in the literature. Although exploiting iterative algorithms is superior than utilizing the explicit forms in application, hitherto, an iterative approach has not been offered for finding Î·-(anti)-Hermitian solutions of quaternion matrix equations. The current paper deals with applying an efficient iterative manner for determining Î·-Hermitian and Î·-anti-Hermitian least-squares solutions corresponding to the quaternion matrix equation AXB + CY D = E. More precisely, first, this paper establishes some properties of the Î·-Hermitian and Î·-anti-Hermitian matrices. These properties allow for the demonstration of how the well-known conjugate gradient least- squares (CGLS) method can be developed for solving the mentioned problem over the Î·-Hermitian and Î·-anti-Hermitian matrices. In addition, the convergence properties of the proposed algorithm are discussed with details. In the circumstance that the coefficient matrices are ill-conditioned, it is suggested to use a preconditioner for accelerating the convergence behavior of the algorithm. Numerical experiments are reported to reveal the validity of the elaborated results and feasibility of the proposed iterative algorithm and its preconditioned version.