矩阵方程组$AX=B,XC=D$的Hermitian自反(反Hermitian自反)最小二乘解及其最佳逼近

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.     

ON SOLUTIONS OF QUATERNION MATRIX EQUATIONS XF-AX=BY AND XF-A=BY

In this paper,the quaternion matrix equations XF-AX=BY and XF-A=BY are investigated.For convenience,they were called generalized Sylvesterquaternion matrix equation and generalized Sylvester-j-conjugate quaternion matrix equation,which include the Sylvester matrix equation and Lyapunov matrix equation as special cases.By applying of Kronecker map and complex representation of a quaternion matrix,the sufficient conditions to compute the solution can be given and the expressions of the explicit solutions to the above two quaternion matrix equations XF-AX=BY and XF-A=BY are also obtained.By the established expressions,it is easy to compute the solution of the quaternion matrix equation in the above two forms.In addition,two practical algorithms for these two quaternion matrix equations are give.One is complex representation matrix method and the other is a direct algorithm by the given expression.Furthermore,two illustrative examples are proposed to show the efficiency of the given method.     

反中心对称矩阵的广义特征值反问题

Given matrix X and diagonal matrix A , the anti-centrosymmetric solutions (A, B) and its optimal approximation of inverse generalized eigenvalue problem AX = BXA have been considered. The general form of such solutions is given and the expression of the optimal approximation solution to a given matrix is derived. The algorithm and one numerical example for solving optimal approximation solution are included.     

The Inverse Problem of Centrosymmetric Matrices with a Submatrix Constraint

By using Moore-Penrose generalized inverse and the general singular value decomposition of matrices, this paper establishes the necessary and sufficient conditions for the existence of and the expressions for the centrosymmetric solutions with a submatrix constraint of matrix inverse problem AX = B. In addition, in the solution set of corresponding problem, the expression of the optimal approximation solution to a given matrix is derived.     

矩阵方程ATXA=B的对称正交对称解及其最佳逼近

By applying the generalized singular value decomposition of matrices, this paper provides the necessary and sufficient conditions for the existence and the expression of the symmetric ortho-symmetric solutions of the linear matrix equation A^TXA = B. In addition, the expression of the optimal approximation solution to the given matrix is derived.     

MINIMIZATION PROBLEM FOR SYMMETRIC ORTHOGONAL ANTI-SYMMETRIC MATRICES

By applying the generalized singular value decomposition and the canonical correlation decomposition simultaneously, we derive an analytical expression of the optimal approximate solution ^-X, which is both a least-squares symmetric orthogonal anti-symmetric solu- tion of the matrix equation A^TXA = B and a best approximation to a given matrix X^＊. Moreover, a numerical algorithm for finding this optimal approximate solution is described in detail, and a numerical example is presented to show the validity of our algorithm.     

LEAST—SQUARES SOLUTION OF AXB=D OVER SYMMETRIC POSITIVE SEMIDEFINITE MATRICES X

Least-squares solution of AXB=D with respect to symmetric positive semidefinite matrix X is considered.By making use of the generalized singular value ecomposition,we derive general analytic formulas,and present necessary and sufficient conditions for guaranteeing the existence of the solution.By applying MATLAB 5.2，we give some numerical examples to show the feasibility and accuracy of this construciton technique in the finite precision arithmetic.     

GLOBAL EXISTENCE OF SOLUTIONS OF CAUCHY PROBLEM FOR GENERALIZED BBM-BURGERS EQUATION

In this paper, the existence and the uniqueness of the local generalized solution and the local classical solution of the Cauchy problem for the generalized BBM-Burgers equationare proved. The existence and the uniqueness of the global generalized solution and the global classical solution for the Cauchy problem of equation （1） are proved when n = 3, 2, 1. Moreover, the decay property of the solution is discussed.     

Least-Squares Solutions of the Matrix Equation A^T XA = B Over Bisymmetric Matrices and its Optimal Approximation

A real n×n symmetric matrix X=(x_(ij))_(n×n)is called a bisymmetric matrix if x_(ij)=x_(n 1-j,n 1-i).Based on the projection theorem,the canonical correlation de- composition and the generalized singular value decomposition,a method useful for finding the least-squares solutions of the matrix equation A~TXA=B over bisymmetric matrices is proposed.The expression of the least-squares solutions is given.Moreover, in the corresponding solution set,the optimal approximate solution to a given matrix is also derived.A numerical algorithm for finding the optimal approximate solution is also described.     

MATRIX EQUATION AXB = E WITH PX = sXP CONSTRAINT

The matrix equation AXB = E with the constraint PX=sXP is considered,where P is a given Hermitian matrix satisfying p~2=I and s=±1.By an eigenvalue decomposition of P,the constrained problem can be equivalently transformed to a well-known unconstrained problem of matrix equation whose coefficient matrices contain the corresponding eigenvector, and hence the constrained problem can be solved in terms of the eigenvectors of P.A simple and eigenvector-free formula of the general solutions to the constrained problem by generalized inverses of the coefficient matrices A and B is presented.Moreover,a similar problem of the matrix equation with generalized constraint is discussed.     

一类Riccati矩阵方程广义自反解的双迭代算法

本文研究了一类Riccati矩阵方程广义自反解的数值计算问题.利用牛顿算法将Riccati矩阵方程的广义自反解问题转化为线性矩阵方程的广义自反解或者广义自反最小二乘解问题,再利用修正共轭梯度法计算后一问题,获得了求Riccati矩阵方程的广义自反解的双迭代算法.拓宽了求解非线性矩阵方程的迭代算法.数值算例表明双迭代算法是有效的.     

线性流形上的广义反射矩阵反问题

设 R∈C^m×m 及 S∈C^n×n 是非平凡Hermitian酉矩阵, 即 R^H=R=R^-1≠±I_m ,S^H=S=S^-1≠±I_n.若矩阵 A∈C^m×n 满足 RAS=A, 则称矩阵 A 为广义反射矩阵.该文考虑线性流形上的广义反射矩阵反问题及相应的最佳逼近问题.给出了反问题解的一般表示, 得到了线性流形上矩阵方程AX₂=Z₂, Y₂^H A=W₂^H 具有广义反射矩阵解的充分必要条件, 导出了最佳逼近问题唯一解的显式表示.     

矩阵方程AX-XTB=C的解

通过引入矩阵的广义逆构造性地给出矩阵方程 AX-XTB=C的特解 ,同时通过不同的方法给出其所对应的齐次方程 AX-XTB=O解的两种不同形式 .从而得到了矩阵方程 AX-XTB=C两种不同形式的解 .     

矩阵方程AXA~T+BYB~T=C的亚半正定解

讨论了矩阵方程AXAT+BYBT=C关于亚半正定矩阵X,Y有解的充要条件,并在有解时给出了解的通式.     

Neumann-type expansion of reflexive generalized inverses of a matrix and the hyperpower iterative method

Neumann-type series expansion of reflexive generalized inverses of a matrix is investigated, and [dota] necessary and sufficient condition is given in relation to the expansion for the convergence of the hyperpower iterative method for generating reflexive generalized inverses.     

四元数矩阵方程∑A~iXB_i=E

设ＨＦ为域Ｆ上广义四元数可除代数，其中ｃｈａｒＦ≠２．应用伴随矩阵与矩阵表示方法，本文得到ＨＦ上矩阵方程∑ｋｉ＝０ＡｉＸＢｉ＝Ｅ有解或有唯一解的几个充要条件，并且给出了几个解的公式．     

广义四元数矩阵方程AX-DXB=R

设HF为域F上的广义四元数除环，ChF≠2。本文利用拟线性变换T（X）＝AX－DXB讨论HF上矩阵方程AX－DXB＝R的求解问题，获得了上方程存在（唯一）解的几个充分必要条件，并给出了解的显式公式。     

矩阵方程AX=B的转动不变解及其最佳逼近

利用矩阵的广义逆、奇异值分解、张量积和拉直算子,给出了矩阵方程AX=B有转动不变解的充分必要条件及有解时通解的表达式;给出了矩阵方程解集合中与给定矩阵的最佳逼近解的表达式.