Given an interval matrix A and an interval matrix X0 that contains the inverses of all matrices of A, the author gives explicit conditions (too complex to be stated here) for strictly reducing the width of X0 (by using an iterative algorithm) while retaining the inverse of A. The author does not claim that the limit will yield the minimal inverse interval matrix. Numerical examples show that usually only the first iteration step gives a sizeable improvement.
