{"entities":{"Q2617065":{"pageid":2627808,"ns":120,"title":"Item:Q2617065","lastrevid":44498640,"modified":"2025-11-23T08:59:24Z","type":"item","id":"Q2617065","labels":{"en":{"language":"en","value":"Sur le calcul effectif des polynomes d'approximation de Tschebischef."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2537651"}},"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":"Q2617065$6DBC153B-9658-4929-830F-AC151AACE604","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"64d4b6e8a1714c1f11410b8f2c20f19e2ea359e1","datavalue":{"value":{"text":"Sur le calcul effectif des polynomes d'approximation de Tschebischef.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2617065$F42FF9F2-6711-4BE6-96A3-3129AABB7274","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ae1fb94f70851b06b7b331ed191318ad301afcbe","datavalue":{"value":"60.0212.01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2617065$D83C225B-8026-49C8-9996-AF763133901D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8f92c7e60bc48b726bcdcdce4781c623b5a0717f","datavalue":{"value":{"entity-type":"item","numeric-id":2542392,"id":"Q2542392"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2617065$55FAD7DB-FBB0-430B-8B3A-A5EBDD7E6F24","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"3564fffbea34e6cdc8d4dfaafa1f98a44041b0cc","datavalue":{"value":{"entity-type":"item","numeric-id":558939,"id":"Q558939"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2617065$528032CA-1901-4A4B-8FB3-E17173F9057C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0545e869d8296a0b0654ccbe2e3181b7f2652da8","datavalue":{"value":{"time":"+1934-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":"Q2617065$1FB70609-6205-45E1-95A2-96A2CE2F82AF","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ad1ba3d1034910b0818bfdf14fdf88b740c5843c","datavalue":{"value":"Verf. gibt eine zweite Art an, die Polynome ``bester Approximation'' zu berechnen. Ist \\(p_n(x)\\) ein beliebiges N\u00e4herungspolynom f\u00fcr die Funktion \\(f(x)\\), und ist \\(\\Delta (x)=f(x)-p_n(x)\\), so wird \\(p_n(x)\\) durch ein besser approximierendes Polynom \\(p_n(x)+\\Omega _n(x)\\) ersetzt. Die Korrektion \\(\\Omega _n(x)\\) approximiert \\(\\Delta (x)\\) auf einer durch \\(n+2\\) Punkte bestimmten Teilmenge des zugrunde liegenden Intervalles. Die Konvergenz des wiederholt anzuwendenden Verfahrens l\u00e4\u00dft sich nachweisen.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2617065$E697F6FB-D767-4B8B-AD32-EC79C4543ABD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2b3df8834be427d27a45e29afa6b8e6ebb75f803","datavalue":{"value":"2537651","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2617065$9544A10F-6C9F-4E9C-9FCA-164917FD796A","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":"Q2617065$7605B6FC-E112-4859-8EF6-AD96810A7459","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2617065","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2617065"}}}}}