�T�v�F A fast algorithm for computing an interval matrix
containing the inverse square root of a matrix is
proposed. This algorithm involves only cubic complexity,
and moreover verifies the principal property and
uniqueness of the contained inverse square root.
Numerical results show the effectiveness of the algorithm.