An algorithm is proposed for computing intervals containing the Moore–Penrose inverses. For developing this algorithm, we analyze the Ben-Israel iteration. We particularly emphasize that the algorithm is applicable even for rank deficient matrices. Numerical results show that the algorithm is more successful than previous algorithms in the rank deficient cases.

中文翻译：

---

包围摩尔-彭罗斯逆

提出了一种用于计算包含Moore-Penrose逆的区间的算法。为了开发此算法，我们分析了Ben-Israel迭代。我们特别强调该算法甚至适用于秩不足的矩阵。数值结果表明，该算法在秩不足的情况下比以前的算法更成功。