/ / Article

Research Article | Open Access

Volume 2013 |Article ID 952974 | https://doi.org/10.1155/2013/952974

Zhongli Zhou, Guangxin Huang, "An Iterative Algorithm for the Reflexive Solution of the General Coupled Matrix Equations", The Scientific World Journal, vol. 2013, Article ID 952974, 15 pages, 2013. https://doi.org/10.1155/2013/952974

# An Iterative Algorithm for the Reflexive Solution of the General Coupled Matrix Equations

Accepted26 Aug 2013
Published11 Nov 2013

#### Abstract

The general coupled matrix equations (including the generalized coupled Sylvester matrix equations as special cases) have numerous applications in control and system theory. In this paper, an iterative algorithm is constructed to solve the general coupled matrix equations over reflexive matrix solution. When the general coupled matrix equations are consistent over reflexive matrices, the reflexive solution can be determined automatically by the iterative algorithm within finite iterative steps in the absence of round-off errors. The least Frobenius norm reflexive solution of the general coupled matrix equations can be derived when an appropriate initial matrix is chosen. Furthermore, the unique optimal approximation reflexive solution to a given matrix group in Frobenius norm can be derived by finding the least-norm reflexive solution of the corresponding general coupled matrix equations. A numerical example is given to illustrate the effectiveness of the proposed iterative algorithm.

#### 1. Introduction

Let be a generalized reflection matrix; that is, and . A matrix is called reflexive with respect to the matrix if . The set of all -by- reflexive matrices with respect to the generalized reflection matrix is denoted by . Let denote the set of all real matrices. We denote by the superscript the transpose of a matrix. In matrix space , define inner product as; for all ; represents the Frobenius norm of . represents the column space of . represents the vector operator; that is, for the matrix , , . stands for the Kronecker product of matrices and .

In this paper, we will consider the following two problems.

Problem 1. Let be generalized reflection matrices. For given matrices , , and , find reflexive matrix solution group with such that

Problem 2. When Problem 1 is consistent, let denote the set of the reflexive solution group of Problem 1; that is, For a given reflexive matrix group Find such that

The general coupled matrix equations (1) (including the generalized coupled Sylvester matrix equations as special cases) may arise in many areas of control and system theory.

Many theoretical and numerical results on (1) and some of its special cases have been obtained. Least-squares-based iterative algorithms are very important in system identification, parameter estimation, and signal processing, including the recursive least squares (RLS) and iterative least squares (ILS) methods for solving the solutions of some matrix equations, for example, the Lyapunov matrix equation, Sylvester matrix equations, and coupled matrix equations as well. For example, novel gradient-based iterative (GI) method  and least-squares-based iterative methods [3, 4, 6] with highly computational efficiencies for solving (coupled) matrix equations are presented and have good stability performances, based on the hierarchical identification principle, which regards the unknown matrix as the system parameter matrix to be identified. Ding and Chen  presented the gradient-based iterative algorithms by applying the gradient search principle and the hierarchical identification principle for (1) with . Wu et al. [7, 8] gave the finite iterative solutions to coupled Sylvester-conjugate matrix equations. Wu et al.  gave the finite iterative solutions to a class of complex matrix equations with conjugate and transpose of the unknowns. Jonsson and Kågström [10, 11] proposed recursive block algorithms for solving the coupled Sylvester matrix equations and the generalized Sylvester and Lyapunov Matrix equations. By extending the idea of conjugate gradient method, Dehghan and Hajarian  constructed an iterative algorithm to solve (1) with over generalized bisymmetric matrices. Very recently, Huang et al.  presented a finite iterative algorithms for the one-sided and generalized coupled Sylvester matrix equations over generalized reflexive solutions. Yin et al.  presented a finite iterative algorithms for the two-sided and generalized coupled Sylvester matrix equations over reflexive solutions. For more results, we refer to . However, to our knowledge, the reflexive solution to the general coupled matrix equations (1) and the optimal approximation reflexive solution have not been derived. In this paper, we will consider the reflexive solution of (1) and the optimal approximation reflexive solution.

This paper is organized as follows. In Section 2, we will solve Problem 1 by constructing an iterative algorithm. The convergence of the proposed algorithm is proved. For any arbitrary initial matrix group, we can obtain a reflexive solution group of Problem 1 within finite iteration steps in the absence of round-off errors. Furthermore, for a special initial matrix group, we can obtain the least Frobenius norm solution of Problem 1. Then in Section 3, we give the optimal approximate solution group of Problem 2 by finding the least Frobenius norm reflexive solution group of the corresponding general coupled matrix equations. In Section 4, a numerical example is given to illustrate the effectiveness of our method. At last, some conclusions are drawn in Section 5.

#### 2. An Iterative Algorithm for Solving Problem 1

In this section, we will first introduce an iterative algorithm to solve Problem 1 then prove its convergence. We will also give the least-norm reflexive solution of Problem 1 when an appropriate initial iterative matrix group is chosen.

Algorithm 3. Step  1. Input matrices , , , and generalized reflection matrices , , .
Step  2. Choose an arbitrary matrix group Compute
Step  3. If , then stop and is the solution group of (1); elseif , but , , then stop and (1) are not consistent over reflexive matrix group; else .
Step  4. Compute

Step  5. Go to Step  3.

Obviously, it can be seen that for all and .

Lemma 4. For the sequences generated by Algorithm 3, and , we have

The proof of Lemma 4 is presented in the appendix.

Lemma 5. Suppose that is an arbitrary reflexive solution group of Problem 1; then for any initial reflexive matrix group , one has where the sequences , , and are generated by Algorithm 3.

The proof of Lemma 5 is presented in the appendix.

Remark 6. If there exists a positive number such that , but , then, by Lemma 5, we get that (1) are not consistent over reflexive matrices.

Theorem 7. Suppose that Problem 1 is consistent; then for an arbitrary initial matrix group with , a reflexive solution group of Problem 1 can be obtained with finite iteration steps in the absence of round-off errors.

Proof. If , , then by Lemma 5 and Remark 6 we have for all and . Thus we can compute and by Algorithm 3.
By Lemma 4, we have
It can be seen that the set of is an orthogonal basis of the matrix subspace which implies that ; that is, with is a reflexive solution group of Problem 1. This completes the proof.

To show the least Frobenius norm reflexive solution of Problem 1, we first introduce the following result.

Lemma 8 (see [20, Lemma 2.4]). Suppose that the consistent system of linear equation has a solution ; then is a unique least Frobenius norm solution of the system of linear equation.

By Lemma 8, the following result can be obtained.

Theorem 9. Suppose that Problem 1 is consistent. If one chooses the initial iterative matrices , , where , are arbitrary matrices, especially, , then the solution group generated by Algorithm 3 is the unique least Frobenius norm reflexive solution group of Problem 1.

Proof. We know that the solvability of (1) over reflexive matrices is equivalent to the following matrix equations:
Then the system of matrix equations (12) is equivalent to
Let , , where are arbitrary matrices; then Furthermore, we can see that all reflexive matrix solution groups generated by Algorithm 3 satisfy by Lemma 8 we know that is the least Frobenius norm reflexive solution group of the system of linear equation (13). Since vector operator is isomorphic, is the unique least Frobenius norm reflexive solution group of the system of matrix equations (12). Thus is the unique least Frobenius norm reflexive solution group of Problem 1. This completes the proof.

#### 3. The Solution of Problem 2

In this section, we will show that the reflexive solution group of Problem 2 to a given reflexive matrix group can be derived by finding the least Frobenius norm reflexive solution group of the corresponding general coupled matrix equations.

When Problem 1 is consistent, the set of the reflexive solution groups of Problem 1 denoted by is not empty. For a given matrix pair with , , we have Set and ; then solving Problem 2 is equivalent to finding the least Frobenius norm reflexive solution group of the corresponding general coupled matrix equations By using Algorithm 3, let initial iteration matrices where , are arbitrary matrices, especially, , ; then we can get the the least Frobenius norm reflexive solution group of (17). Thus the reflexive solution group of Problem 2 can be represented as

#### 4. A Numerical Example

In this section, we will show a numerical example to illustrate our results. All the tests are performed by MATLAB 7.8.

Example 10. Consider the reflexive solution of the general coupled matrix equations where Let be the generalized reflection matrices.
We will find the reflexive solution of the the general coupled matrix equations (20) by using Algorithm 3. It can be verified that the matrix equations (20) are consistent over reflexive matrices and the solution is
Because of the influence of the error of calculation, the residual is usually unequal to zero in the process of the iteration, where . For any chosen positive number , however small enough, for example, , whenever , stop the iteration; is regarded to be the reflexive solution of the matrix equations (20). Choose an initially iterative matrix group , such as by Algorithm 3, we have
So we obtain the reflexive solution of the matrix equations (20). The relative error of the solution and the residual are shown in Figure 1, where the relative error and the residual .
Let denote the set of all reflexive solution group of the matrix equations (20). For two given reflexive matrices, we will find , such that that is, find the optimal approximate reflexive solution group to the given matrix group in in Frobenius norm.
Let , , , , by the method mentioned in Section 3, we can obtain the least-norm reflexive solution group of the matrix equations and by choosing the initially iterative matrices and ; then by Algorithm 3 we have that and the optimal approximate reflexive solution to the matrix group in Frobenius norm are The relative error and the residual of the solution are shown in Figure 2, where the relative error and the residual .

#### 5. Conclusions

In this paper, an iterative algorithm is presented to solve the general coupled matrix equations over reflexive matrices. When the general coupled matrix equations are consistent over reflexive matrices, for any initially reflexive matrix group, the reflexive solution group can be obtained by the iterative algorithm within finite iterative steps in the absence of round-off errors. When a special kind of initial iteration matrix group is given, the unique least-norm reflexive solution of the general coupled matrix equations can be derived. Furthermore, the optimal approximate reflexive solution of the general coupled matrix equations to a given reflexive matrix group can be derived by finding the least-norm reflexive solution of new corresponding general coupled matrix equations. Finally, a numerical example is given in Section 4 to illustrate that our iterative algorithm is quite effective.

#### A. The Proof of Lemma 4

Since and for all and , we only need to prove that We prove the conclusion by induction, and two steps are required.

Step  1. we will show that

To prove this conclusion, we also use induction.

For , by Algorithm 3, we have that

Assume that (A.2) holds for ; that is, When , we have that