A note on the stability of a pth order iteration for finding generalized inverses

Abstract A number of papers intended for the numerical computation of generalized inverses by means of higher-order iterative methods have been published recently. This note investigates the numerical stability of a general family of iterative methods in order to complete the previous studies in this trend of research.

[1]  E. Stickel,et al.  On a class of high order methods for inverting matrices , 1987 .

[2]  William H. Pierce,et al.  A self-correcting matrix iteration for the Moore-Penrose generalized inverse , 1996 .

[3]  Haibin Chen,et al.  A Family of higher-order convergent iterative methods for computing the Moore-Penrose inverse , 2011, Appl. Math. Comput..

[4]  Weiguo Li,et al.  A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix , 2010, Appl. Math. Comput..

[5]  Ernst Schröder,et al.  Ueber unendlich viele Algorithmen zur Auflösung der Gleichungen , 1870 .

[6]  Liu Weiguo,et al.  A family of iterative methods for computing Moore–Penrose inverse of a matrix , 2013 .

[7]  Predrag S. Stanimirovic,et al.  Two improvements of the iterative method for computing Moore-Penrose inverse based on Penrose equations , 2014, J. Comput. Appl. Math..

[8]  Joan-Josep Climent,et al.  A geometrical approach on generalized inverses by Neumann-type series , 2001 .

[9]  Ivan Oseledets,et al.  Approximate inversion of matrices in the process of solving a hypersingular integral equation , 2005 .

[10]  S. S. Prabhu,et al.  Optimal iterative schemes for computing the Moore-Penrose matrix inverse , 1976 .

[11]  Xiaoji Liu,et al.  Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices , 2013 .

[12]  H. Keller,et al.  Analysis of Numerical Methods , 1967 .

[13]  G. Stewart,et al.  On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse , 1974 .