On the Eciency of Interval Multiplication Algorithms
Evgenija D. Popova · 1998
In this paper we present the theoretical base for some modifications in interval multiplication algorithms. A diversity of proposed implementation approaches is summarized along with a discussion on their costeciency. It is shown that some improvements can be achieved by utilizing some properties of interval multiplication formulae and no special hardware support. Both conventional and extended interval multiplication operations are considered.