后勤工程学院学报
後勤工程學院學報
후근공정학원학보
JOURNAL OF LOGISTICAL ENGINEERING UNIVERSITY
2014年
6期
67-71
,共5页
方玲%田艳芳%李玻%陈星
方玲%田豔芳%李玻%陳星
방령%전염방%리파%진성
对称矩阵%最小二乘解%最佳逼近%迭代法
對稱矩陣%最小二乘解%最佳逼近%迭代法
대칭구진%최소이승해%최가핍근%질대법
symmetric matrix%least-squares solution%the nearness problem%iteration method
构造迭代算法研究了矩阵方程[]AXB, GXH =[C, D]，证明了该算法可经有限步得到方程的对称最小二乘解及其最佳逼近，并给出了相关性质。最后，通过数值例子表明该算法是有效的。
構造迭代算法研究瞭矩陣方程[]AXB, GXH =[C, D]，證明瞭該算法可經有限步得到方程的對稱最小二乘解及其最佳逼近，併給齣瞭相關性質。最後，通過數值例子錶明該算法是有效的。
구조질대산법연구료구진방정[]AXB, GXH =[C, D]，증명료해산법가경유한보득도방정적대칭최소이승해급기최가핍근，병급출료상관성질。최후，통과수치례자표명해산법시유효적。
The matrix equation [ ]AXB,GXH =[C,D] is constructed in this paper with an iteration method. With this method, it is proven that the least?squares solutions for symmetric matrix and the nearness problem can be computed within finite iteration steps. And some properties of the iteration method are obtained. Finally, numerical examples are applied to prove the method efficient.
