Journal of Applied Mathematics

Volume 2013 (2013), Article ID 217540, 14 pages

http://dx.doi.org/10.1155/2013/217540

Research Article

An Efficient Algorithm for the Reflexive Solution of the Quaternion Matrix Equation

Ning Li,1,2 Qing-Wen Wang,¹ and Jing Jiang³

¹Department of Mathematics, Shanghai University, Shanghai 200444, China

²School of Mathematics and Quantitative Economics, Shandong University of Finance and Economics, Jinan 250002, China

³Department of Mathematics, Qilu Normal University, Jinan 250013, China

Received 3 October 2012; Accepted 4 December 2012

Academic Editor: P. N. Shivakumar

Copyright © 2013 Ning Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

We propose an iterative algorithm for solving the reflexive solution of the quaternion matrix equation . When the matrix equation is consistent over reflexive matrix , a reflexive solution can be obtained within finite iteration steps in the absence of roundoff errors. By the proposed iterative algorithm, the least Frobenius norm reflexive solution of the matrix equation can be derived when an appropriate initial iterative matrix is chosen. Furthermore, the optimal approximate reflexive solution to a given reflexive matrix can be derived by finding the least Frobenius norm reflexive solution of a new corresponding quaternion matrix equation. Finally, two numerical examples are given to illustrate the efficiency of the proposed methods.

1. Introduction

Throughout the paper, the notations and represent the set of all real matrices and the set of all matrices over the quaternion algebra . We denote the identity matrix with the appropriate size by . We denote the conjugate transpose, the transpose, the conjugate, the trace, the column space, the real part, the vector formed by the vertical concatenation of the respective columns of a matrix by , respectively. The Frobenius norm of is denoted by , that is, . Moreover, and stand for the Kronecker matrix product and Hadmard matrix product of the matrices and .

Let be a generalized reflection matrix, that is, and . A matrix is called reflexive with respect to the generalized reflection matrix , if . It is obvious that any matrix is reflexive with respect to . Let denote the set of order reflexive matrices with respect to . The reflexive matrices with respect to a generalized reflection matrix have been widely used in engineering and scientific computations [1, 2].

In the field of matrix algebra, quaternion matrix equations have received much attention. Wang et al. [3] gave necessary and sufficient conditions for the existence and the representations of P-symmetric and P-skew-symmetric solutions of quaternion matrix equations and . Yuan and Wang [4] derived the expressions of the least squares -Hermitian solution with the least norm and the expressions of the least squares anti--Hermitian solution with the least norm for the quaternion matrix equation . Jiang and Wei [5] derived the explicit solution of the quaternion matrix equation . Li and Wu [6] gave the expressions of symmetric and skew-antisymmetric solutions of the quaternion matrix equations and . Feng and Cheng [7] gave a clear description of the solution set of the quaternion matrix equation .

The iterative method is a very important method to solve matrix equations. Peng [8] constructed a finite iteration method to solve the least squares symmetric solutions of linear matrix equation . Also Peng [9–11] presented several efficient iteration methods to solve the constrained least squares solutions of linear matrix equations and , by using Paige’s algorithm [12] as the frame method. Duan et al. [13–17] proposed iterative algorithms for the (Hermitian) positive definite solutions of some nonlinear matrix equations. Ding et al. proposed the hierarchical gradient-based iterative algorithms [18] and hierarchical least squares iterative algorithms [19] for solving general (coupled) matrix equations, based on the hierarchical identification principle [20]. Wang et al. [21] proposed an iterative method for the least squares minimum-norm symmetric solution of . Dehghan and Hajarian constructed finite iterative algorithms to solve several linear matrix equations over (anti)reflexive [22–24], generalized centrosymmetric [25, 26], and generalized bisymmetric [27, 28] matrices. Recently, Wu et al. [29–31] proposed iterative algorithms for solving various complex matrix equations.

However, to the best of our knowledge, there has been little information on iterative methods for finding a solution of a quaternion matrix equation. Due to the noncommutative multiplication of quaternions, the study of quaternion matrix equations is more complex than that of real and complex equations. Motivated by the work mentioned above and keeping the interests and wide applications of quaternion matrices in view (e.g., [32–45]), we, in this paper, consider an iterative algorithm for the following two problems.

Problem 1. For given matrices and the generalized reflection matrix , find , such that

Problem 2. When Problem 1 is consistent, let its solution set be denoted by . For a given reflexive matrix , find , such that

The remainder of this paper is organized as follows. In Section 2, we give some preliminaries. In Section 3, we introduce an iterative algorithm for solving Problem 1. Then we prove that the given algorithm can be used to obtain a reflexive solution for any initial matrix within finite steps in the absence of roundoff errors. Also we prove that the least Frobenius norm reflexive solution can be obtained by choosing a special kind of initial matrix. In addition, the optimal reflexive solution of Problem 2 by finding the least Frobenius norm reflexive solution of a new matrix equation is given. In Section 4, we give two numerical examples to illustrate our results. In Section 5, we give some conclusions to end this paper.

2. Preliminary

In this section, we provide some results which will play important roles in this paper. First, we give a real inner product for the space over the real field .

Theorem 3. In the space over the field , a real inner product can be defined as

for . This real inner product space is denoted as .

Proof. (1) For , let , then

It is obvious that and .

(2) For , let and , then we have

(3) For

(4) For and ,

All the above arguments reveal that the space over field with the inner product defined in (3) is an inner product space.

Let represent the matrix norm induced by the inner product . For an arbitrary quaternion matrix , it is obvious that the following equalities hold:

which reveals that the induced matrix norm is exactly the Frobenius norm. For convenience, we still use to denote the induced matrix norm.

Let denote the quaternion matrix whose entry is 1, and the other elements are zeros. In inner product space , it is easy to verify that , , , is an orthonormal basis, which reveals that the dimension of the inner product space is .

Next, we introduce a real representation of a quaternion matrix.

For an arbitrary quaternion matrix , a map , from to , can be defined as

Lemma 4 (see [41]). Let and be two arbitrary quaternion matrices with appropriate size. The map defined by (9) satisfies the following properties.

(a). (b).(c). (d), where

By (9), it is easy to verify that

Finally, we introduce the commutation matrix.

A commutation matrix is a matrix which has the following explicit form:

Moreover, is a permutation matrix and . We have the following lemmas on the commutation matrix.

Lemma 5 (see [46]). Let be a matrix. There is a commutation matrix such that

Lemma 6 (see [46]). Let be a matrix and a matrix. There exist two commutation matrices and such that

3. Main Results

3.1. The Solution of Problem 1

In this subsection, we will construct an algorithm for solving Problem 1. Then some lemmas will be given to analyse the properties of the proposed algorithm. Using these lemmas, we prove that the proposed algorithm is convergent.

Algorithm 7 (Iterative algorithm for Problem 1).

(1)Choose an initial matrix .(2)Calculate

(3)If , then stop and is the solution of Problem 1; else if and , then stop and Problem 1 is not consistent; else .(4)Calculate

(5)Go to Step (3).

Lemma 8. Assume that the sequences and are generated by Algorithm 7, then and  for .

Proof. Since and for , we only need to prove that and for .

Now we prove this conclusion by induction.

Step 1. We show that

We also prove (17) by induction. When , we have

Also we can write

Now assume that conclusion (17) holds for , then

And it can also be obtained that

Therefore, the conclusion (17) holds for .

Step 2. Assume that and for and . We will show that

We prove the conclusion (22) in two substeps.

Substep 2.1. In this substep, we show that

It follows from Algorithm 7 that

Also we can write

Substep 2.2. In this substep, we prove the conclusion (22) in Step 2. It follows from Algorithm 7 that

Repeating the above process (26), we can obtain

Combining these two relations with (24) and (25), it implies that (22) holds. So, by the principle of induction, we know that Lemma 8 holds.

Lemma 9. Assume that Problem 1 is consistent, and let be its solution. Then, for any initial matrix , the sequences , , and generated by Algorithm 7 satisfy

Proof. We also prove this conclusion by induction.

When , it follows from Algorithm 7 that

This implies that (28) holds for .

Now it is assumed that (28) holds for , that is

Then, when

Therefore, Lemma 9 holds by the principle of induction.

From the above two lemmas, we have the following conclusions.

Remark 10. If there exists a positive number such that and , then we can get from Lemma 9 that Problem 1 is not consistent. Hence, the solvability of Problem 1 can be determined by Algorithm 7 automatically in the absence of roundoff errors.

Theorem 11. Suppose that Problem 1 is consistent. Then for any initial matrix , a solution of Problem 1 can be obtained within finite iteration steps in the absence of roundoff errors.

Proof. In Section 2, it is known that the inner product space is -dimensional. According to Lemma 9, if ,  , then we have . Hence and can be computed. From Lemma 8, it is not difficult to get

Then is an orthogonal basis of the inner product space . In addition, we can get from Lemma 8 that

It follows that , which implies that is a solution of Problem 1.

3.2. The Solution of Problem 2

In this subsection, firstly we introduce some lemmas. Then, we will prove that the least Frobenius norm reflexive solution of (1) can be derived by choosing a suitable initial iterative matrix. Finally, we solve Problem 2 by finding the least Frobenius norm reflexive solution of a new-constructed quaternion matrix equation.

Lemma 12 (see [47]). Assume that the consistent system of linear equations has a solution then is the unique least Frobenius norm solution of the system of linear equations.

Lemma 13. Problem 1 is consistent if and only if the system of quaternion matrix equations

is consistent. Furthermore, if the solution sets of Problem 1 and (34) are denoted by and , respectively, then, we have .

Proof. First, we assume that Problem 1 has a solution . By and , we can obtain and , which implies that is a solution of quaternion matrix equations (34), and .

Conversely, suppose (34) is consistent. Let be a solution of (34). Set . It is obvious that . Now we can write

Hence is a solution of Problem 1. The proof is completed.

Lemma 14. The system of quaternion matrix equations (34) is consistent if and only if the system of real matrix equations

is consistent, where , are submatrices of the unknown matrix. Furthermore, if the solution sets of (34) and (36) are denoted by and , respectively, then, we have .

Proof. Suppose that (34) has a solution

Applying , , and in Lemma 4 to (34) yields

which implies that is a solution of (36) and . Conversely, suppose that (36) has a solution

By in Lemma 4, we have that

Hence

which implies that , and are also solutions of (36). Thus,

is also a solution of (36), where

Let

Then it is not difficult to verify that

We have that is a solution of (34) by in Lemma 4. The proof is completed.

Lemma 15. There exists a permutation matrix P(4n,4n) such that (36) is equivalent to

Lemma 15 is easily proven through Lemma 5. So we omit it here.

Theorem 16. When Problem 1 is consistent, let its solution set be denoted by . If , and can be expressed as

then, is the least Frobenius norm solution of Problem 1.

Proof. By ,  , and in Lemmas 4, 5, and 6, we have that

By Lemma 12, is the least Frobenius norm solution of matrix equations (46).

Noting (11), we derive from Lemmas 13, 14, and 15 that is the least Frobenius norm solution of Problem 1.

From Algorithm 7, it is obvious that, if we consider

then all generated by Algorithm 7 can be expressed as

Using the above conclusion and considering Theorem 16, we propose the following theorem.

Theorem 17. Suppose that Problem 1 is consistent. Let the initial iteration matrix be

where is an arbitrary quaternion matrix, or especially, , then the solution , generated by Algorithm 7, is the least Frobenius norm solution of Problem 1.

Now we study Problem 2. When Problem 1 is consistent, the solution set of Problem 1 denoted by is not empty. Then, For a given reflexive matrix ,

Let and , then Problem 2 is equivalent to finding the least Frobenius norm reflexive solution of the quaternion matrix equation

By using Algorithm 7, let the initial iteration matrix , where is an arbitrary quaternion matrix in , or especially, , we can obtain the least Frobenius norm reflexive solution of (53). Then we can obtain the solution of Problem 2, which is

4. Examples

In this section, we give two examples to illustrate the efficiency of the theoretical results.

Example 18. Consider the quaternion matrix equation

with

We apply Algorithm 7 to find the reflexive solution with respect to the generalized reflection matrix.

For the initial matrix , we obtain a solution, that is

with corresponding residual . The convergence curve for the Frobenius norm of the residuals is given in Figure 1, where .

Figure 1: The convergence curve for the Frobenius norm of the residuals from Example 18.

Example 19. In this example, we choose the matrices , and as same as in Example 18. Let

In order to find the optimal approximation reflexive solution to the given matrix , let and . Now we can obtain the least Frobenius norm reflexive solution of the quaternion matrix equation , by choosing the initial matrix , that is

with corresponding residual . The convergence curve for the Frobenius norm of the residuals is given in Figure 2, where .

Therefore, the optimal approximation reflexive solution to the given matrix is

The results show that Algorithm 7 is quite efficient.

Figure 2: The convergence curve for the Frobenius norm of the residuals from Example 19.

5. Conclusions

In this paper, an algorithm has been presented for solving the reflexive solution of the quaternion matrix equation . By this algorithm, the solvability of the problem can be determined automatically. Also, when the quaternion matrix equation is consistent over reflexive matrix , for any reflexive initial iterative matrix, a reflexive solution can be obtained within finite iteration steps in the absence of roundoff errors. It has been proven that by choosing a suitable initial iterative matrix, we can derive the least Frobenius norm reflexive solution of the quaternion matrix equation through Algorithm 7. Furthermore, by using Algorithm 7, we solved Problem 2. Finally, two numerical examples were given to show the efficiency of the presented algorithm.

Acknowledgments

This research was supported by Grants from Innovation Program of Shanghai Municipal Education Commission (13ZZ080), the National Natural Science Foundation of China (11171205), the Natural Science Foundation of Shanghai (11ZR1412500), the Discipline Project at the corresponding level of Shanghai (A. 13-0101-12-005), and Shanghai Leading Academic Discipline Project (J50101).

References

H. C. Chen and A. H. Sameh, “A matrix decomposition method for orthotropic elasticity problems,” SIAM Journal on Matrix Analysis and Applications, vol. 10, no. 1, pp. 39–64, 1989.

H. C. Chen, “Generalized reflexive matrices: special properties and applications,” SIAM Journal on Matrix Analysis and Applications, vol. 19, no. 1, pp. 140–153, 1998.

Q. W. Wang, H. X. Chang, and C. Y. Lin, “-(skew)symmetric common solutions to a pair of quaternion matrix equations,” Applied Mathematics and Computation, vol. 195, no. 2, pp. 721–732, 2008.

S. F. Yuan and Q. W. Wang, “Two special kinds of least squares solutions for the quaternion matrix equation ,” Electronic Journal of Linear Algebra, vol. 23, pp. 257–274, 2012.

T. S. Jiang and M. S. Wei, “On a solution of the quaternion matrix equation and its application,” Acta Mathematica Sinica (English Series), vol. 21, no. 3, pp. 483–490, 2005.

Y. T. Li and W. J. Wu, “Symmetric and skew-antisymmetric solutions to systems of real quaternion matrix equations,” Computers & Mathematics with Applications, vol. 55, no. 6, pp. 1142–1147, 2008.

L. G. Feng and W. Cheng, “The solution set to the quaternion matrix equation ,” Algebra Colloquium, vol. 19, no. 1, pp. 175–180, 2012.

Z. Y. Peng, “An iterative method for the least squares symmetric solution of the linear matrix equation ,” Applied Mathematics and Computation, vol. 170, no. 1, pp. 711–723, 2005.

Z. Y. Peng, “A matrix LSQR iterative method to solve matrix equation ,” International Journal of Computer Mathematics, vol. 87, no. 8, pp. 1820–1830, 2010.

Z. Y. Peng, “New matrix iterative methods for constraint solutions of the matrix equation ,” Journal of Computational and Applied Mathematics, vol. 235, no. 3, pp. 726–735, 2010.

Z. Y. Peng, “Solutions of symmetry-constrained least-squares problems,” Numerical Linear Algebra with Applications, vol. 15, no. 4, pp. 373–389, 2008.

C. C. Paige, “Bidiagonalization of matrices and solutions of the linear equations,” SIAM Journal on Numerical Analysis, vol. 11, pp. 197–209, 1974.

X. F. Duan, A. P. Liao, and B. Tang, “On the nonlinear matrix equation ,” Linear Algebra and Its Applications, vol. 429, no. 1, pp. 110–121, 2008.

X. F. Duan and A. P. Liao, “On the existence of Hermitian positive definite solutions of the matrix equation ,” Linear Algebra and Its Applications, vol. 429, no. 4, pp. 673–687, 2008.

X. F. Duan and A. P. Liao, “On the nonlinear matrix equation ,” Mathematical and Computer Modelling, vol. 49, no. 5-6, pp. 936–945, 2009.

X. F. Duan and A. P. Liao, “On Hermitian positive definite solution of the matrix equation ,” Journal of Computational and Applied Mathematics, vol. 229, no. 1, pp. 27–36, 2009.

X. F. Duan, C. M. Li, and A. P. Liao, “Solutions and perturbation analysis for the nonlinear matrix equation ,” Applied Mathematics and Computation, vol. 218, no. 8, pp. 4458–4466, 2011.

F. Ding, P. X. Liu, and J. Ding, “Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle,” Applied Mathematics and Computation, vol. 197, no. 1, pp. 41–50, 2008.

F. Ding and T. Chen, “Iterative least-squares solutions of coupled Sylvester matrix equations,” Systems & Control Letters, vol. 54, no. 2, pp. 95–107, 2005.

F. Ding and T. Chen, “Hierarchical gradient-based identification of multivariable discrete-time systems,” Automatica, vol. 41, no. 2, pp. 315–325, 2005.

M. H. Wang, M. S. Wei, and S. H. Hu, “An iterative method for the least-squares minimum-norm symmetric solution,” CMES: Computer Modeling in Engineering & Sciences, vol. 77, no. 3-4, pp. 173–182, 2011.

M. Dehghan and M. Hajarian, “An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation,” Applied Mathematics and Computation, vol. 202, no. 2, pp. 571–588, 2008.

M. Dehghan and M. Hajarian, “Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation ,” Mathematical and Computer Modelling, vol. 49, no. 9-10, pp. 1937–1959, 2009.

M. Hajarian and M. Dehghan, “Solving the generalized Sylvester matrix equation over reflexive and anti-reflexive matrices,” International Journal of Control and Automation, vol. 9, no. 1, pp. 118–124, 2011.

M. Dehghan and M. Hajarian, “An iterative algorithm for solving a pair of matrix equations , over generalized centro-symmetric matrices,” Computers & Mathematics with Applications, vol. 56, no. 12, pp. 3246–3260, 2008.

M. Dehghan and M. Hajarian, “Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations,” Applied Mathematical Modelling, vol. 35, no. 7, pp. 3285–3300, 2011.

M. Dehghan and M. Hajarian, “The general coupled matrix equations over generalized bisymmetric matrices,” Linear Algebra and Its Applications, vol. 432, no. 6, pp. 1531–1552, 2010.

M. Dehghan and M. Hajarian, “An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices,” Applied Mathematical Modelling, vol. 34, no. 3, pp. 639–654, 2010.

A. G. Wu, B. Li, Y. Zhang, and G. R. Duan, “Finite iterative solutions to coupled Sylvester-conjugate matrix equations,” Applied Mathematical Modelling, vol. 35, no. 3, pp. 1065–1080, 2011.

A. G. Wu, L. L. Lv, and G. R. Duan, “Iterative algorithms for solving a class of complex conjugate and transpose matrix equations,” Applied Mathematics and Computation, vol. 217, no. 21, pp. 8343–8353, 2011.

A. G. Wu, L. L. Lv, and M. Z. Hou, “Finite iterative algorithms for extended Sylvester-conjugate matrix equations,” Mathematical and Computer Modelling, vol. 54, no. 9-10, pp. 2363–2384, 2011.

N. L. Bihan and J. Mars, “Singular value decomposition of matrices of Quaternions matrices: a new tool for vector-sensor signal processing,” Signal Process, vol. 84, no. 7, pp. 1177–1199, 2004.

N. L. Bihan and S. J. Sangwine, “Jacobi method for quaternion matrix singular value decomposition,” Applied Mathematics and Computation, vol. 187, no. 2, pp. 1265–1271, 2007.

F. O. Farid, Q. W. Wang, and F. Zhang, “On the eigenvalues of quaternion matrices,” Linear and Multilinear Algebra, vol. 59, no. 4, pp. 451–473, 2011.

S. de Leo and G. Scolarici, “Right eigenvalue equation in quaternionic quantum mechanics,” Journal of Physics A, vol. 33, no. 15, pp. 2971–2995, 2000.

S. J. Sangwine and N. L. Bihan, “Quaternion singular value decomposition based on bidiagonalization to a real or complex matrix using quaternion Householder transformations,” Applied Mathematics and Computation, vol. 182, no. 1, pp. 727–738, 2006.

C. C. Took, D. P. Mandic, and F. Zhang, “On the unitary diagonalisation of a special class of quaternion matrices,” Applied Mathematics Letters, vol. 24, no. 11, pp. 1806–1809, 2011.

Q. W. Wang, H. X. Chang, and Q. Ning, “The common solution to six quaternion matrix equations with applications,” Applied Mathematics and Computation, vol. 198, no. 1, pp. 209–226, 2008.

Q. W. Wang, J. W. van der Woude, and H. X. Chang, “A system of real quaternion matrix equations with applications,” Linear Algebra and Its Applications, vol. 431, no. 12, pp. 2291–2303, 2009.

Q. W. Wang, S. W. Yu, and W. Xie, “Extreme ranks of real matrices in solution of the quaternion matrix equation with applications,” Algebra Colloquium, vol. 17, no. 2, pp. 345–360, 2010.

Q. W. Wang and J. Jiang, “Extreme ranks of (skew-)Hermitian solutions to a quaternion matrix equation,” Electronic Journal of Linear Algebra, vol. 20, pp. 552–573, 2010.

Q. W. Wang, X. Liu, and S. W. Yu, “The common bisymmetric nonnegative definite solutions with extreme ranks and inertias to a pair of matrix equations,” Applied Mathematics and Computation, vol. 218, no. 6, pp. 2761–2771, 2011.

Q. W. Wang, Y. Zhou, and Q. Zhang, “Ranks of the common solution to six quaternion matrix equations,” Acta Mathematicae Applicatae Sinica (English Series), vol. 27, no. 3, pp. 443–462, 2011.

F. Zhang, “Geršgorin type theorems for quaternionic matrices,” Linear Algebra and Its Applications, vol. 424, no. 1, pp. 139–153, 2007.

F. Zhang, “Quaternions and matrices of quaternions,” Linear Algebra and Its Applications, vol. 251, pp. 21–57, 1997.

R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 1991.

Y. X. Peng, X. Y. Hu, and L. Zhang, “An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation ,” Applied Mathematics and Computation, vol. 160, no. 3, pp. 763–777, 2005.