next up previous notation contents
Next: 2.13.2 Bumpy Functions Up: 2.13 Interval Sets Previous: 2.13 Interval Sets

2.13.1 Interval Inclusion and Extension

A model tex2html_wrap_inline33607 satisfies the inclusion property for function tex2html_wrap_inline33363 if

math8732

Note that for tex2html_wrap_inline32213 to be contained in tex2html_wrap_inline33497 , tex2html_wrap_inline33615 may be in any member of tex2html_wrap_inline33617 . This follows from the definition of vector containment.

The interval extension tex2html_wrap_inline33607 of g can be defined as before:

math8738

This definition hides a great deal in the seemingly innocuous demotions tex2html_wrap_inline33623 and tex2html_wrap_inline33625 . Consider the case tex2html_wrap_inline33627 . Perfect demotion operators tex2html_wrap_inline33629 and tex2html_wrap_inline33631 can be defined, as follows:

figure8748

The perfect demotion operators describe a demoted function as an infinite collection of points (denoted above as tex2html_wrap_inline33633 ). Although the associated perfect demotion operators tex2html_wrap_inline33635 and tex2html_wrap_inline33637 would describe a function by a finite number of intervals, the size of the descriptions would be unmanageable.

Partial functions may be handled in a natural manner, as the following examples show, for tex2html_wrap_inline33639 :

math8758

math8766

A good model tex2html_wrap_inline33645 of tex2html_wrap_inline33647 would behave as follows:

math8779

A poor model would behave as follows:

math8793

Interval sets may be viewed as a simplification, or a generalization, of extended interval arithmetic, as defined in [32].


next up previous notation contents
Next: 2.13.2 Bumpy Functions Up: 2.13 Interval Sets Previous: 2.13 Interval Sets
Jeff TupperMarch 1996