Interval subdivision

ID: interval-subdivision

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.

New to topics? Read the docs here!