Reflexive solution to a system of matrix equations

We derive necessary and sufficient conditions for the existence and an expression of the （anti）reflexive solution with respect to the nontrivial generalized reflection matrix P to the system of complex matrix equations AX = B and XC = D. The explicit solutions of the approximation problem min x∈Ф ｜｜X - E｜｜F was given, where E is a given complex matrix and Ф is the set of all reflexive （or antireflexive） solutions of the system mentioned above, and ｜｜·｜｜ is the Frobenius norm. Furthermore, it was pointed that some results in a recent paper are special cases of this paper.

THE GENERALIZED REFLEXIVE SOLUTION FOR A CLASS OF MATRIX EQUATIONS (AX-B,XC=D)

In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.

The Reflexive Solutions of the Matrix Equations (AX,XB^H )= (C,D^H )

The matrix equations (AX, XBH)=(C, DH) have been widely used in structural design, parameter identification, linear optimal control, and so on. But few researches studied the reflexive solutions. A new approach for the reflexive solutions to the matrix equations was proposed. By applying the canonical correlation decomposition (CCD) of matrix pairs, the necessary and sufficient conditions for the existence and the general expression for the reflexive solutions of the matrix equations (AX, XBH)=(C, DH) were established. In addition, by using the methods of space decomposition, the expression of the optimal approximation solution to a given matrix was derived.

Generalized bipositive semidefinite solutions to a system of matrix equations

In this paper, a system of complex matrix equations was studied. Necessary and sufficient conditions for the existence and the expression of generalized bipositive semidefinite solution to the system were given. In addition, a criterion for a matrix to be generalized bipositive semidefinite was determined.

The General and Centro(Kewsy) Symmetric Solutions to a System of Matrix Equations over an Arbitrary Skew Field

Necessary and sufficient conditions are given for the existence of the general solution, the centrosymmetric solution, and the centroskewsymmetric solution to a system of linear matrix equations over an arbitrary skew field. The representations of such the solutions of the system are also derived.

Least-Squares Solutions of Matrix Equations(AX = B,XC = D) for Hermitian Reflexive (Anti-Hermitian Reflexive) Matrices and Its Approximation

In this paper,the Hermitian reflexive（Anti-Hermitian reflexive）least-squares so-lutions of matrix equations（AX = B,XC = D）are considered.With special properties of partitioned matrices and Hermitian reflexive（Anti-Hermitian reflexive）matrices,the general expression of the solution is obtained.Moreover,the related optimal approximation problem to a given matrix over the solution set is considered.

Least-Squares Solution of Inverse Problem for Hermitian Anti-reflexive Matrices and Its Appoximation

In this paper, we first consider the least-squares solution of the matrix inverse problem as follows： Find a hermitian anti-reflexive matrix corresponding to a given generalized reflection matrix J such that for given matrices X, B we have minA ｜｜AX - B｜｜. The existence theorems are obtained, and a general representation of such a matrix is presented. We denote the set of such matrices by SE. Then the matrix nearness problem for the matrix inverse problem is discussed. That is： Given an arbitrary A^＊, find a matrix A E SE which is nearest to A^＊ in Frobenius norm. We show that the nearest matrix is unique and provide an expression for this nearest matrix.

Efcient Iterative Solutions to General Coupled Matrix Equations

Linear matrix equations are encountered in many systems and control applications.In this paper,we consider the general coupled matrix equations（including the generalized coupled Sylvester matrix equations as a special case）l t=1EstYtFst = Gs,s = 1,2,···,l over the generalized reflexive matrix group（Y1,Y2,···,Yl）.We derive an efcient gradient-iterative（GI） algorithm for fnding the generalized reflexive solution group of the general coupled matrix equations.Convergence analysis indicates that the algorithm always converges to the generalized reflexive solution group for any initial generalized reflexive matrix group（Y1（1）,Y2（1）,···,Yl（1））.Finally,numerical results are presented to test and illustrate the performance of the algorithm in terms of convergence,accuracy as well as the efciency.