Sage Journals: Discover world-class research

Abstract

In many areas of principal component analysis, biology, electricity, solid mechanics, automatics control theory and vibration theory, linear matrix equations can be encountered. The presented paper proposes first an iterative method for finding the generalized bisymmetric solution to the generalized coupled Sylvester matrix equations. Second, when the generalized coupled Sylvester matrix equations matrix are consistent, for any generalized bisymmetric initial iterative matrix pair, we can obtain the generalized bisymmetric solution within finite iterative steps in the absence of round-off errors. Furthermore, the optimal approximate generalized bisymmetric solution of the matrix equation for a given generalized bisymmetric matrix can be obtained by finding the least-norm generalized bisymmetric solution of new generalized coupled Sylvester matrix equations. Finally, numerical examples are presented to support the theoretical results of this paper.

Keywords

Coupled Sylvester matrix equations iterative method;bisymmetric solution least norm generalized solution optimal approximation solution

Get full access to this article

View all access options for this article.

References

Bartels

Stewart

(1972) Solution of the matrix equation

AX + XB = C

. Communications of the ACM 15(9): 820–826.

Carvalho

Datta

(2002) An algorithm for generalized Sylvester-observer equation in state estimation of descriptor linear systems. Proceedings of the 41st IEEE Conference Decision and Control, Las Vegas, NV, pp. 3021–3026.

Castelan

da Silva

(2005) On the solution of a Sylvester equation appearing in descriptor linear systems control theory. Systems & Control Letters 54(2): 109–117.

Datta

(1995) Numerical Linear Algebra and Applications. Pacific Grove, CA: Brooks/Cole Publishing Co.

Datta

(2003) Krylov subspace methods for large-scale matrix problems in control. Future Generation Computer Systems 19(7): 1253–1263.

Dehghan

Hajarian

(2008a) An iterative algorithm for solving a pair of matrix equations

AYB = E, CYD = F

over generalized centro-symmetric matrices. Computers & Mathematics with Applications 56(12): 3246–3260.

Dehghan

Hajarian

(2008b) An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation. Applied Mathematics and Computation 202(2): 571–588.

Dehghan

Hajarian

(2009a) Efficient iterative method for solving the second-order Sylvester matrix equation

EV F^{2} - AVF - CV = BW

. IET Control Theory & Applications 3(10): 1401–1408.

Dehghan

Hajarian

(2009b) Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation

A_{1} X B_{1} + A_{2} X B_{2} = C

. Mathematical and Computer Modelling 49(9–10): 1937–1959.

10.

Dehghan

Hajarian

(2009c) On the reflexive solutions of the matrix equation

AXB + CYD = E

. Bulletin of the Korean Mathematical Society 46(3): 511–519.

11.

Dehghan

Hajarian

(2010a) An iterative method for solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices. Applied Mathematical Modelling 34(3): 639–654.

12.

Dehghan

Hajarian

(2010b) On the reflexive and anti-reflexive solutions of the generalized coupled Sylvester matrix equations. International Journal of Systems Science 41(6): 607–625.

13.

Dehghan

Hajarian

(2010c) The reflexive and anti-reflexive solutions of a linear matrix equation and systems of matrix equations. Rocky Mountain Journal of Mathematics 40(3): 825–848.

14.

Ding

Chen

(2005a) Gradient based iterative algorithms for solving a class of matrix equations. IEEE Transactions on Automatic Control 50(8): 1216–1221.

15.

Ding

Chen

(2005b) Hierarchical gradient-based identification of multivariable discrete-time systems. Automatica 41(2): 315–325.

16.

Ding

Chen

(2005c) Hierarchical least squares identification methods for multivariable systems. IEEE Transactions on Automatic Control 50(3): 397–402.

17.

Ding

Chen

(2005d) Iterative least squares solutions of coupled Sylvester matrix equations. Systems & Control Letters 54(2): 95–107.

18.

Ding

Chen

(2006) On iterative solutions of general coupled matrix equations. SIAM Journal on Control and Optimization 44(6): 2269–2284.

19.

Ding

Liu

Ding

(2008) Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle. Applied Mathematics and Computation 197(1): 41–50.

20.

Duan

(1992) Solution to matrix equation

AV + BW = EVF

and eigenstructure assignment for descriptor systems. Automatica 28(3): 639–643.

21.

Duan

(1993) Solution to matrix equation

AV + BW = EVF

and their application to eigenstructure assignment in linear systems. IEEE Transactions on Automatic Control 38(2): 276–280.

22.

Duan

(1998) Eigenstructure assignment and response analysis in descriptor linear systems with state feedback control. International Journal of Control 69(5): 663–694.

23.

Fletcher

Kautasky

Nichols

(1986) Eigenstructure assignment in descriptor systems. IEEE Transactions on Automatic Control 31(12): 1138–1141.

24.

Golub

Nash

Van Loan

(1979) A Hessemberg–Schur method for the problem

AX + XB = C

. IEEE Transactions on Automatic Control 24(6): 909–913.

25.

Golub

Van Loan

(1996) Matrix Computations, 3rd ed. Baltimore, MD: The Johns Hopkins University Press.

26.

Hou

Peng

Zhang

(2006) An iterative method for the least squares solution of matrix equation

AXB = C

. Numerical Algorithms 42(2): 181–192.

27.

Huang

Yin

Guo

(2008) An iterative method for the skew–symmetric solution and the optimal approximate solution of the matrix equation

AXB = C

. Journal of Computational and Applied Mathematics 212(2): 231–244.

28.

Kaabi

(2007) On the numerical solution of large scale Sylvester matrix equations. Applied Mathematical Sciences 1(58): 2895–2905.

29.

(2008) Symmetric and skew–antisymmetric solutions to systems of real quaternion matrix equations. Computers & Mathematics with Applications 55(6): 1142–1147.

30.

Monsalve

(2008) Block linear method for large scale Sylvester equations. Computational & Applied Mathematics 27(1): 47–59.

31.

Peng

Zhang

(2005) An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation

AXB = C

. Applied Mathematics and Computation 160(3): 763–777.

32.

Peng

Zhang

(2006) An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations

A_{1} X B_{1} = C_{1}, A_{2} X B_{2} = C_{2}

. Applied Mathematics and Computation 183(2): 1127–1137.

33.

Wang

Cheng

Wei

(2007) Iterative algorithms for solving the matrix equation

AXB + C X^{T} D = E

. Applied Mathematics and Computation 187(2): 622–629.

34.

Duan

(2007) Generalized PID observer design for descriptor linear systems. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 37(5): 1390–1395.

35.

Duan

Zhou

(2008a) Solution to generalized Sylvester matrix equation. IEEE Transactions on Automatic Control 53(3): 811–815.

36.

Zhu

Duan

. (2008b) Solving the generalized Sylvester matrix equation

AV + BW = EVF

via a Kroncker map. Applied Mathematical Letters 21(10): 1069–1073.

37.

Xing ping

Guoliang

(2007) A finite iterative method for solving a pair of linear matrix equations

(AXB, CYD) = (E, F)

. Applied Mathematics and Computation 189(2): 1350–1358.

38.

Zhou

Duan

(2006) A new solution to the generalized Sylvester matrix equation

AV - EVF = BW

. Systems & Control Letters 55(3): 193–198.

39.

Zhou

Duan

(2007) Solutions to generalized Sylvester matrix equation by Schur decomposition. International Journal of Systems Science 38(5): 369–375.

40.

Zhou

Duan

(2009) Gradient based iterative algorithm for solving coupled matrix equations. Systems & Control Letters 58(5): 327–333.

Solving the generalized coupled Sylvester matrix equations over generalized bisymmetric matrices

Abstract

Keywords

Get full access to this article

References