About: Müntz–Szász theorem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Theorem106752293, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMüntz%E2%80%93Szász_theorem

The Müntz–Szász theorem is a basic result of approximation theory, proved by Herman Müntz in 1914 and Otto Szász (1884–1952) in 1916. Roughly speaking, the theorem shows to what extent the Weierstrass theorem on polynomial approximation can have holes dug into it, by restricting certain coefficients in the polynomials to be zero. The form of the result had been conjectured by Sergei Bernstein before it was proved. The theorem, in a special case, states that a necessary and sufficient condition for the monomials There are also versions for the Lp spaces.

AttributesValues
rdf:type
rdfs:label
  • Satz von Müntz-Szász (de)
  • Théorème de Müntz (fr)
  • Müntz–Szász theorem (en)
  • Теорема Мюнтца — Саса (ru)
rdfs:comment
  • Der Satz von Müntz-Szász (englisch Müntz-Szász theorem) ist einer der Approximationssätze des mathematischen Gebiets der Analysis. Er geht auf Arbeiten der beiden Mathematiker Herman (Chaim) Müntz und Otto Szász aus den Jahren 1914 bzw. 1916 zurück. Der Satz behandelt, anschließend an den klassischen Approximationssatz von Weierstraß, die Frage der Bedingungen, unter denen die stetigen komplexwertigen Funktionen auf dem abgeschlossenen Einheitsintervall durch Linearkombinationen geeigneter Potenzfunktionen gleichmäßig approximiert werden können. (de)
  • Теорема Мюнтца — Саса — утверждение о достаточном условии равномерной аппроксимации произвольной непрерывной функциистепенными полиномами и достаточном условии её невозможности. Была доказана Мюнтцем в 1914 г. и Сасом в 1916 г. Играет важную роль в функциональном анализе. (ru)
  • The Müntz–Szász theorem is a basic result of approximation theory, proved by Herman Müntz in 1914 and Otto Szász (1884–1952) in 1916. Roughly speaking, the theorem shows to what extent the Weierstrass theorem on polynomial approximation can have holes dug into it, by restricting certain coefficients in the polynomials to be zero. The form of the result had been conjectured by Sergei Bernstein before it was proved. The theorem, in a special case, states that a necessary and sufficient condition for the monomials There are also versions for the Lp spaces. (en)
  • Le théorème de Müntz-Szász est un résultat fondamental de la théorie de l'approximation, conjecturé en 1912 par Sergeï Bernstein et démontré en 1914 par (en). En 1916, Otto Szász l'a étendu à des exposants complexes et en a fourni une preuve plus simple. Pour I un segment quelconque de ℝ, le théorème de Weierstrass assure que toute fonction continue de I dans ℂ est limite uniforme d'une suite de polynômes. (fr)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Der Satz von Müntz-Szász (englisch Müntz-Szász theorem) ist einer der Approximationssätze des mathematischen Gebiets der Analysis. Er geht auf Arbeiten der beiden Mathematiker Herman (Chaim) Müntz und Otto Szász aus den Jahren 1914 bzw. 1916 zurück. Der Satz behandelt, anschließend an den klassischen Approximationssatz von Weierstraß, die Frage der Bedingungen, unter denen die stetigen komplexwertigen Funktionen auf dem abgeschlossenen Einheitsintervall durch Linearkombinationen geeigneter Potenzfunktionen gleichmäßig approximiert werden können. (de)
  • The Müntz–Szász theorem is a basic result of approximation theory, proved by Herman Müntz in 1914 and Otto Szász (1884–1952) in 1916. Roughly speaking, the theorem shows to what extent the Weierstrass theorem on polynomial approximation can have holes dug into it, by restricting certain coefficients in the polynomials to be zero. The form of the result had been conjectured by Sergei Bernstein before it was proved. The theorem, in a special case, states that a necessary and sufficient condition for the monomials to span a dense subset of the Banach space C[a,b] of all continuous functions with complex number values on the closed interval [a,b] with a > 0, with the uniform norm, is that the sum of the reciprocals, taken over S, should diverge, i.e. S is a large set. For an interval [0, b], the constant functions are necessary: assuming therefore that 0 is in S, the condition on the other exponents is as before. More generally, one can take exponents from any strictly increasing sequence of positive real numbers, and the same result holds. Szász showed that for complex number exponents, the same condition applied to the sequence of real parts. There are also versions for the Lp spaces. (en)
  • Le théorème de Müntz-Szász est un résultat fondamental de la théorie de l'approximation, conjecturé en 1912 par Sergeï Bernstein et démontré en 1914 par (en). En 1916, Otto Szász l'a étendu à des exposants complexes et en a fourni une preuve plus simple. Pour I un segment quelconque de ℝ, le théorème de Weierstrass assure que toute fonction continue de I dans ℂ est limite uniforme d'une suite de polynômes. Le théorème de Müntz-Szász est une généralisation du théorème de Weierstrass, dans le cas où le segment I est positif, avec un ensemble d'« exposants de monômes » différent de celui des entiers naturels, mais satisfaisant une condition analogue à celle de la divergence de la série harmonique. (fr)
  • Теорема Мюнтца — Саса — утверждение о достаточном условии равномерной аппроксимации произвольной непрерывной функциистепенными полиномами и достаточном условии её невозможности. Была доказана Мюнтцем в 1914 г. и Сасом в 1916 г. Играет важную роль в функциональном анализе. (ru)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect 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, 57 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software