For closed intervals and , exact addition, subtraction and multiplication give
These interval arithmetic operations describe all results for in the Cartesian product : the two inputs are allowed to vary independently. Independence here means freedom to choose either input anywhere in its closed interval; it does not assert anything about probability. For example, and .
All four endpoint products matter when signs change. For and , the endpoint products are , so . Taking just and , even after sorting them, would give and lose valid negative products.
For division, if , the multiplicative inverse gives and . Thus . This ordinary finite-closed interval rule requires a denominator that excludes zero. When the denominator contains zero, division is undefined for some pairs and can become unbounded near zero; these formulas cannot supply a finite interval enclosure of all quotients. The operations above use exact endpoints; a computer implementation must also apply outward rounding.
A natural interval extension evaluates a chosen expression by replacing its arithmetic operations with interval arithmetic operations, its constants with enclosing closed intervals, and any additional functions with valid interval enclosures. Each intermediate result must remain defined on its inputs. The resulting encloses the actual image of a function , but its width depends on the expression used. Rump's INTLAB tutorial describes this inclusion principle and warns that repeated inputs can produce severe overestimation.[ref]
The interval dependency problem is the loss of relationships between repeated occurrences of the same input. For , interval subtraction gives : it permits with independent choices . But the function has actual image of a function . Giving both operands the name does not tell an interval arithmetic calculation to enforce .
For the polynomial on , the natural interval extension is
This allows the impossible combination in the first factor and in the second, producing the spurious upper bound . In the actual function, both occurrences use the same . Completing the square gives , which lies between and on ; every value between these bounds occurs, by continuity and the intermediate value theorem. The maximum occurs at , while either endpoint gives the minimum .
Figure 1.
Independent interval inputs lose the diagonal constraint; subdivision tightens the enclosure of x times one minus x
. Left: the Cartesian product permits separate choices , while the actual function uses only . Right: rectangles from four pieces contain the polynomial curve. Below: one, two and four pieces give interval enclosures with upper bounds , and ; the interval square range gives the exact . Details.
Interval subdivision covers by smaller closed intervals , computes a valid interval enclosure on each, and takes their union. Every allowed input belongs to a piece, so its output belongs to that union. If one closed interval is wanted, take the smallest one containing the union; gaps between separate output pieces can then be lost. Splitting narrows the freedom given to repeated inputs, while increasing the number of evaluations.
For , split at . The natural interval extensions are
Their union is . Four equal pieces sharpen the upper bound again:
The union is now , still wider than the actual image of a function . These are exact rational number bounds: the excess width comes from the interval dependency problem, rather than roundoff error.
The interval square range treats squaring as one function of one input. For it is exactly
It retains the relationship that ordinary interval multiplication loses: for , the interval square range is , whereas the independent-input product is .
Consequently, completing the square for and using the interval square range gives
This is the exact image of a function on . Merely rewriting the expression and evaluating gives , so it does not achieve the same sharpening. A mathematical must be interpreted explicitly here: a square range operation and an independent-input interval product have different meanings. Choosing an operation that preserves known structure can save many steps of interval subdivision.

Articles by others on the same topic (0)

There are currently no matching articles.