About: Set inversion     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbo:Disease, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSet_inversion

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.

AttributesValues
rdf:type
rdfs:label
  • Set inversion (en)
rdfs:comment
  • 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. (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Wiki_ring.png
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
thumbnail
b
p
has abstract
  • 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. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software