| http://dbpedia.org/ontology/abstract
|
In mathematics, set inversion is the probl … In mathematics, set inversion is the problem of characterizing the preimage X of a set Y by a function f, i.e., X = f −1(Y ) = {x ∈ Rn | f(x) ∈ Y }. It can also be viewed as the problem of describing the solution set of the quantified constraint "Y(f (x))", where Y( y) is a constraint, e.g. an inequality, describing the set Y. In most applications, f is a function from Rn to Rp and the set Y is a box of Rp (i.e. a Cartesian product of p intervals of R). When f is nonlinear the set inversion problem can be solved using interval analysis combined with a branch-and-bound algorithm. The main idea consists in building a paving of Rp made with non-overlapping boxes. For each box [x], we perform the following tests: 1.
* if f ([x]) ⊂ Y we conclude that [x] ⊂ X; 2.
* if f ([x]) ∩ Y = ∅ we conclude that [x] ∩ X = ∅; 3.
* Otherwise, the box [x] the box is bisected except if its width is smaller than a given precision. To check the two first tests, we need an interval extension (or an inclusion function) [f ] for f. Classified boxes are stored into subpavings, i.e., union of non-overlapping boxes. The algorithm can be made more efficient by replacing the inclusion tests by contractors.lacing the inclusion tests by contractors.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Wiki_ring.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
39157279
|
| http://dbpedia.org/ontology/wikiPageLength
|
4953
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1071398189
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Interval_arithmetic +
, http://dbpedia.org/resource/Interval_contractor +
, http://dbpedia.org/resource/Cartesian_product +
, http://dbpedia.org/resource/Branch_and_bound +
, http://dbpedia.org/resource/Set_estimation +
, http://dbpedia.org/resource/Linear_dynamical_system +
, http://dbpedia.org/resource/Category:Topology +
, http://dbpedia.org/resource/Inverse_image +
, http://dbpedia.org/resource/Empty_set +
, http://dbpedia.org/resource/Union_%28set_theory%29 +
, http://dbpedia.org/resource/Set_%28mathematics%29 +
, http://dbpedia.org/resource/Interval_%28mathematics%29 +
, http://dbpedia.org/resource/Interval_analysis +
, http://dbpedia.org/resource/Function_%28mathematics%29 +
, http://dbpedia.org/resource/Intersection_%28set_theory%29 +
, http://dbpedia.org/resource/File:Wiki_ring.png +
, http://dbpedia.org/resource/Motion_planning +
, http://dbpedia.org/resource/Subpaving +
, http://dbpedia.org/resource/Mathematics +
, http://dbpedia.org/resource/Inequality_%28mathematics%29 +
|
| http://dbpedia.org/property/b
|
1
, 2
|
| http://dbpedia.org/property/p
|
2
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Su +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Topology +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Set_inversion?oldid=1071398189&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Wiki_ring.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Set_inversion +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.0t53fcj +
, http://www.wikidata.org/entity/Q17144070 +
, http://dbpedia.org/resource/Set_inversion +
, https://global.dbpedia.org/id/gkUj +
|
| rdf:type |
http://dbpedia.org/ontology/Disease +
|
| rdfs:comment |
In mathematics, set inversion is the probl … In mathematics, set inversion is the problem of characterizing the preimage X of a set Y by a function f, i.e., X = f −1(Y ) = {x ∈ Rn | f(x) ∈ Y }. It can also be viewed as the problem of describing the solution set of the quantified constraint "Y(f (x))", where Y( y) is a constraint, e.g. an inequality, describing the set Y. In most applications, f is a function from Rn to Rp and the set Y is a box of Rp (i.e. a Cartesian product of p intervals of R). When f is nonlinear the set inversion problem can be solved using interval analysis combined with a branch-and-bound algorithm.ombined with a branch-and-bound algorithm.
|
| rdfs:label |
Set inversion
|
