求一类矩阵方程组的最小二乘行对称解及其最佳逼近的迭代法  

An Iterative Method for the Least Squares Row Symmetric Solution of a Class of the Matrix Equations and Its Optimal Approximation

作　　者：胡荣[1] 张磊[1] 

机构地区：[1]湖南大学

出　　处：《数学理论与应用》2010年第4期118-121,共4页Mathematical Theory and Applications

基　　金：国家自然科学基金资助项目(No.10571047)资助

摘　　要：本文构造了求矩阵方程组AX=B,XC=D的最小二乘行对称解及其最佳逼近的迭代法,研究了迭代序列的性质,证明了算法的收敛性。In this paper,an algorithm is constructed to solve the least squares row symmetric solution of the matrix equations AX=B,XC=D and its optimal approximation.Some properties of the iterative sequence have been derived,and the method has been shown to preserve convergence properties.

关 键 词：迭代法 梯度矩阵 行对称解 

分 类 号：O241.6[理学—计算数学]