Trisha Shetty (Editor)

Interval propagation

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Interval propagation

In numerical mathematics, interval propagation or interval constraint propagation is the problem of contracting interval domains associated to variables of R without removing any value that is consistent with a set of constraints (i.e., equations or inequalities). It can be used to propagate uncertainties in the situation where errors are represented by intervals. Interval propagation considers an estimation problem as a constraint satisfaction problem.

Contents

Atomic contractors

A contractor associated to an equation involving the variables x1,...,xn is an operator which contracts the intervals [x1],..., [xn] (that are supposed to enclose the xi's) without removing any value for the variables that is consistent with the equation.

A contractor is said to be atomic if it is not built as a composition of other contractors. The main theory that is used to build atomic contractors are based on interval analysis.

Example. Consider for instance the equation

x 1 + x 2 = x 3 ,

which involves the three variables x1,x2 and x3.

The associated contractor is given by the following statements

[ x 3 ] := [ x 3 ] ∩ ( [ x 1 ] + [ x 2 ] ) [ x 1 ] := [ x 1 ] ∩ ( [ x 3 ] − [ x 2 ] ) [ x 2 ] := [ x 2 ] ∩ ( [ x 3 ] − [ x 1 ] )

For instance, if

x 1 ∈ [ − ∞ , 5 ] , x 2 ∈ [ − ∞ , 4 ] , x 3 ∈ [ 6 , ∞ ]

the contractor performs the following calculus

x 3 = x 1 + x 2 ⇒ x 3 ∈ [ 6 , ∞ ] ∩ ( [ − ∞ , 5 ] + [ − ∞ , 4 ] ) = [ 6 , ∞ ] ∩ [ − ∞ , 9 ] = [ 6 , 9 ] . x 1 = x 3 − x 2 ⇒ x 1 ∈ [ − ∞ , 5 ] ∩ ( [ 6 , ∞ ] − [ − ∞ , 4 ] ) = [ − ∞ , 5 ] ∩ [ 2 , ∞ ] = [ 2 , 5 ] . x 2 = x 3 − x 1 ⇒ x 2 ∈ [ − ∞ , 4 ] ∩ ( [ 6 , ∞ ] − [ − ∞ , 5 ] ) = [ − ∞ , 4 ] ∩ [ 1 , ∞ ] = [ 1 , 4 ] .

For other constraints, a specific algorithm for implementing the atomic contractor should be written. An illustration is the atomic contractor associated to the equation

x 2 = sin ⁡ ( x 1 ) ,

is provided by Figures 1 and 2.

Decomposition

For more complex constraints, a decomposition into atomic constraints (i.e., constraints for which an atomic contractor exists) should be performed. Consider for instance the constraint

x + sin ⁡ ( x y ) ≤ 0 ,

could be decomposed into

a = x y b = sin ⁡ ( a ) c = x + b .

The interval domains that should be associated to the new intermediate variables are

a ∈ [ − ∞ , ∞ ] , b ∈ [ − 1 , 1 ] , c ∈ [ − ∞ , 0 ] .

Propagation

The principle of the interval propagation is to call all available atomic contractors until no more contraction could be observed. As a result of the Knaster-Tarski theorem, the procedure always converges to intervals which enclose all feasible values for the variables. A formalization of the interval propagation can be made thanks to the contractor algebra. Interval propagation converges quickly to the result and can deal with problems involving several hundred of variables.

Example

Consider the electronic circuit of Figure 3.

Assume that from different measurements, we know that

E ∈ [ 23 V , 26 V ] I ∈ [ 4 A , 8 A ] U 1 ∈ [ 10 V , 11 V ] U 2 ∈ [ 14 V , 17 V ] P ∈ [ 124 W , 130 W ] R 1 ∈ [ 0 Ω , ∞ [ R 2 ∈ [ 0 Ω , ∞ [ .

From the circuit, we have the following equations

P = E I U 1 = R 1 I U 2 = R 2 I E = U 1 + U 2 .

After performing the interval propagation, we get

E ∈ [ 24 V , 26 V ] I ∈ [ 4.769 A , 5.417 A ] U 1 ∈ [ 10 V , 11 V ] U 2 ∈ [ 14 V , 16 V ] P ∈ [ 124 W , 130 W ] R 1 ∈ [ 1.846 Ω , 2.307 Ω ] R 2 ∈ [ 2.584 Ω , 3.355 Ω ] .

References

Interval propagation Wikipedia
(Text) CC BY-SA