计算矩阵M-P广义逆的一种迭代法  

An Iterative Method for Computing Matrix M-P Generalized Inverse

作　　者：陈荣 

机构地区：[1]长沙理工大学数学与统计学院,湖南 长沙

出　　处：《应用数学进展》2023年第7期3200-3210,共11页Advances in Applied Mathematics

摘　　要：本文提出了一种求解Moore-Penrose广义逆的高阶迭代法,并证明了该方法具有局部九阶收敛速度。此外,我们进行了数值实验,与已有的迭代法进行计算时间对比,结果表明该方法是有效可行的。In this paper, a high order iterative method for solving the Moore-Penrose generalized inverse is proposed, and it is proved that the method has local ninth order convergence rate. In addition, nu-merical experiments are carried out to compare the calculation time with the existing iterative methods, and the results show that the proposed method is effective and feasible.

关 键 词：MOORE-PENROSE广义逆 迭代法 局部收敛速度 

分 类 号：O24[理学—计算数学]