Bounding at Newton Divided Difference Formula












1












$begingroup$


Let $a=x_0,x_1,...,x_n=b$ are $n+1$ points which are equally spaced in $[a,b]$. The distance between consecutive terms is $h= frac{b-a}{n}$ and $x in [a,b]$



Show that $ biggr|prod_{i=}^n (x-x_i) biggr| leq frac{h^{n+1}.n!}{4} $



I have written



$ biggr|prod_{i=}^n (x-x_i) biggr| = biggr| (x-x_0)(x-x_0-h)(x-x_0-2h)...(x-x_0-nh) biggr|$



I know it is so easy but I couldn’t see in no way. I think I have written something unnecessary. Thanks for any help..






numerical-methods interpolation numerical-calculus







share|cite|improve this question











$endgroup$












  • $begingroup$
    $x$ is any real number? or $xin [a,b]$?
    $endgroup$
    – Ricardo Largaespada
    Dec 16 '18 at 0:53










  • $begingroup$
    @RicardoLargaespada sorry I’ve forgotten to write it. $in [a,b]$
    $endgroup$
    – user519955
    Dec 16 '18 at 1:01
















1












$begingroup$


Let $a=x_0,x_1,...,x_n=b$ are $n+1$ points which are equally spaced in $[a,b]$. The distance between consecutive terms is $h= frac{b-a}{n}$ and $x in [a,b]$



Show that $ biggr|prod_{i=}^n (x-x_i) biggr| leq frac{h^{n+1}.n!}{4} $



I have written



$ biggr|prod_{i=}^n (x-x_i) biggr| = biggr| (x-x_0)(x-x_0-h)(x-x_0-2h)...(x-x_0-nh) biggr|$



I know it is so easy but I couldn’t see in no way. I think I have written something unnecessary. Thanks for any help..






numerical-methods interpolation numerical-calculus







share|cite|improve this question











$endgroup$












  • $begingroup$
    $x$ is any real number? or $xin [a,b]$?
    $endgroup$
    – Ricardo Largaespada
    Dec 16 '18 at 0:53










  • $begingroup$
    @RicardoLargaespada sorry I’ve forgotten to write it. $in [a,b]$
    $endgroup$
    – user519955
    Dec 16 '18 at 1:01














1












1








1





$begingroup$


Let $a=x_0,x_1,...,x_n=b$ are $n+1$ points which are equally spaced in $[a,b]$. The distance between consecutive terms is $h= frac{b-a}{n}$ and $x in [a,b]$



Show that $ biggr|prod_{i=}^n (x-x_i) biggr| leq frac{h^{n+1}.n!}{4} $



I have written



$ biggr|prod_{i=}^n (x-x_i) biggr| = biggr| (x-x_0)(x-x_0-h)(x-x_0-2h)...(x-x_0-nh) biggr|$



I know it is so easy but I couldn’t see in no way. I think I have written something unnecessary. Thanks for any help..






numerical-methods interpolation numerical-calculus







share|cite|improve this question











$endgroup$




Let $a=x_0,x_1,...,x_n=b$ are $n+1$ points which are equally spaced in $[a,b]$. The distance between consecutive terms is $h= frac{b-a}{n}$ and $x in [a,b]$



Show that $ biggr|prod_{i=}^n (x-x_i) biggr| leq frac{h^{n+1}.n!}{4} $



I have written



$ biggr|prod_{i=}^n (x-x_i) biggr| = biggr| (x-x_0)(x-x_0-h)(x-x_0-2h)...(x-x_0-nh) biggr|$



I know it is so easy but I couldn’t see in no way. I think I have written something unnecessary. Thanks for any help..






numerical-methods interpolation numerical-calculus




numerical-methods interpolation numerical-calculus






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 16 '18 at 1:02







user519955

















asked Dec 16 '18 at 0:30









user519955user519955

312111




312111












  • $begingroup$
    $x$ is any real number? or $xin [a,b]$?
    $endgroup$
    – Ricardo Largaespada
    Dec 16 '18 at 0:53










  • $begingroup$
    @RicardoLargaespada sorry I’ve forgotten to write it. $in [a,b]$
    $endgroup$
    – user519955
    Dec 16 '18 at 1:01


















  • $begingroup$
    $x$ is any real number? or $xin [a,b]$?
    $endgroup$
    – Ricardo Largaespada
    Dec 16 '18 at 0:53










  • $begingroup$
    @RicardoLargaespada sorry I’ve forgotten to write it. $in [a,b]$
    $endgroup$
    – user519955
    Dec 16 '18 at 1:01
















$begingroup$
$x$ is any real number? or $xin [a,b]$?
$endgroup$
– Ricardo Largaespada
Dec 16 '18 at 0:53




$begingroup$
$x$ is any real number? or $xin [a,b]$?
$endgroup$
– Ricardo Largaespada
Dec 16 '18 at 0:53












$begingroup$
@RicardoLargaespada sorry I’ve forgotten to write it. $in [a,b]$
$endgroup$
– user519955
Dec 16 '18 at 1:01




$begingroup$
@RicardoLargaespada sorry I’ve forgotten to write it. $in [a,b]$
$endgroup$
– user519955
Dec 16 '18 at 1:01










1 Answer
1






active

oldest

votes


















0












$begingroup$

Argue that the maximal error occurs in the boundary intervals. Set $x=sh$. Then
$$prod_{k=0}^n|x-x_k|=h^{n+1}|s(1-s)|cdot|2-s|cdots|n-s|$$
and the bound should be obvious.



More generally, for $x=mh+s$, $m=0,...,n$, you get
$$h^{n+1}|m+1-(1-s)|⋯|2-(1-s)|⋅|s(1-s)|⋅|1-s|⋯|n-m-s|le frac14h^{n+1}(m+1)!(n-m)!$$




Take the next term into the maximum calculation, thus maximizing $s(1-s)(2-s)$ and find the maximum for $sin [0,frac32]$ at the interval ends or the root of
$$
0=3s^2-6s+2iff s=1-frac1{sqrt3}
$$
so that the bound can be decreased to
$$
h^{n+1}frac{n!}{3sqrt3}.
$$






share|cite|improve this answer











$endgroup$













  • $begingroup$
    How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
    $endgroup$
    – user519955
    Dec 16 '18 at 9:20












  • $begingroup$
    With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
    $endgroup$
    – LutzL
    Dec 16 '18 at 9:31













Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3042114%2fbounding-at-newton-divided-difference-formula%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









0












$begingroup$

Argue that the maximal error occurs in the boundary intervals. Set $x=sh$. Then
$$prod_{k=0}^n|x-x_k|=h^{n+1}|s(1-s)|cdot|2-s|cdots|n-s|$$
and the bound should be obvious.



More generally, for $x=mh+s$, $m=0,...,n$, you get
$$h^{n+1}|m+1-(1-s)|⋯|2-(1-s)|⋅|s(1-s)|⋅|1-s|⋯|n-m-s|le frac14h^{n+1}(m+1)!(n-m)!$$




Take the next term into the maximum calculation, thus maximizing $s(1-s)(2-s)$ and find the maximum for $sin [0,frac32]$ at the interval ends or the root of
$$
0=3s^2-6s+2iff s=1-frac1{sqrt3}
$$
so that the bound can be decreased to
$$
h^{n+1}frac{n!}{3sqrt3}.
$$






share|cite|improve this answer











$endgroup$













  • $begingroup$
    How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
    $endgroup$
    – user519955
    Dec 16 '18 at 9:20












  • $begingroup$
    With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
    $endgroup$
    – LutzL
    Dec 16 '18 at 9:31


















0












$begingroup$

Argue that the maximal error occurs in the boundary intervals. Set $x=sh$. Then
$$prod_{k=0}^n|x-x_k|=h^{n+1}|s(1-s)|cdot|2-s|cdots|n-s|$$
and the bound should be obvious.



More generally, for $x=mh+s$, $m=0,...,n$, you get
$$h^{n+1}|m+1-(1-s)|⋯|2-(1-s)|⋅|s(1-s)|⋅|1-s|⋯|n-m-s|le frac14h^{n+1}(m+1)!(n-m)!$$




Take the next term into the maximum calculation, thus maximizing $s(1-s)(2-s)$ and find the maximum for $sin [0,frac32]$ at the interval ends or the root of
$$
0=3s^2-6s+2iff s=1-frac1{sqrt3}
$$
so that the bound can be decreased to
$$
h^{n+1}frac{n!}{3sqrt3}.
$$






share|cite|improve this answer











$endgroup$













  • $begingroup$
    How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
    $endgroup$
    – user519955
    Dec 16 '18 at 9:20












  • $begingroup$
    With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
    $endgroup$
    – LutzL
    Dec 16 '18 at 9:31
















0












0








0





$begingroup$

Argue that the maximal error occurs in the boundary intervals. Set $x=sh$. Then
$$prod_{k=0}^n|x-x_k|=h^{n+1}|s(1-s)|cdot|2-s|cdots|n-s|$$
and the bound should be obvious.



More generally, for $x=mh+s$, $m=0,...,n$, you get
$$h^{n+1}|m+1-(1-s)|⋯|2-(1-s)|⋅|s(1-s)|⋅|1-s|⋯|n-m-s|le frac14h^{n+1}(m+1)!(n-m)!$$




Take the next term into the maximum calculation, thus maximizing $s(1-s)(2-s)$ and find the maximum for $sin [0,frac32]$ at the interval ends or the root of
$$
0=3s^2-6s+2iff s=1-frac1{sqrt3}
$$
so that the bound can be decreased to
$$
h^{n+1}frac{n!}{3sqrt3}.
$$






share|cite|improve this answer











$endgroup$



Argue that the maximal error occurs in the boundary intervals. Set $x=sh$. Then
$$prod_{k=0}^n|x-x_k|=h^{n+1}|s(1-s)|cdot|2-s|cdots|n-s|$$
and the bound should be obvious.



More generally, for $x=mh+s$, $m=0,...,n$, you get
$$h^{n+1}|m+1-(1-s)|⋯|2-(1-s)|⋅|s(1-s)|⋅|1-s|⋯|n-m-s|le frac14h^{n+1}(m+1)!(n-m)!$$




Take the next term into the maximum calculation, thus maximizing $s(1-s)(2-s)$ and find the maximum for $sin [0,frac32]$ at the interval ends or the root of
$$
0=3s^2-6s+2iff s=1-frac1{sqrt3}
$$
so that the bound can be decreased to
$$
h^{n+1}frac{n!}{3sqrt3}.
$$







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 16 '18 at 9:34

























answered Dec 16 '18 at 8:54









LutzLLutzL

58.7k42055




58.7k42055












  • $begingroup$
    How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
    $endgroup$
    – user519955
    Dec 16 '18 at 9:20












  • $begingroup$
    With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
    $endgroup$
    – LutzL
    Dec 16 '18 at 9:31




















  • $begingroup$
    How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
    $endgroup$
    – user519955
    Dec 16 '18 at 9:20












  • $begingroup$
    With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
    $endgroup$
    – LutzL
    Dec 16 '18 at 9:31


















$begingroup$
How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
$endgroup$
– user519955
Dec 16 '18 at 9:20






$begingroup$
How can I get $frac{h^{n+1}n!}{4}$ with your writtens? I’m sorry I could not understand
$endgroup$
– user519955
Dec 16 '18 at 9:20














$begingroup$
With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
$endgroup$
– LutzL
Dec 16 '18 at 9:31






$begingroup$
With the easy estimates $k-sle k$ and $s(1-s)=frac14(1-(2s-1)^2$.
$endgroup$
– LutzL
Dec 16 '18 at 9:31




















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3042114%2fbounding-at-newton-divided-difference-formula%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

To store a contact into the json file from server.js file using a class in NodeJS

Image
0 I have created three files -contactPresentation.js, contactService.js, contacts.json. I will run the contactService.js file. And it will navigate to contactPresentation.js file that will only choose an option to either add or display a file. If add(), then add the data into add of service file.And the data will be added to the contacts.json file . And if display(), then display the display() of service file. And the display will take the data from contacts.json file. However, i know my code is flawed. Please correct it . I am also getting an error - this.contacts.push(new ContactService(userName, contactNumber, emailId)); ^ TypeError: Cannot read property 'push' of undefined at ContactService.add (e:NodeJSProjectcontactManager2contactService.js:57:23) at new C
Read more

Redirect URL with Chrome Remote Debugging Android Devices

Image
1 How can i redirect an URL with Chrome Remote Debugging Android Devices? like Requestly Chrome extension on desktop. google-chrome debugging url redirect testing share | improve this question edited Nov 24 '18 at 8:16 sachinjain024 14.7k 23 73 129 asked Nov 23 '18 at 16:09 Momen Momen 91 10
Read more

Dieringhausen

Image
Dieringhausen Stadt Gummersbach 50.982777777778 7.5316666666667 165 Koordinaten: 50° 58′ 58″  N , 7° 31′ 54″  O Höhe: 165  (160–245)  m Einwohner: 5055  (30. Jun. 2016) Postleitzahl: 51645 Vorwahl: 02261 Lage von Dieringhausen in Gummersbach Im Hohl ca. 1927–1930 Ansicht von Südwesten bei Bünghausen Dieringhausen (im örtlichen Dialekt Dierkesen ) ist ein Ortsteil von Gummersbach im Oberbergischen Kreis, Regierungsbezirk Köln, Nordrhein-Westfalen (Deutschland). Inhaltsverzeichnis 1 Geographie 2 Geschichte 3 Kultur 3.1 Sehenswürdigkeiten 3.2 Regelmäßige Veranstaltungen 4 Infrastruktur und Wirtschaft 4.1 Verkehr 4.1.1 Schienen- und Busverkehr 4.1.2 Straßen 4.2 Öffentliche Einrichtungen 4.2.1 Schulen und Bildungseinrichtungen 4.2.2 Kirchliche Einrichtungen 5 Persönlichkeiten 5.1 In Dieringhausen geboren 5.2 In Dieringhausen gelebt 6 Einzelnachweise 7
Read more