Outward rounding replaces an exact lower endpoint by a representable value no larger than it, and an exact upper endpoint by a representable value no smaller than it. This preserves an interval enclosure under floating-point arithmetic. In the binary numeral system, most rational numbers cannot be represented exactly with finitely many digits, so the rounding direction is essential even for elementary calculations. Rump explains directed rounding and its use in interval bounds in §§4 and 5.3 of his survey.[ref]
https://www.tuhh.de/ti3/paper/rump/Ru10.pdf. Siegfried M. Rump, Verification methods: rigorous results using floating-point arithmetic, Acta Numerica 19, 287–449, 2010, §§4 and 5.3
To see the issue without long binary digit strings, use an illustrative decimal grid with step . Exact interval division gives . Rounding both endpoints to the nearest grid value gives , which excludes the true answer because . Outward rounding instead givesThis decimal toy illustrates the rule; its displayed endpoints are not the results of binary directed rounding. Real implementations need valid outward rounding throughout the calculation, including input conversion and intermediate interval arithmetic operations; rounding only the final output cannot repair an earlier lost bound. INTLAB's tutorial demonstrates why decimal input strings and previously rounded intermediate values need care.[ref]
https://www.tuhh.de/ti3/rump/intlab/demos/html/dintval.html. Rump, Interval computations in INTLAB, How to define an interval II and Invoking interval operations
Outward rounding encloses one third on a decimal toy grid; sign-changing interval products require all four endpoint combinations
. Above: rounding to the nearest decimal grid point misses , while down to and up to enclose it. Below: the Cartesian product of and has endpoint products , giving . The two same-side endpoint products alone give the invalid enclosure . Details. New to topics? Read the docs here!
