The Solutions to Matrix Equation <svg     style="vertical-align:-0.0pt;width:73.75px;" id="M1" height="15.075" version="1.1" viewBox="0 0 73.75 15.075" width="73.75"  xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg">
	
		
			<g transform="matrix(.022,-0,0,-.022,.062,15.012)"><path id="x1D434" d="M716 28l-8 -28h-254l8 28q55 5 66 17.5t5 47.5l-30 145h-232l-74 -138q-21 -43 -11 -54.5t72 -17.5l-6 -28h-235l8 28q53 7 73.5 21t53.5 70l319 540l33 8q6 -43 33 -176l80 -381q10 -49 26.5 -63t72.5 -19zM495 281l-49 264h-2l-149 -264h200z" /></g><g transform="matrix(.022,-0,0,-.022,16.494,15.012)"><path id="x1D44B" d="M775 650l-6 -28q-60 -6 -81.5 -16t-61.5 -54l-175 -191l125 -243q30 -58 48.5 -71t82.5 -19l-5 -28h-275l7 28l35 4q31 4 37 12t-6 34l-108 216q-140 -165 -177 -219q-16 -22 -10.5 -30.5t41.5 -13.5l22 -3l-7 -28h-244l8 28q52 4 75 15.5t67 52.5q48 46 206 231
l-110 215q-26 51 -44 63t-72 17l6 28h250l-6 -28l-27 -4q-30 -5 -35 -10t3 -27q17 -43 95 -190q70 78 154 185q15 21 10 29.5t-33 12.5l-30 4l5 28h236z" /></g><g transform="matrix(.022,-0,0,-.022,40.457,15.012)"><path id="x3D" d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" /></g><g transform="matrix(.022,-0,0,-.022,59.847,15.012)"><path id="x1D435" d="M594 511q0 -122 -171 -157l1 -2q158 -33 158 -159q0 -52 -34.5 -95t-90.5 -65q-76 -33 -217 -33h-223l8 28q63 5 79.5 19t26.5 72l83 426q9 48 -2.5 60t-77.5 17l6 28h259q195 0 195 -139zM499 509q0 59 -37 83t-91 24q-36 0 -51 -9q-17 -9 -22 -44l-35 -195h62
q82 0 128 37t46 104zM481 199q0 71 -48 102.5t-121 31.5h-56l-37 -201q-11 -58 7.5 -77t80.5 -19q76 0 125 44.5t49 118.5z" /></g>

		
	
</svg> with Some Constraints

Dong, Chang-Zhou; Zhang, Yu-Ping

doi:https://doi.org/10.1155/2014/412094

Journal of Applied Mathematics

On this page

Abstract Introduction Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2014 | Article ID 412094 | https://doi.org/10.1155/2014/412094

The Solutions to Matrix Equation with Some Constraints

Chang-Zhou Dong¹and Yu-Ping Zhang¹

Academic Editor: Morteza Rafei

Received14 Nov 2013

Accepted15 Mar 2014

Published07 Apr 2014

Abstract

Let be a given Hermitian matrix satisfying . Using the eigenvalue decomposition of , we consider the least squares solutions to the matrix equation with the constraints and . A similar problem of this matrix equation with generalized constrained is also discussed.

1. Introduction

Throughout we denote the complex matrix space by . The symbols , , , and stand for the identity matrix with the appropriate size, the conjugate transpose, the inverse, and the Frobenius norm of , respectively.

It is a very active research topic to study solutions to various matrix equations [1–4]. There are many authors who have investigated the classical matrix equation with different constraints such as symmetric, reflexive, Hermitian-generalized Hamiltonian, and repositive definite [5–9]. By special matrix decompositions such as singular value decompositions (SVDs) and CS decompositions [10–12], Hu and his collaborators [13–15], Dai [16], and Don [17] have presented the existence conditions and detailed representations of constrained solutions for (1) with corresponding constraints, respectively. For instance, Peng and Hu [18] presented the eigenvectors-involved solutions to (1) with reflexive and antireflexive constraints; Wang and Yu [19] derived the bi(skew-)symmetric solutions and the bi(skew-)symmetric least squares solutions with the minimum norm to this matrix equation; Qiu and Wang [20] proposed an eigenvectors-free method to (1) with and constraints, where is a Hermitian involutory matrix and .

Inspired by the work mentioned above, we focus on the matrix equation (1) with and constraints, which can be described as follows: find such that

Moreover, we also discuss the least squares solutions of (1) with and constraints, where is a given unitary matrix of order .

In Section 2, we present the least squares solutions to the matrix equation (1) with the constraints and . In Section 3, we derive the least squares solutions to the matrix equation (1) with the constraints and . In Section 4, we give an algorithm and a numerical example to illustrate our results.

2. Least Squares Solutions to the Matrix Equation (1) with the Constraints and

It is required to transform the constrained problem to unconstrained one. To this end, let be the eigenvalue decomposition of the Hermitian matrix with unitary matrix . Obviously, holds if and only if where . Partitioning (4) is equivalent to Therefore, The constraint is equivalent to with .

Partition and denote then assume that the singular value decomposition of and is as follows: where , and are unitary matrices, , , , , , and .

Theorem 1. Given . Then the least squares solutions to the matrix equation (1) with the constraints and can be expressed as where and are arbitrary matrix.

Proof. According to (8) and the unitary invariance of Frobenius norm By (9), the least squares problem is equivalent to We get According to (10), the least squares problem is equivalent to Assume that Then we have Hence is solvable if and only if there exist such that It follows from (19) that Substituting (20) into (16) and then into (8), we can get that the form of is (11).

3. Least Squares Solutions to the Matrix Equation (1) with the Constraints and

In this section, we generalize the constraints to , where is a given unitary matrix of order . Obviously, the constraint is equal to Notice that (1) can be equivalently rewritten in Denoting by and setting , the equation becomes with the constraints and .

Therefore, the least squares solutions to matrix equation (1) with the constraints and can be solved similar to Theorem 1.

Theorem 2. Given . Then the least squares solutions to the matrix equation (1) with the constraints and can be expressed aswhere and are arbitrary matrix.

4. An Algorithm and Numerical Examples

Based on the main results of this paper, we in this section propose an algorithm for finding the least squares solutions to the matrix equation with the constraints and . All the tests are performed by MATLAB 6.5 which has a machine precision of around .

Algorithm 3. Input and compute , , by the eigenvalue decomposition to .
Compute according to (9).
Compute by the singular value decomposition of .
Compute according to (16).
Compute by Theorem 1.

Example 4. Suppose
Applying Algorithm 3, we obtain the following:

Conflict of Interests

The authors declare that they have no conflict of interests regarding the publication of this paper.

Acknowledgments

This research was supported by the Natural Science Foundation of Hebei province (A2012403013), the Natural Science Foundation of Hebei province (A2012205028), and the Education Department Foundation of Hebei province (Z2013110).

References

Q.-W. Wang and Z.-H. He, “A system of matrix equations and its applications,” Science China Mathematics, vol. 56, no. 9, pp. 1795–1820, 2013.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
Q.-W. Wang and Z.-H. He, “Solvability conditions and general solution for mixed Sylvester equations,” Automatica, vol. 49, no. 9, pp. 2713–2719, 2013.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
Q.-W. Wang and Z.-H. He, “Some matrix equations with applications,” Linear and Multilinear Algebra, vol. 60, no. 11-12, pp. 1327–1353, 2012.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
S.-F. Yuan, Q.-W. Wang, and X.-F. Duan, “On solutions of the quaternion matrix equation $A X = B$ and their applications in color image restoration,” Applied Mathematics and Computation, vol. 221, pp. 10–20, 2013.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
K.-E. Chu, “Symmetric solutions of linear matrix equations by matrix decompositions,” Linear Algebra and Its Applications, vol. 119, pp. 35–50, 1989.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
Z.-H. He and Q.-W. Wang, “A real quaternion matrix equation with applications,” Linear and Multilinear Algebra, vol. 61, no. 6, pp. 725–740, 2013.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
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 | Zentralblatt MATH | MathSciNet
Y. Li, Y. Gao, and W.-B. Guo, “A Hermitian least squares solution of the matrix equation $A X B = C$ subject to inequality restrictions,” Computers & Mathematics with Applications, vol. 64, no. 6, pp. 1752–1760, 2012.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
L. Wu, “The re-positive definite solutions to the matrix inverse problem $A X = B$ ,” Linear Algebra and Its Applications, vol. 174, pp. 145–151, 1992.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
K.-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.
View at: Publisher Site | Google Scholar | MathSciNet
C.-C. Paige, “Computing the generalized singular value decomposition,” SIAM Journal on Scientific and Statistical Computing, vol. 7, no. 4, pp. 1126–1146, 1986.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
C.-C. Paige and M.-A. Saunders, “Towards a generalized singular value decomposition,” SIAM Journal on Numerical Analysis, vol. 18, no. 3, pp. 398–405, 1981.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
C.-J. Meng, X.-Y. Hu, and L. Zhang, “The skew-symmetric orthogonal solutions of the matrix equation $A X = B$ ,” Linear Algebra and Its Applications, vol. 402, pp. 303–318, 2005.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
C.-J. Meng and X.-Y. Hu, “An inverse problem for symmetric orthogonal matrices and its optimal approximation,” Mathematica Numerica Sinica, vol. 28, no. 3, pp. 269–280, 2006.
View at: Google Scholar | Zentralblatt MATH | MathSciNet
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.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
H. Dai, “On the symmetric solutions of linear matrix equations,” Linear Algebra and Its Applications, vol. 131, pp. 1–7, 1990.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
F.-J. Henk Don, “On the symmetric solutions of a linear matrix equation,” Linear Algebra and Its Applications, vol. 93, pp. 1–7, 1987.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
Z.-Y. Peng and X.-Y. Hu, “The reflexive and anti-reflexive solutions of the matrix equation $A X = B$ ,” Linear Algebra and Its Applications, vol. 375, pp. 147–155, 2003.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
Q.-W. Wang and J. Yu, “On the generalized bi (skew-) symmetric solutions of a linear matrix equation and its procrust problems,” Applied Mathematics and Computation, vol. 219, no. 19, pp. 9872–9884, 2013.
View at: Publisher Site | Google Scholar | MathSciNet
Y.-Y. Qiu and A.-D. Wang, “Eigenvector-free solutions to $A X = B$ with $P X = X P$ and $X^{H} = s X$ constraints,” Applied Mathematics and Computation, vol. 217, no. 12, pp. 5650–5657, 2011.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet

Copyright

Copyright © 2014 Chang-Zhou Dong and Yu-Ping Zhang. 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.

PDF Download Citation

Download other formats

Order printed copies

Views

2634

Downloads

889

Citations