[AXBGXH][CD]对称最小二乘解及最佳逼近的极小残差法  

A Minimal Residual Algorithm for the Matrix Equation[AXB,GXH]=[C,D] over Symmetric Matrix

作　　者：方玲[1] 田艳芳[1] 李玻[1] 陈星[1] 

机构地区：[1]后勤工程学院基础部,重庆401311

出　　处：《后勤工程学院学报》2014年第6期67-71,共5页Journal of Logistical Engineering University

基　　金：后勤工程学院青年科研基金资助(YQ13-420507)

摘　　要：构造迭代算法研究了矩阵方程[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.

关 键 词：对称矩阵 最小二乘解 最佳逼近 迭代法 

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