Acta mathematica scientia,Series A ›› 2015, Vol. 35 ›› Issue (1): 131-150.

• Articles • Previous Articles     Next Articles

The Bisymmetric Least Squares Solutions of the General Coupled |Matrix Equations with A Submatrix Constraint

 PENG Zhuo-Hua   

  1. School of Mathematics and Computing Science, Hunan University of Science and Technology, Hunan Xiangtan 411201
  • Received:2013-12-06 Revised:2014-11-29 Online:2015-02-25 Published:2015-02-25

Abstract:

The general coupled matrix equations ,   have numerous applications in  control and system theory.    In this paper, an algorithm is constructed   to solve the   general coupled matrix equations where   is a bisymmetric  matrix with a specified central  principal submatrix. The algorithm produces suitable
  such that      is minimized within a finite iteration steps in the absence of roundoff errors.
  The algorithm requires little storage capacity.    Numerical examples are given to show that the algorithm is efficient.

Key words: General coupled matrix equations ,  Central principal submatrix ,  Bisymmetric solution ,  Submatrix constraint ,  Least squares solution.

CLC Number: 

  • 65F10
Trendmd