About: Unisolvent point set

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In approximation theory, a finite collection of points is often called unisolvent for a space if any element is uniquely determined by its values on . is unisolvent for (polynomials in n variables of degree at most m) if there exists a unique polynomial in of lowest possible degree which interpolates the data . Simple examples in would be the fact that two distinct points determine a line, three points determine a parabola, etc. It is clear that over , any collection of k + 1 distinct points will uniquely determine a polynomial of lowest possible degree in .

Property Value
dbo:abstract
  • In approximation theory, a finite collection of points is often called unisolvent for a space if any element is uniquely determined by its values on . is unisolvent for (polynomials in n variables of degree at most m) if there exists a unique polynomial in of lowest possible degree which interpolates the data . Simple examples in would be the fact that two distinct points determine a line, three points determine a parabola, etc. It is clear that over , any collection of k + 1 distinct points will uniquely determine a polynomial of lowest possible degree in . (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 26749732 (xsd:integer)
dbo:wikiPageLength
  • 1043 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 532122616 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In approximation theory, a finite collection of points is often called unisolvent for a space if any element is uniquely determined by its values on . is unisolvent for (polynomials in n variables of degree at most m) if there exists a unique polynomial in of lowest possible degree which interpolates the data . Simple examples in would be the fact that two distinct points determine a line, three points determine a parabola, etc. It is clear that over , any collection of k + 1 distinct points will uniquely determine a polynomial of lowest possible degree in . (en)
rdfs:label
  • Unisolvent point set (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License