Exact real arithmetic using centred intervals and bounded error terms

AbstractApproximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternative to endpoint based implementations of interval analysis