Interval Arithmetic with Containment Sets

The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely accepted, it is necessary to achieve the same for interval computation. The cset of a function over a set in its domain space is the set of all limits of normal function values over that set. It forms a sound basis for defining a number of practical models for interval arithmetic that handle division by zero and related operations in an intuitive and consistent manner. Cset-based systems offer new opportunities for compiler optimization by rearranging interval expressions, achieving tighter bounds by reducing dependencies within the expression. This paper presents basic theory. It discusses division by zero, the need for a global flag to support "loose" evaluation, performance, and semantics. It presents numerical examples using a trial Matlab implementation. Key words. Interval arithmetic, validated...

• Type: Journal
• Year: 2006
• Where: COMPUTING
• Authors: John D. Pryce, George F. Corliss
• Keywords: Computation, COMPUTING 2006, Interval Arithmetic, Normal Function Values