Jump to content

Set inversion

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Luc Jaulin (talk | contribs) at 19:18, 19 April 2013 (removed Category:Interval analysis using HotCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Set inversion is the problem of characterizing the reciprocical image X of a set Y by a function f, i.e., X=f-1(Y) = {x ∈ ℝn | f(x) ∈ Y} In most applications, f is a function from ℝn to ℝp and the set Y is a box of ℝp (i.e. a Cartesian product of p intervals of ℝ).


When f is nonlinear the set inversion problem can be solved using interval analysis. [1]

The main idea consists in building a paving of ℝp made with nonoverlapping boxes. For each box [x], we perform the following tests: (i) if f([x]) ⊂ Y we conclude that [x] ⊂ X; (ii) if f([x]) ∩ Y = ∅ we conclude that [x] ∩ X = ∅; (iii) Otherwise, [x] the box is bissected.


References

  1. ^ Jaulin, Luc; Didrit, Olivier; Kieffer, Michel; Walter, Eric (2001). Applied Interval Analysis. Berlin: Springer. ISBN 1-85233-219-0.