Abstract: | A parametric family of fourth‐order schemes for computing the inverse and the Moore‐Penrose inverse of a complex matrix is designed. A particular value of the parameter allows us to obtain a fifth‐order method. Convergence analysis of the different methods is studied. Every iteration of the proposed schemes involves four matrix multiplications. A numerical comparison with other known methods, in terms of the average number of matrix multiplications and the mean of CPU time, is presented. |