论文信息 - Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations

Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations

Abstract Two improvements of the iterative method for computing the Moore–Penrose inverse, introduced in Petkovic and Stanimirovic (2011) are introduced. The first improvement defines new choice for the initial approximation and ensures better stability of the method. The second one defines its extension to the set of outer inverses with prescribed range and null space. Numerical examples for both of these improvements are presented.

Predrag S. Stanimirovic | Marko D. Petkovic

[1] Hebing Wu,et al. The representation and approximation for the generalized inverse AT, S(2) , 2003, Appl. Math. Comput..

[2] Iain MacLeod,et al. Generalised Matrix Inversion and Rank Computation by Successive Matrix Powering , 1994, Parallel Comput..

[3] Predrag S. Stanimirovic,et al. Iterative Method for Computing Moore-penrose Inverse Based on Penrose Equations , 2022 .

[4] Y. Wei,et al. The representation and approximations of outer generalized inverses , 2004 .

[5] Vasilios N. Katsikis,et al. An improved method for the computation of the Moore-Penrose inverse matrix , 2011, Appl. Math. Comput..

[6] David C. Cranmer,et al. Conference Report: WORKSHOP ON ASSESSMENT OF TESTING METHODOLOGY FOR GLASS, GLASS-CERAMIC, AND CERAMIC MATRIX COMPOSITES Gaithersburg, MD February 8, 1990 , 1991, Journal of research of the National Institute of Standards and Technology.

[7] Predrag S. Stanimirovic,et al. Successive matrix squaring algorithm for computing outer inverses , 2008, Appl. Math. Comput..

[8] Guoliang Chen,et al. Full-rank representation of generalized inverse AT, S(2) and its application , 2007, Comput. Math. Appl..