摘要

In this paper, we present an iterative method based on gradient maximal convergence rate to compute Moore-Penrose inverse A(dagger) of a given matrix A. By this iterative method, when taken the initial matrix X-0 = A*, the M-P inverse A(dagger) can be obtained with maximal convergence rate in absence of roundoff errors. In the end, a numerical example is given to illustrate the effectiveness, accuracy and its computation time, which are all superior than the other methods for the large singular matrix.

全文