求解主子阵约束下矩阵方程的算法

An Iterative Algorithm for Solving Matrix Equations With Submatrix Constraints

利用文中提出的求解一般有限维算子方程的抽象算法和理论,获得求解带主子阵约束下矩阵方程AXB=C反对称最小二乘解及最佳逼近解的一个迭代算法,进行了理论分析.并给出数值例子说明算法的计算效果.

By use of the abstract algorithm and theoretical analysis in [ 1 ] for solving a finite-dimensional operator equation, this paper proposes an iterative algorithms for getting the skew-symmetric least-squares solution and the best approximation solution of the matrix equation AXB = C with a submatrix constraint. The convergence analysis of the algorithm is presented and several numerical examples are reported to illustrate its computational performance.