About: Lethargy theorem

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

In mathematics, a lethargy theorem is a statement about the distance of points in a metric space from members of a sequence of subspaces; one application in numerical analysis is to approximation theory, where such theorems quantify the difficulty of approximating general functions by functions of special form, such as polynomials. In more recent work, the convergence of a sequence of operators is studied: these operators generalise the projections of the earlier work.

Property Value
dbo:abstract
  • In mathematics, a lethargy theorem is a statement about the distance of points in a metric space from members of a sequence of subspaces; one application in numerical analysis is to approximation theory, where such theorems quantify the difficulty of approximating general functions by functions of special form, such as polynomials. In more recent work, the convergence of a sequence of operators is studied: these operators generalise the projections of the earlier work. (en)
  • Twierdzenie Bernsteina o letargu – twierdzenie teorii aproksymacji udowodnione przez Siergieja Bernsteina mówiące o szybkości zbieżności ciągu przybliżeń. (pl)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 34149851 (xsd:integer)
dbo:wikiPageLength
  • 2965 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032135158 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In mathematics, a lethargy theorem is a statement about the distance of points in a metric space from members of a sequence of subspaces; one application in numerical analysis is to approximation theory, where such theorems quantify the difficulty of approximating general functions by functions of special form, such as polynomials. In more recent work, the convergence of a sequence of operators is studied: these operators generalise the projections of the earlier work. (en)
  • Twierdzenie Bernsteina o letargu – twierdzenie teorii aproksymacji udowodnione przez Siergieja Bernsteina mówiące o szybkości zbieżności ciągu przybliżeń. (pl)
rdfs:label
  • Lethargy theorem (en)
  • Twierdzenie Bernsteina o letargu (pl)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
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