Abstract and Applied Analysis
- Abstr. Appl. Anal.
- Volume 2013 (2013), Article ID 831656, 15 pages.
Iterative Algorithm for Solving a Class of Quaternion Matrix Equation over the Generalized -Reflexive Matrices
The matrix equation which includes some frequently investigated matrix equations as its special cases, plays important roles in the system theory. In this paper, we propose an iterative algorithm for solving the quaternion matrix equation over generalized -reflexive matrices. The proposed iterative algorithm automatically determines the solvability of the quaternion matrix equation over generalized -reflexive matrices. When the matrix equation is consistent over generalized -reflexive matrices, the sequence generated by the introduced algorithm converges to a generalized -reflexive solution of the quaternion matrix equation. And the sequence converges to the least Frobenius norm generalized -reflexive solution of the quaternion matrix equation when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate generalized -reflexive solution for a given generalized -reflexive matrix can be derived. The numerical results indicate that the iterative algorithm is quite efficient.
Abstr. Appl. Anal., Volume 2013 (2013), Article ID 831656, 15 pages.
First available in Project Euclid: 27 February 2014
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Li, Ning; Wang, Qing-Wen. Iterative Algorithm for Solving a Class of Quaternion Matrix Equation over the Generalized $\left(P,Q\right)$ -Reflexive Matrices. Abstr. Appl. Anal. 2013 (2013), Article ID 831656, 15 pages. doi:10.1155/2013/831656. https://projecteuclid.org/euclid.aaa/1393512084