Fast Inclusion of Interval Matrix Multiplication

摘要

This paper is concerned with interval matrix multiplication. New algorithms are proposed to calculate an inclusion of the product of interval matrices using rounding mode controlled computation. The computational cost of the proposed algorithms is almost the same as that for calculating an inclusion of the product of point matrices. Numerical results are presented to illustrate that the new algorithms are much faster than the conventional algorithms and that the guaranteed accuracies obtained by the proposed algorithms are comparable to those of the conventional algorithms.