摘要
提出一种求矩阵方程AX+XB=D反中心对称解的递推算法,该算法不仅能够判断反中心对称解的存在性,而且能够计算反中心对称解.选取特殊的初始矩阵时,该算法可以求出矩阵方程的极小范数反中心对称解,以及对给定矩阵进行最佳逼近的反中心对称解.
An iterative method is presented to find centroskew symmetric solution of the matrix equations AX＋XB=D, the method is used not only to determine the solvability over centroskew symmetric solution, but also to calculate centroskew symmetric solution. The solution with least norm can be obtained by choosing a special kind of initial anti-symmetric matrix. Finally, its optimal approximation solution tao a given matrix can be derived.
出处
《固原师专学报》
2006年第6期22-26,共5页
Journal of Guyuan Teachers College
基金
宁夏大学数学计算机学院青年基金资助项目(0506)
