Interval Plotting and Global Optimization, Part 1
Roman E. Maeder
Interval arithmetic provides a way of extending the action of elementary functions from points to intervals. It uses directional rounding to assure that for a point x and an interval i, f(x) lies in f(i) whenever x lies in i. It is closely related to Mathematica's ordinary arbitrary-precision arithmetic but its emphasis is on obtaining global results, not on high-precision computation. Two applications, interval plots and global minimization, show some of the results obtainable with interval arithmetic. Along the way, we encounter various data structures for stacks and priority queues.
Converted by Mathematica September 21, 1999