An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices

Abstract The generalized coupled Sylvester matrix equations AXB + CYD = M , EXF + GYH = N , (including Sylvester and Lyapunov matrix equations as special cases) have numerous applications in control and system theory. An n × n matrix P is called a symmetric orthogonal matrix if P = P T = P - 1 . A matrix X is said to be a generalized bisymmetric with respect to P , if X = X T = PXP . This paper presents an iterative algorithm to solve the generalized coupled Sylvester matrix equations over generalized bisymmetric matrix pair [ X , Y ] . The proposed iterative algorithm, automatically determines the solvability of the generalized coupled Sylvester matrix equations over generalized bisymmetric matrix pair. Due to that I (identity matrix) is a symmetric orthogonal matrix, using the proposed iterative algorithm, we can obtain a symmetric solution pair of the generalized coupled Sylvester matrix equations. When the generalized coupled Sylvester matrix equations are consistent over generalized bisymmetric matrix pair [ X , Y ] , for any (spacial) initial generalized bisymmetric matrix pair, by proposed iterative algorithm, a generalized bisymmetric solution pair (the least Frobenius norm generalized bisymmetric solution pair) can be obtained within finite iteration steps in the absence of roundoff errors. Moreover, the optimal approximation generalized bisymmetric solution pair to a given generalized bisymmetric matrix pair can be derived by finding the least Frobenius norm generalized bisymmetric solution pair of new generalized coupled Sylvester matrix equations. Finally, a numerical example is given which demonstrates that the introduced iterative algorithm is quite efficient.

[1]  Feng Ding,et al.  Iterative least-squares solutions of coupled Sylvester matrix equations , 2005, Syst. Control. Lett..

[2]  M. Dehghan,et al.  Efficient iterative method for solving the second-order sylvester matrix equation EVF 2 -AVF-CV=BW , 2009 .

[3]  Qingwen Wang,et al.  A System of Matrix Equations and a Linear Matrix Equation Over Arbitrary Regular Rings with Identity , 2003 .

[4]  Mehdi Dehghan,et al.  An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation , 2008, Appl. Math. Comput..

[5]  L. Reichel,et al.  Krylov-subspace methods for the Sylvester equation , 1992 .

[6]  Genshiro Kitagawa,et al.  An algorithm for solving the matrix equation X = FXF T + S , 1977 .

[7]  Feng Ding,et al.  Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle , 2008, Appl. Math. Comput..

[8]  Qing-Wen Wang,et al.  Consistency for bi(skew)symmetric solutions to systems of generalized Sylvester equations over a finite central algebra , 2002 .

[9]  Qing-Wen Wang,et al.  Bisymmetric and centrosymmetric solutions to systems of real quaternion matrix equations , 2005 .

[10]  Mehdi Dehghan,et al.  On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations , 2010, Int. J. Syst. Sci..

[11]  Feng Ding,et al.  Hierarchical gradient-based identification of multivariable discrete-time systems , 2005, Autom..

[12]  Zhi-Bin Yan,et al.  Solutions to right coprime factorizations and generalized Sylvester matrix equations , 2008 .

[13]  Guang-Ren Duan,et al.  Gradient based iterative algorithm for solving coupled matrix equations , 2009, Syst. Control. Lett..

[14]  Bin Zhou,et al.  A new solution to the generalized Sylvester matrix equation AV-EVF=BW , 2006, Syst. Control. Lett..

[15]  Mehdi Dehghan,et al.  Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation A1X1B1+A2X2B2=C , 2009, Math. Comput. Model..

[16]  Qing-Wen Wang,et al.  THE REFLEXIVE RE-NONNEGATIVE DEFINITE SOLUTION TO A QUATERNION MATRIX EQUATION ∗ , 2008 .

[17]  Mohamed A. Ramadan,et al.  On the matrix equation x + AT root(2n, X-1)A = 1 , 2006, Appl. Math. Comput..

[18]  Chun-Hua Guo,et al.  Convergence Analysis of the Doubling Algorithm for Several Nonlinear Matrix Equations in the Critical Case , 2009, SIAM J. Matrix Anal. Appl..

[19]  M. Dehghan,et al.  The Reflexive and Anti-Reflexive Solutions of a Linear Matrix Equation and Systems of Matrix Equations , 2010 .

[20]  Mohamed A. Ramadan.  Necessary and sufficient conditions for the existence of positive definite solutions of the matrix equation X+A T X −2 A=I , 2005, Int. J. Comput. Math..

[21]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[22]  Mehdi Dehghan,et al.  ON THE REFLEXIVE SOLUTIONS OF THE MATRIX EQUATION AXB + CYD = E , 2009 .

[23]  Mao-lin Liang,et al.  An efficient algorithm for the generalized centro-symmetric solution of matrix equation A X B = C , 2007, Numerical Algorithms.

[24]  W. Niethammer,et al.  SOR for AX−XB=C , 1991 .

[25]  Qing-Wen Wang,et al.  Ranks and the least-norm of the general solution to a system of quaternion matrix equations , 2009 .

[26]  Yimin Wei,et al.  A new projection method for solving large Sylvester equations , 2007 .

[27]  Imad M. Jaimoukha,et al.  Oblique Production Methods for Large Scale Model Reduction , 1995, SIAM J. Matrix Anal. Appl..

[28]  Guang-Ren Duan,et al.  Solutions to generalized Sylvester matrix equation by Schur decomposition , 2007, Int. J. Syst. Sci..

[29]  Guang-Ren Duan,et al.  On the generalized Sylvester mapping and matrix equations , 2008, Syst. Control. Lett..

[30]  Qing-Wen Wang,et al.  The common solution to six quaternion matrix equations with applications , 2008, Appl. Math. Comput..

[31]  Guang-Ren Duan,et al.  Solutions to a family of matrix equations by using the Kronecker matrix polynomials , 2009, Appl. Math. Comput..

[32]  G. Duan,et al.  An explicit solution to the matrix equation AX − XF = BY , 2005 .

[33]  M. Sadkane,et al.  Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations , 2008 .

[34]  Guang-Ren Duan,et al.  Closed-form solutions to the matrix equation AX − EXF = BY with F in companion form , 2009, Int. J. Autom. Comput..

[35]  Qingling Zhang,et al.  The solution to matrix equation AX+XTC=B , 2007, J. Frankl. Inst..

[36]  Feng Ding,et al.  Hierarchical least squares identification methods for multivariable systems , 2005, IEEE Trans. Autom. Control..

[37]  James Lam,et al.  On Smith-type iterative algorithms for the Stein matrix equation , 2009, Appl. Math. Lett..

[38]  Mehdi Dehghan,et al.  An iterative algorithm for solving a pair of matrix equations AYB=E, CYD=F over generalized centro-symmetric matrices , 2008, Comput. Math. Appl..

[39]  I. Jaimoukha,et al.  Krylov subspace methods for solving large Lyapunov equations , 1994 .

[40]  Feng Ding,et al.  On Iterative Solutions of General Coupled Matrix Equations , 2006, SIAM J. Control. Optim..

[41]  Xi-Yan Hu,et al.  An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB=C , 2005, Appl. Math. Comput..

[42]  David L. Kleinman,et al.  Extensions to the Bartels-Stewart algorithm for linear matrix equations , 1978 .

[43]  Feng Yin,et al.  An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation AXB=C , 2008 .

[44]  Guang-Ren Duan,et al.  Weighted least squares solutions to general coupled Sylvester matrix equations , 2009 .

[45]  Shao-Wen Yu,et al.  On solutions to the quaternion matrix equation AXB+CYD=E , 2008 .

[46]  Mohamed A. Ramadan,et al.  Iterative positive definite solutions of the two nonlinear matrix equations X +/- AT X-2A = I , 2005, Appl. Math. Comput..

[47]  Feng Ding,et al.  Gradient Based Iterative Algorithms for Solving a Class of Matrix Equations , 2005, IEEE Trans. Autom. Control..