计算矩阵M-P广义逆的一种迭代法
An Iterative Method for Computing Matrix M-P Generalized Inverse
DOI: 10.12677/AAM.2023.127320, PDF,   
作者: 陈 荣:长沙理工大学数学与统计学院,湖南 长沙
关键词: Moore-Penrose广义逆迭代法局部收敛速度Moore-Penrose Generalized Inverse Iterative Method Local Convergence Rate
摘要: 本文提出了一种求解Moore-Penrose广义逆的高阶迭代法,并证明了该方法具有局部九阶收敛速度。此外,我们进行了数值实验,与已有的迭代法进行计算时间对比,结果表明该方法是有效可行的。
Abstract: 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.
文章引用:陈荣. 计算矩阵M-P广义逆的一种迭代法[J]. 应用数学进展, 2023, 12(7): 3200-3210. https://doi.org/10.12677/AAM.2023.127320

参考文献

[1] Moore, E.H. (1920) On the Reciprocal of the General Algebraic Matrix. Bulletin of the American Mathematical Society, 26, 394-395. [Google Scholar] [CrossRef
[2] Penrose, R. (1955) A Generalized Inverse for Matrices. Mathematical Proceedings of the Cambridge Philosophical Society, 51, 406-413. [Google Scholar] [CrossRef
[3] Schulz, G. (1933) Iterative Berechung der reziproken Matrix. Journal of Applied Mathematics and Mechanics, 13, 57-59. [Google Scholar] [CrossRef
[4] Penrose, R. (1956) On Best Approximate Solutions of Linear Matrix Equations. Mathematical Proceedings of the Cambridge Philosophical Society, 52, 17-19. [Google Scholar] [CrossRef
[5] Li, W.G. and Li, Z. (2010) A Family of Iterative Methods for Computing the Approximate Inverse of a Square Matrix and Inner Inverse of a Non-Square Matrix. Applied Mathematics and Computation, 215, 3433-3442. [Google Scholar] [CrossRef
[6] Li, H.B., Huang, T.Z., Zhang, Y., Liu, X.P. and Gu, T.X. (2011) Chebyshev-Type Methods and Preconditioning Techniques. Applied Mathematics and Computation, 218, 260-270. [Google Scholar] [CrossRef
[7] Krishnamurthy, E.V. (1986) Numerical Algorithms: Computations in Science and Engineering. Affiliated East-West Press, New Delhi.
[8] Soleymani, F. (2014) On Finding Robust Ap-proximate Inverses for Large Sparse Matrices. Linear and Multilinear Algebra, 62, 1314-1334. [Google Scholar] [CrossRef
[9] Soleymani, F., Stanimirović, P.S. and Ullah, M.Z. (2013) An Accelerated Iterative Method for Computing Weighted Moore—Penrose Inverse. Applied Mathematics and Computation, 222, 365-371. [Google Scholar] [CrossRef
[10] Soleymani, F. (2012) A Rapid Numerical Algorithm to Compute Matrix Inversion. International Journal of Mathematics and Mathematical Sciences, 2012, Article ID: 134653. [Google Scholar] [CrossRef
[11] Weiguo, L., Juan, L. and Tiantian, Q. (2013) A Family of Iterative Methods for Computing Moore—Penrose Inverse of a Matrix. Linear Algebra and Its Applications, 438, 47-56. [Google Scholar] [CrossRef
[12] Pan, V.Y. (2010) Newton’s Iteration for Matrix Inversion, Advances and Extensions. In: Olshevsky, V. and Tyrtyshnikov, E., Eds., Matrix Methods: Theory, Algorithms and Applications, Imperial College Press, London, 364-381. [Google Scholar] [CrossRef
[13] Wei, Y.M. (2000) Successive Matrix Squaring Algorithm for Computing the Drazin Inverse. Applied Mathematics and Computation, 108, 67-75. [Google Scholar] [CrossRef
[14] Iram, Z.A. and Zein, A. (2022) A New Family of Sec-ond-Order Iterative Methods for Computing the Moore Penrose Inverse Based on Penrose Equations. International Journal of Applied Mathematics, 35, 365-380. [Google Scholar] [CrossRef
[15] Kaur, M., Kansal, M. and Kumar, S. (2021) An Efficient Matrix Iterative Method for Computing Moore—Penrose Inverse. Mediterranean Journal of Mathematics, 18, Article No. 42. [Google Scholar] [CrossRef