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

An Iterative Algorithm for Solving Matrix Equations With Submatrix Constraints

作　　者：农利伟[1] 陈浦胤[2] 

机构地区：[1]南宁地区教育学院数学系,广西南宁530001 [2]上海交通大学数学系,上海200240

出　　处：《南京师大学报（自然科学版）》2010年第4期19-22,共4页Journal of Nanjing Normal University(Natural Science Edition)

基　　金：国家自然科学基金(10771138)

摘　　要：利用文中提出的求解一般有限维算子方程的抽象算法和理论,获得求解带主子阵约束下矩阵方程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.

关 键 词：矩阵方程 迭代算法 最小二乘解 最佳逼近解 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]