特稿

A Pair of Mixed Generalized Sylvester Matrix Equations

展开
  • (College of Sciences, Shanghai University, Shanghai 200444, China)

网络出版日期: 2014-04-26

基金资助

the National Natural Science Foundation of China (11171205), and the Key Project of the Scientific Research Innovation Foundation of Shanghai Municipal Education Comm-ission (13ZZ080)

A Pair of Mixed Generalized Sylvester Matrix Equations

Expand
  • (College of Sciences, Shanghai University, Shanghai 200444, China)

Online published: 2014-04-26

Supported by

the National Natural Science Foundation of China (11171205), and the Key Project of the Scientific Research Innovation Foundation of Shanghai Municipal Education Comm-ission (13ZZ080)

摘要

In this paper, some necessary and sufficient solvability conditions for the system of mixed generalized Sylvester matrix equations A1X − Y B1 = C1, A2Y − ZB2 = C2 are derived, and an expression of the general solution to this system is given when it is solvable. Admissible ranks of the solution, and admissible ranks and inertias of the Hermitian part of the solution are investigated, respectively. As an application of the above system, solvability conditions and the general Hermitian solution to the generalized Sylvester matrix equation are obtained. Moreover, we provide an algorithm and an example to illustrate our results.

本文引用格式

HE Zhuo-heng, WANG Qing-wen . A Pair of Mixed Generalized Sylvester Matrix Equations[J]. 上海大学学报(自然科学版), 2014 , 20(2) : 138 -156 . DOI: 10.3969/j.issn.1007-2861.2014.01.021

Abstract

In this paper, some necessary and sufficient solvability conditions for the system of mixed generalized Sylvester matrix equations A1X − Y B1 = C1, A2Y − ZB2 = C2 are derived, and an expression of the general solution to this system is given when it is solvable. Admissible ranks of the solution, and admissible ranks and inertias of the Hermitian part of the solution are investigated, respectively. As an application of the above system, solvability conditions and the general Hermitian solution to the generalized Sylvester matrix equation are obtained. Moreover, we provide an algorithm and an example to illustrate our results.

参考文献

[1] Shahzad A B, Jones L, Kerrigan E C, et al. An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems [J]. Automatica, 2011, 47: 244–248.

[2] Cavinlii R K, Bhattacharyya S P. Robust and well-conditioned eigenstructure assignment via Sylvester’s equation [J]. Optim Control Appl Methods, 1983, 4(3): 205–212.

[3] Varga A. Robust pole assignment via Sylvester equation based state feedback parametrization[J]. Computer-Aided Control System Design, 2000, 57: 13–18.
[4] Zhang Y N, Jiang D C, Wang J. A recurrent neural network for solving Sylvester equation with time-varying coefficients [J]. IEEE Trans Neural Networks, 2002, 13(5): 1053–1063.

[5] Saberi A, Stoorvogel A A, Sannuti P. Control of linear systems with regulation and input constraints [M]. Berlin: Springer Verlag, 2003.

[6] Syrmos V L, Lewis F L. Output feedback eigenstructure assignment using two Sylvester equations [J]. IEEE Trans Autom Control, 1993, 38: 495–499.

[7] Dehghan M, Hajarian M. Analysis of an iterative algorithm to solve the generalized coupled Sylvester matrix equations [J]. Appl Math Model, 2011, 35: 3285–3300.

[8] Dehghan M, Hajarian M. An efficient iterative method for solving the second-order Sylvester matrix equation EV F2−AV F−CV =BW [J]. IET Control Theory Appl, 2009, 3: 1401–1408.

[9] Ding F, Chen T. Gradient based iterative algorithms for solving a class of matrix equations [J]. IEEE Trans Autom Control, 2005, 50(8): 1216–1221.

[10] Ding F, Liu P, Ding J. Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle [J]. Appl Math Comput, 2008, 197(1): 41–50.

[11] Duan G R, Zhou Z. Solution to the second-order Sylvester matrix equation MVF2+DVF+KV=BW [J]. IEEE Trans Autom Control, 2006, 51(5): 805–809.

[12] Kagstrom B, Westin L. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation [J]. IEEE Trans Autom Control, 1989, 34: 745–751.

[13] Song C Q, Chen G L. On solutions of matrix equations XF−AX=C and XF−AX=C over quaternion field [J]. J Appl Math Comput, 2011, 37: 57–88.

[14] Song C Q, Chen G L, ZHAO L L. Iterative solutions to coupled Sylvester-transpose matrix equations [J]. Appl Math Model, 2011, 35: 4675–4683.

[15] Tsui C C. A complete analytical solution to the equation TA−FT=LC and its applications [J]. IEEE Trans Autom Control, 1987, 8: 742–744.

[16] Wimmer H K. Consistency of a pair of generalized Sylvester equations [J]. IEEE Trans Autom Control, 1994, 39: 1014–1016.

[17] Wu A G, Duan D R, Zhou B. Solution to generalized Sylvester matrix equations [J]. IEEE Trans Autom Control, 2008, 53(3): 811–815.

[18] Zhou B, Duan G R. A new solution to the generalized Sylvester matrix equation AV−EVF=BW [J]. Syst Contr Lett, 2006, 55: 193–198.

[19] Lee S G, Vu Q P. Simultaneous solutions of matrix equations and simultaneous equivalence of matrices [J]. Linear Algebra Appl, 2012, 437: 2325–2339.

[20] Liu Y H. Ranks of solutions of the linear matrix equation AX+YB=C [J]. Comput Math Appl, 2006, 52: 861–872.

[21] Wang Q W, He Z H. Solvability conditions and general solution for the mixed Sylvester equations [J]. Automatica, 2013, 49: 2713–2719.

[22] Baksalary J K, Kala P. The matrix equation AX+YB=C [J]. Linear Algebra Appl, 1979, 25: 41–43.

[23] Marsaglia G, Styan G P H. Equalities and inequalities for ranks of matrices [J]. Linear and Multilinear Algebra, 1974, 2: 269–292.
[24] Chu D L, Hung Y S, Woerdeman H J. Inertia and rank characterizations of some matrix expressions [J]. SIAM J Matrix Anal Appl, 2009, 31: 1187–1226.

[25] Zhang F X, Li Y, Zhao J L. Common Hermitian least squares solutions of matrix equations A1XA 1 = B1 and A2XA2 = B2 subject to inequality restrictions [J]. Computers and Mathematics with Applications, 2011, 62: 2424–2433.

[26] Chu D L, Malabre M. On the quadratic controllability and quadratic feedback minimality [J]. IEEE Trans Autom Control, 2002, 47(9): 1487–1491.

[27] Chu D L, Ohta Y, Dragoslav D, et al. Inclusion principle for descriptor systems [J]. IEEE Trans Autom Control, 2009, 54(1): 3–18.

[28] Chu D L, Chan H, Ho DWC. Regularization of singular systems by derivative and proportional output feedback [J]. SIAM J Matrix Anal Appl, 1998, 19: 21-38.

[29] Chu D L, Moor B D. On a variational formulation of QSVD and RSVD [J]. Linear Algebra Appl, 2000, 311(1/2/3): 61–78.

[30] Chu D L, Lathauwer D, Moor B D. On the computation of restricted singular value decomposition via cosine-sine decomposition [J]. SIAM J Matrix Anal Appl, 2000, 22(2): 550–601.

[31] Chu D L, Mehrmann V, Nichols N K. Minimum norm regularization of descriptor systems by mixed output feedback [J]. Linear Algebra Appl, 1999, 296: 39–77.

[32] Wang Q W, Sun J H, Li S Z. Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra [J]. Linear Algebra Appl, 2002,353: 169–182.
文章导航

/