{"entities":{"Q2614630":{"pageid":2625373,"ns":120,"title":"Item:Q2614630","lastrevid":79108790,"modified":"2026-05-06T13:09:58Z","type":"item","id":"Q2614630","labels":{"en":{"language":"en","value":"The error of the most satisfactory approximation of a function by the polynom method."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2534892"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2614630$FE182419-81A7-4161-A5C4-55ECAB91F60A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"121ca2616dc9f43b21c2aee3ef1bce061380e096","datavalue":{"value":{"text":"The error of the most satisfactory approximation of a function by the polynom method.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2614630$5EFEEA21-9425-430B-9B2C-4DE6C5847735","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9088d2af2ffb97968dd0b03af93583c544c408cb","datavalue":{"value":"61.1128.02","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2614630$4844EC97-B9C8-42E7-9704-3AB5EB172077","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"fad712a8a9240cb43ad0b5071f856e02cb8a501f","datavalue":{"value":{"entity-type":"item","numeric-id":2591519,"id":"Q2591519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2614630$C18F610A-B67A-41F2-BC2D-01364B46CD70","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f82bec1cbf48dde5b3e142feb51b7b6959e188a7","datavalue":{"value":{"time":"+1935-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2614630$FD7411E5-EDDE-42C2-9EE5-4B534EF764B5","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"bb65950dc1b2d0809031a9df5665d14e39901c92","datavalue":{"value":"Ausgehend von dem Integral  \\[  \\int\\limits_a^b p(x)f(x) \\varphi_{n+1}(x)\\,dx,  \\]  wo \\(p (x)\\) eine nicht negative Funktion, \\(\\varphi_i(x)\\) \\((i = 0, 1, 2,\\ldots)\\) die zu ihr geh\u00f6rigen normiert-orthogonalen \\textit{Tschebyscheff}schen Polynome f\u00fcr das Intervall \\((a, b)\\) sind, gibt Verf. eine h\u00f6chst einfache Herleitung der Ungleichung  \\[  |f(x)-\\varPi_n(x)|>\\dfrac{M}{(n+1)! a_{n+1}\\sqrt{\\int\\limits_a^b p(x)\\,dx}}.  \\]  Diese gibt eine Absch\u00e4tzung f\u00fcr die untere Grenze des Fehlers bei der Approximation der \\((n + 1)\\)-mal stetig differenzierbaren Funktion \\(f (x)\\) durch das g\u00fcnstigste Polynom \\(\\varPi_n(x)\\) vom Grade \\(n\\). Dabei bezeichnet \\(M\\) das Minimum von \\(|f^{(n+1)}(x)|\\) im Intervall \\((a, b)\\) und \\(a_{n+1}\\) den Koeffizienten des Gliedes \\(x^{n+1}\\) in \\(\\varphi_{n+1}(x)\\). F\u00fcr  \\[  p(x)=\\dfrac{1}{\\sqrt{1-x^2}},\\quad a=-1,\\quad b=1  \\]  aus der obigen Ungleichung die Absch\u00e4tzung  \\[  |f(x)-\\varPi_n(x)| > \\dfrac{M}{(n+1)!2^n\\sqrt2},  \\]  die sich von der \\textit{Bernstein}schen um den Faktor \\(\\dfrac{1}{\\sqrt\\pi}\\) unterscheidet; f\u00fcr  \\[  p(x)=1, \\quad a=-1,\\quad b=1  \\]  erh\u00e4lt man das bessere Resultat  \\[  |f(x)-\\varPi_n(x)|>\\dfrac{M}{1\\cdot3\\cdot5\\cdots(2n+1)\\sqrt{2n+3}}.  \\]","type":"string"},"datatype":"string"},"type":"statement","id":"Q2614630$DE1EFA97-35FF-4C24-A0EA-4FAE211978DD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e702ce9edc5361263b547b3df3ada7058ad4aa36","datavalue":{"value":"2534892","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2614630$0075D1AE-0406-417A-9977-2997BCA2D58E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2614630$0D536971-F533-4F9C-A1DF-520E2CEE994C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The error of the most satisfactory approximation of a function by the polynom method.","badges":[]}}}}}