A fourth-order iterative method for computing the Moore-Penrose inverse

zbMATH Open1416.65112MaRDI QIDQ5225599FDOQ5225599

Authors: H. Esmaeili, Raziyeh Erfanifar, Mahdis Rashidi 

Publication date: 22 July 2019

Full work available at URL: http://www.jhs-uma.com/index.php/JHSMS/article/view/249/99

Recommendations

• An efficient method to compute the Moore-Penrose inverse
• A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
• Higher order iterations for Moore-Penrose inverses
• Iterative method for computing the Moore-Penrose inverse based on Penrose equations
• A third order iterative method for \(A^\dagger\)

zbMATH Keywords

iterative methodmatrix multiplicationMoore-Penrose inversefourth-order convergenceSchulz-type method

Mathematics Subject Classification ID

Roundoff error (65G50) Theory of matrix inversion and generalized inverses (15A09)

Cited In (10)

• Unified frameworks for high order Newton-Schulz and Richardson iterations: a computationally efficient toolkit for convergence rate improvement
• Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations
• A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
• Approximating the inverse and the Moore-Penrose inverse of complex matrices
• An efficient method to compute the Moore-Penrose inverse
• Finding the Moore-Penrose inverse by a new matrix iteration
• An efficient quadratically convergent iterative method to find the Moore-Penrose inverse
• An efficient matrix iterative method for computing Moore-Penrose inverse
• Higher order iterations for Moore-Penrose inverses
• An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse

This page was built for publication: A fourth-order iterative method for computing the Moore-Penrose inverse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225599)