/ / Article
Special Issue

## Advances in Matrices, Finite and Infinite, with Applications

View this Special Issue

Research Article | Open Access

Volume 2012 |Article ID 398085 | https://doi.org/10.1155/2012/398085

Chang-Zhou Dong, Qing-Wen Wang, Yu-Ping Zhang, "On the Hermitian -Conjugate Solution of a System of Matrix Equations", Journal of Applied Mathematics, vol. 2012, Article ID 398085, 14 pages, 2012. https://doi.org/10.1155/2012/398085

# On the Hermitian -Conjugate Solution of a System of Matrix Equations

Accepted26 Nov 2012
Published20 Dec 2012

#### Abstract

Let be an by nontrivial real symmetric involution matrix, that is, . An complex matrix is termed -conjugate if , where denotes the conjugate of . We give necessary and sufficient conditions for the existence of the Hermitian -conjugate solution to the system of complex matrix equations and present an expression of the Hermitian -conjugate solution to this system when the solvability conditions are satisfied. In addition, the solution to an optimal approximation problem is obtained. Furthermore, the least squares Hermitian -conjugate solution with the least norm to this system mentioned above is considered. The representation of such solution is also derived. Finally, an algorithm and numerical examples are given.

#### 1. Introduction

Throughout, we denote the complex matrix space by , the real matrix space by , and the set of all matrices in with rank by . The symbols , and stand for the identity matrix with the appropriate size, the conjugate, the transpose, the conjugate transpose, the Moore-Penrose generalized inverse, and the Frobenius norm of , respectively. We use to denote the backward matrix having the elements along the southwest diagonal and with the remaining elements being zeros.

Recall that an complex matrix is centrohermitian if . Centrohermitian matrices and related matrices, such as k-Hermitian matrices, Hermitian Toeplitz matrices, and generalized centrohermitian matrices, appear in digital signal processing and others areas (see, ). As a generalization of a centrohermitian matrix and related matrices, Trench  gave the definition of -conjugate matrix. A matrix is -conjugate if , where is a nontrivial real symmetric involution matrix, that is, and . At the same time, Trench studied the linear equation for -conjugate matrices in , where are known column vectors.

Investigating the matrix equation with the unknown matrix being symmetric, reflexive, Hermitian-generalized Hamiltonian, and repositive definite is a very active research topic . As a generalization of (1.1), the classical system of matrix equations has attracted many author’s attention. For instance,  gave the necessary and sufficient conditions for the consistency of (1.2), [16, 17] derived an expression for the general solution by using singular value decomposition of a matrix and generalized inverses of matrices, respectively. Moreover, many results have been obtained about the system (1.2) with various constraints, such as bisymmetric, Hermitian, positive semidefinite, reflexive, and generalized reflexive solutions (see, ). To our knowledge, so far there has been little investigation of the Hermitian -conjugate solution to (1.2).

Motivated by the work mentioned above, we investigate Hermitian -conjugate solutions to (1.2). We also consider the optimal approximation problem where is a given matrix in and the set of all Hermitian -conjugate solutions to (1.2). In many cases the system (1.2) has not Hermitian -conjugate solution. Hence, we need to further study its least squares solution, which can be described as follows: Let denote the set of all Hermitian -conjugate matrices in : Find such that

In Section 2, we present necessary and sufficient conditions for the existence of the Hermitian -conjugate solution to (1.2) and give an expression of this solution when the solvability conditions are met. In Section 3, we derive an optimal approximation solution to (1.3). In Section 4, we provide the least squares Hermitian -conjugate solution to (1.5). In Section 5, we give an algorithm and a numerical example to illustrate our results.

#### 2. -Conjugate Hermitian Solution to (1.2)

In this section, we establish the solvability conditions and the general expression for the Hermitian -conjugate solution to (1.2).

We denote and the set of all -conjugate matrices and Hermitian -conjugate matrices, respectively, that is, where is nontrivial real symmetric involution matrix.

Chang et al. in  mentioned that for nontrivial symmetric involution matrix , there exist positive integer and real orthogonal matrix such that where . By (2.2),

Throughout this paper, we always assume that the nontrivial symmetric involution matrix is fixed which is given by (2.2) and (2.3). Now, we give a criterion of judging a matrix is -conjugate Hermitian matrix.

Theorem 2.1. A matrix if and only if there exists a symmetric matrix such that , where with being the same as (2.2).

Proof. If , then . By (2.2), which is equivalent to Suppose that Substituting (2.7) into (2.6), we obtain Hence, are real matrices. If we denote , then by (2.7) Let , and Then, can be expressed as , where is unitary matrix and is a real matrix. By we obtain .
Conversely, if there exists a symmetric matrix such that , then it follows from (2.3) that that is, .

Theorem 2.1 implies that an arbitrary complex Hermitian -conjugate matrix is equivalent to a real symmetric matrix.

Lemma 2.2. For any matrix , where

Proof. For any matrix , it is obvious that , where are defined as (2.13). Now, we prove that the decomposition is unique. If there exist such that , then It follows from are real matrix that Hence, holds, where are defined as (2.13).

By Theorem 2.1, for , we may assume that where is defined as (2.4) and is a symmetric matrix.

Suppose that , and , where Then, system (1.2) can be reduced into which implies that Let Then, system (1.2) has a solution in if and only if the real system has a symmetric solution in .

Lemma 2.3 (Theorem  1 in ). Let . The of matrix is as follows where and are orthogonal matrices, . Then, (1.1) has a symmetric solution if and only if In that case, it has the general solution where is an arbitrary symmetric matrix.

By Lemma 2.3, we have the following theorem.

Theorem 2.4. Given , and . Let , be defined in (2.17), (2.20), respectively. Assume that the of is as follows where and are orthogonal matrices, . Then, system (1.2) has a solution in if and only if In that case, it has the general solution where is an arbitrary symmetric matrix.

#### 3. The Solution of Optimal Approximation Problem (1.3)

When the set of all Hermitian -conjugate solution to (1.2) is nonempty, it is easy to verify is a closed set. Therefore, the optimal approximation problem (1.3) has a unique solution by .

Theorem 3.1. Given , and . Assume is nonempty, then the optimal approximation problem (1.3) has a unique solution and

Proof. Since is nonempty, has the form of (2.27). By Lemma 2.2, can be written as where According to (3.2) and the unitary invariance of Frobenius norm We get Then, is consistent if and only if there exists such that For the orthogonal matrix Therefore, is equivalent to Substituting (3.9) into (2.27), we obtain (3.1).

#### 4. The Solution of Problem (1.5)

In this section, we give the explicit expression of the solution to (1.5).

Theorem 4.1. Given ,  and  . Let ,  and   be defined in (2.17), (2.20), respectively. Assume that the of is as (2.25) and system (1.2) has not a solution in . Then, can be expressed as where is an arbitrary symmetric matrix.

Proof. It yields from (2.17)–(2.21) and (2.25) that Assume that Then, we have Hence, is solvable if and only if there exist such that It follows from (4.6) that Substituting (4.7) into (4.3) and then into (2.16), we can get that the form of elements in is (4.1).

Theorem 4.2. Assume that the notations and conditions are the same as Theorem 4.1. Then, if and only if

Proof. In Theorem 4.1, it implies from (4.1) that is equivalent to has the expression (4.1) with . Hence, (4.9) holds.

#### 5. An Algorithm and Numerical Example

Base on the main results of this paper, we in this section propose an algorithm for finding the solution of the approximation problem (1.3) and the least squares problem with least norm (1.5). All the tests are performed by MATLAB 6.5 which has a machine precision of around .

Algorithm 5.1. Input .
Compute by (2.17) and (2.20).
Compute the singular value decomposition of with the form of (2.25).
If (2.26) holds, then input and compute the solution of problem (1.3) according (3.1), else compute the solution to problem (1.5) by (4.9).

To show our algorithm is feasible, we give two numerical example. Let an nontrivial symmetric involution be We obtain in (2.2) by using the spectral decomposition of , then by (2.4)

Example 5.2. Suppose , and We can verify that (2.26) holds. Hence, system (1.2) has an Hermitian -conjugate solution. Given Applying Algorithm 5.1, we obtain the following:

Example 5.2 illustrates that we can solve the optimal approximation problem with Algorithm 5.1 when system (1.2) have Hermitian -conjugate solutions.

Example 5.3. Let be the same as Example 5.2, and let in Example 5.2 be changed into We can verify that (2.26) does not hold. By Algorithm 5.1, we get

Example 5.3 demonstrates that we can get the least squares solution with Algorithm 5.1 when system (1.2) has not Hermitian -conjugate solutions.

#### Acknowledgments

This research was supported by the Grants from the Key Project of Scientific Research Innovation Foundation of Shanghai Municipal Education Commission (13ZZ080), the National Natural Science Foundation of China (11171205), the Natural Science Foundation of Shanghai (11ZR1412500), the Ph.D. Programs Foundation of Ministry of Education of China (20093108110001), the Discipline Project at the corresponding level of Shanghai (A. 13-0101-12-005), Shanghai Leading Academic Discipline Project (J50101), the Natural Science Foundation of Hebei province (A2012403013), and the Natural Science Foundation of Hebei province (A2012205028). The authors are grateful to the anonymous referees for their helpful comments and constructive suggestions.

1. R. D. Hill, R. G. Bates, and S. R. Waters, “On centro-Hermitian matrices,” SIAM Journal on Matrix Analysis and Applications, vol. 11, no. 1, pp. 128–133, 1990. View at: Publisher Site | Google Scholar
2. R. Kouassi, P. Gouton, and M. Paindavoine, “Approximation of the Karhunen-Loeve tranformation and Its application to colour images,” Signal Processing: Image Communication, vol. 16, pp. 541–551, 2001. View at: Google Scholar
3. A. Lee, “Centro-Hermitian and skew-centro-Hermitian matrices,” Linear Algebra and Its Applications, vol. 29, pp. 205–210, 1980. View at: Publisher Site | Google Scholar
4. Z.-Y. Liu, H.-D. Cao, and H.-J. Chen, “A note on computing matrix-vector products with generalized centrosymmetric (centrohermitian) matrices,” Applied Mathematics and Computation, vol. 169, no. 2, pp. 1332–1345, 2005. View at: Publisher Site | Google Scholar
5. W. F. Trench, “Characterization and properties of matrices with generalized symmetry or skew symmetry,” Linear Algebra and Its Applications, vol. 377, pp. 207–218, 2004.
6. K.-W. E. Chu, “Symmetric solutions of linear matrix equations by matrix decompositions,” Linear Algebra and Its Applications, vol. 119, pp. 35–50, 1989.
7. H. Dai, “On the symmetric solutions of linear matrix equations,” Linear Algebra and Its Applications, vol. 131, pp. 1–7, 1990.
8. F. J. H. Don, “On the symmetric solutions of a linear matrix equation,” Linear Algebra and Its Applications, vol. 93, pp. 1–7, 1987.
9. I. Kyrchei, “Explicit representation formulas for the minimum norm least squares solutions of some quaternion matrix equations,” Linear Algebra and Its Applications, vol. 438, no. 1, pp. 136–152, 2013. View at: Publisher Site | Google Scholar
10. Y. Li, Y. Gao, and W. Guo, “A Hermitian least squares solution of the matrix equation $AXB=C$ subject to inequality restrictions,” Computers & Mathematics with Applications, vol. 64, no. 6, pp. 1752–1760, 2012. View at: Publisher Site | Google Scholar
11. Z.-Y. Peng and X.-Y. Hu, “The reflexive and anti-reflexive solutions of the matrix equation $AX=B$,” Linear Algebra and Its Applications, vol. 375, pp. 147–155, 2003.
12. L. Wu, “The re-positive definite solutions to the matrix inverse problem $AX=B$,” Linear Algebra and Its Applications, vol. 174, pp. 145–151, 1992. View at: Google Scholar | Zentralblatt MATH
13. S. F. Yuan, Q. W. Wang, and X. Zhang, “Least-squares problem for the quaternion matrix equation $AXB+CYD=E$ over different constrained matrices,” Article ID 722626, International Journal of Computer Mathematics. In press. View at: Publisher Site | Google Scholar
14. Z.-Z. Zhang, X.-Y. Hu, and L. Zhang, “On the Hermitian-generalized Hamiltonian solutions of linear matrix equations,” SIAM Journal on Matrix Analysis and Applications, vol. 27, no. 1, pp. 294–303, 2005.
15. F. Cecioni, “Sopra operazioni algebriche,” Annali della Scuola Normale Superiore di Pisa, vol. 11, pp. 17–20, 1910. View at: Google Scholar
16. K.-W. E. Chu, “Singular value and generalized singular value decompositions and the solution of linear matrix equations,” Linear Algebra and Its Applications, vol. 88-89, pp. 83–98, 1987.
17. S. K. Mitra, “A pair of simultaneous linear matrix equations ${A}_{1}X{B}_{1}={C}_{1},{A}_{2}X{B}_{2}={C}_{2}$ and a matrix programming problem,” Linear Algebra and Its Applications, vol. 131, pp. 107–123, 1990.
18. H.-X. Chang and Q.-W. Wang, “Reflexive solution to a system of matrix equations,” Journal of Shanghai University, vol. 11, no. 4, pp. 355–358, 2007.
19. A. Dajić and J. J. Koliha, “Equations $ax=c$ and $xb=d$ in rings and rings with involution with applications to Hilbert space operators,” Linear Algebra and Its Applications, vol. 429, no. 7, pp. 1779–1809, 2008.
20. A. Dajić and J. J. Koliha, “Positive solutions to the equations $AX=C$ and $XB=D$ for Hilbert space operators,” Journal of Mathematical Analysis and Applications, vol. 333, no. 2, pp. 567–576, 2007.
21. C.-Z. Dong, Q.-W. Wang, and Y.-P. Zhang, “The common positive solution to adjointable operator equations with an application,” Journal of Mathematical Analysis and Applications, vol. 396, no. 2, pp. 670–679, 2012. View at: Publisher Site | Google Scholar
22. X. Fang, J. Yu, and H. Yao, “Solutions to operator equations on Hilbert ${C}^{*}$-modules,” Linear Algebra and Its Applications, vol. 431, no. 11, pp. 2142–2153, 2009. View at: Publisher Site | Google Scholar
23. C. G. Khatri and S. K. Mitra, “Hermitian and nonnegative definite solutions of linear matrix equations,” SIAM Journal on Applied Mathematics, vol. 31, no. 4, pp. 579–585, 1976.
24. I. Kyrchei, “Analogs of Cramer's rule for the minimum norm least squares solutions of some matrix equations,” Applied Mathematics and Computation, vol. 218, no. 11, pp. 6375–6384, 2012.
25. F. L. Li, X. Y. Hu, and L. Zhang, “The generalized reflexive solution for a class of matrix equations ($AX=C,XB=D$),” Acta Mathematica Scientia, vol. 28B, no. 1, pp. 185–193, 2008. View at: Google Scholar
26. Q.-W. Wang and C.-Z. Dong, “Positive solutions to a system of adjointable operator equations over Hilbert ${C}^{*}$-modules,” Linear Algebra and Its Applications, vol. 433, no. 7, pp. 1481–1489, 2010. View at: Publisher Site | Google Scholar
27. Q. Xu, “Common Hermitian and positive solutions to the adjointable operator equations $AX=C$, $XB=D$,” Linear Algebra and Its Applications, vol. 429, no. 1, pp. 1–11, 2008.
28. F. Zhang, Y. Li, and J. Zhao, “Common Hermitian least squares solutions of matrix equations ${A}_{1}X{A}_{1}^{*}={B}_{1}$ and ${A}_{2}X{A}_{2}^{*}={B}_{2}$ subject to inequality restrictions,” Computers & Mathematics with Applications, vol. 62, no. 6, pp. 2424–2433, 2011.
29. H.-X. Chang, Q.-W. Wang, and G.-J. Song, “$\left(R,S\right)$-conjugate solution to a pair of linear matrix equations,” Applied Mathematics and Computation, vol. 217, no. 1, pp. 73–82, 2010.
30. E. W. Cheney, Introduction to Approximation Theory, McGraw-Hill, New York, NY, USA, 1966.

#### More related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.