Interval iterative methods for computing Moore–Penrose inverse

摘要

In this paper, we import interval method to the iteration for computing Moore–Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results. The convergence of the interval iteration is proven. We also give some numerical examples to compare interval iteration with classical Newton iteration.