Interval Plotting and Global Optimization, Part 2
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 and an interval lies in whenever lies in . It is closely related to Mathematica's ordinary arbitrary-precision arithmetic but its emphasis is on obtaining global results, not on high-precision computation. Last issue (TMJ 7:3) we looked at two applications, interval plots and global minimization, showing some of the results obtainable with interval arithmetic. In this installment we encounter various data structures for stacks and priority queues.
Converted by Mathematica April 7, 2000