Fast Multiplication of Interval Matrices (Interval Version of Strassen's Algorithm)

Authors

Martine Ceberio, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

10-2003

Comments

Technical Report: UTEP-CS-03-27

Published in Reliable Computing, 2004, Vol. 10, No. 3, pp. 241-243.

Abstract

Strassen's algorithm multiplies two numerical matrices fast, but when applied to interval matrices, leads to excess width. We use Rump's interval arithmetic to propose an interval version of Strassen's algorithm whose only excess width is in second order terms.