4.8 Rounded interval arithmetic and its implementation
If floating point arithmetic is used to evaluate these interval
arithmetic equations there is no guarantee that the roundings of the
bounds are performed conservatively.4.1 Rounded interval arithmetic
(RIA)
[254,255,4] ensures that the computed end points
always contain the exact interval as follows:
(4.49)
where
and
are the
units-in-last-place denoted by
and
for each
separate floating point number resulting from the floating point
operations giving the lower and upper bounds in (4.49).
When performing standard
operations for interval numbers using RIA, the lower bound is extended
to include its previous consecutive FP number, which is smaller than
the lower bound by
. Similarly, the upper bound is extended
by
to include its next consecutive FP number. Thus, the width
of the result is enlarged by
and the resulting
enlarged interval contains the exact interval. The RIA concept has
been applied to topologically reliable approximation of curves and
surfaces
[57,58], robust visualization [427], and
approximation of uncertain measured data [425].
Before describing the details of the PP algorithm in RIA, let us briefly
summarize the IEEE standard binary representation for
double precision floating point numbers [4].
This statement is true
only for the default IEEE-754 rounding mode of round towards
nearest [10]. The subject of hardware rounding modes will be
discussed thoroughly later.