首页 | 本学科首页   官方微博 | 高级检索  
     检索      

线性子空间上求解矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2的迭代算法
引用本文:周海林.线性子空间上求解矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2的迭代算法[J].计算数学,2017,39(2):213-228.
作者姓名:周海林
作者单位:南京理工大学泰州科技学院, 泰州 225300
摘    要:应用共轭梯度方法,结合线性投影算子,给出迭代算法求解了线性矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2在任意线性子空间上的约束解及其最佳逼近.当矩阵方程组A_1XB_1=C_1,A_2XB_2=C_2相容时,可以证明,所给迭代算法经过有限步迭代可得到矩阵方程组的约束解、极小范数解和最佳逼近.文中的数值例子证实了该算法的有效性.

关 键 词:共轭梯度  投影算子  极小范数解  最佳逼近

AN ITERATIVE ALGORITHM FOR SOLUTIONS OF THE SYSTEM OF MATRIX EQUATIONS A1XB1=C1,A2XB2=C2 OVER LINEAR SUBSPACE
Zhou Hailin.AN ITERATIVE ALGORITHM FOR SOLUTIONS OF THE SYSTEM OF MATRIX EQUATIONS A1XB1=C1,A2XB2=C2 OVER LINEAR SUBSPACE[J].Mathematica Numerica Sinica,2017,39(2):213-228.
Authors:Zhou Hailin
Institution:Taizhou Institute of Sci. & Tech., NUST., Taizhou 225300, China
Abstract:Applying the conjugate gradient method,combined with the linear projection operator,an iterative algorithm is presented to solve the system of linear matrix equations A1XB1=C1,A2XB2=C2 for constrained solution and its optimal approximation over any linear subspace.When the system of matrix equations A1XB1=C1,A2XB2=C2 is consistent,it is proved that the constrained solution,the least-norm solution and the optimal approximation of the system of matrix equations can be obtained within finite iteration steps by the method.Some numerical examples verify the efficiency of the algorithm.
Keywords:conjugate gradient  projection operator  least-norm solution  optimal approximation
本文献已被 CNKI 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号