An iterative algorithm for the least squares bisymmetric solutions of the matrix equations A1 X B1 = C1, A2 X B2 = C2

Mathematical and Computer Modelling

Volumn 50, Issue 7-8, 2009, Pages 1237-1244

  Cai, Jing ^a,b   Chen, Guoliang ^a  

^a EAST CHINA NORMAL UNIVERSITY   (China)

^b HUZHOU UNIVERSITY   (China)

Author keywords

Iterative algorithm; Least squares bisymmetric solution; Matrix equation; Optimal approximation solution

Indexed keywords

BISYMMETRIC MATRIX; FROBENIUS NORM; FROBENIUS NORM RESIDUAL PROBLEM; ITERATION STEP; ITERATIVE ALGORITHM; LEAST SQUARE; LEAST SQUARES BISYMMETRIC SOLUTION; MATRIX; MATRIX EQUATION; MATRIX EQUATIONS; NUMERICAL EXAMPLE; OPTIMAL APPROXIMATION; OPTIMAL APPROXIMATION SOLUTION; ROUND-OFF ERRORS; SOLUTION SET;

APPROXIMATION ALGORITHMS; OPTIMIZATION;

ITERATIVE METHODS;

EID: 69249216398     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2009.07.004     Document Type: Article

References (16)

1. 2. Proc. Cambridge Philos. Soc. 74 (1973) 213-216
2. Mitra S.K. A pair of simultaneous linear matrix equations and a matrix programming problem. Linear Algebra Appl. 131 (1990) 97-123
3. Shinozaki N., and Sibuya M. Consistency of a pair of matrix equations with an application. Kieo Eng. Rep. 27 (1974) 141-146
4. J.W. van der Woude, Freeback decoupling and stabilization for linear systems with multiple exogenous variables, Ph.D. Thesis, 1987, pp. 85-199
5. 2 with applications. Comput. Math. Appl. 41 (2001) 929-935
6. Yuan Y.X. Least squares solutions of matrix equation A X B = E, C X D = F. J. East China Shipbuilding Inst. 18 3 (2004) 29-31
7. Deng Y.B., Bai Z.Z., and Gao Y.H. Iterative orthogonal direction methods for Hermitian minimum norm solutions of two consistent matrix equations. Numer. Linear Algebra Appl. 13 (2006) 801-823
8. Peng Y.X., Hu X.Y., and Zhang L. An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations. Appl. Math. Comput. 183 (2006) 1127-1137
9. Sheng X.P., and Chen G.L. A finite iterative method for solving a pair of linear matrix equations (A X B, C X D) = (E, F). Appl. Math. Comput. 189 (2007) 1350-1358
10. Meng T. Experimental design and decision support. In: Leondes (Ed). Expert System, the Technology of Knowledge Management and Decision Making for the 21st Century. Vol. 1 (2001), Academic Press
11. Higham N.J. Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103 (1988) 103-118
12. Jiang Z., and Lu Q. On optimal approximation of a matrix under a spectral restriction. Math. Numer. Sin. 8 (1986) 47-52
13. Peng Z.Y., Hu X.Y., and Zhang L. The inverse problem of bisymmetric matrices. Numer. Linear Algebra Appl. 1 (2004) 59-73
14. Antoniou A., and Lu W.S. Practical Optimization: Algorithm and Engineering Applications (2007), Springer, New York (Chapter 2)
15. l = C and its optimal approximation. Linear Algebra Appl. 426 (2007) 583-595
16. Ben-Israel A., and Greville T.N.E. Generalized Inverse: Theory and Applications. second ed. (2002), Wiley, New York