How to calculate interpolation error with repeated nodes
up vote
1
down vote
favorite
Given $f(x)=cos(pi x)$
a) Calculate the interpolation polynomial such that $p(-1)=f(-1)$, $p'(-1)=f'(-1)$, $p(0)=f(0)$, $p(1)=f(1)$ and $p'(1)=f'(1)$.
b) Show that $|f(x)-p(x)|leqfrac{pi^5}{120}$ for every $xin[-1,1]$
So I managed to do item a) and obtain $p(x)=2x^4-4x^2+1$. However, when I try to do item b) and bound my error, I have repeated nodes, $x_0=-1$ and $x_2=1$ and therefore im not sure if I can use the bound I would like to use, say:
$$||W_{n+1}(x)||_{infty}leqleft(frac{b-a}{2}right)^{n+1}$$
Since my nodes are equidistant. Is there an aditional condition I should add because of the repetition of my nodes?
numerical-methods lagrange-interpolation
add a comment |
up vote
1
down vote
favorite
Given $f(x)=cos(pi x)$
a) Calculate the interpolation polynomial such that $p(-1)=f(-1)$, $p'(-1)=f'(-1)$, $p(0)=f(0)$, $p(1)=f(1)$ and $p'(1)=f'(1)$.
b) Show that $|f(x)-p(x)|leqfrac{pi^5}{120}$ for every $xin[-1,1]$
So I managed to do item a) and obtain $p(x)=2x^4-4x^2+1$. However, when I try to do item b) and bound my error, I have repeated nodes, $x_0=-1$ and $x_2=1$ and therefore im not sure if I can use the bound I would like to use, say:
$$||W_{n+1}(x)||_{infty}leqleft(frac{b-a}{2}right)^{n+1}$$
Since my nodes are equidistant. Is there an aditional condition I should add because of the repetition of my nodes?
numerical-methods lagrange-interpolation
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Given $f(x)=cos(pi x)$
a) Calculate the interpolation polynomial such that $p(-1)=f(-1)$, $p'(-1)=f'(-1)$, $p(0)=f(0)$, $p(1)=f(1)$ and $p'(1)=f'(1)$.
b) Show that $|f(x)-p(x)|leqfrac{pi^5}{120}$ for every $xin[-1,1]$
So I managed to do item a) and obtain $p(x)=2x^4-4x^2+1$. However, when I try to do item b) and bound my error, I have repeated nodes, $x_0=-1$ and $x_2=1$ and therefore im not sure if I can use the bound I would like to use, say:
$$||W_{n+1}(x)||_{infty}leqleft(frac{b-a}{2}right)^{n+1}$$
Since my nodes are equidistant. Is there an aditional condition I should add because of the repetition of my nodes?
numerical-methods lagrange-interpolation
Given $f(x)=cos(pi x)$
a) Calculate the interpolation polynomial such that $p(-1)=f(-1)$, $p'(-1)=f'(-1)$, $p(0)=f(0)$, $p(1)=f(1)$ and $p'(1)=f'(1)$.
b) Show that $|f(x)-p(x)|leqfrac{pi^5}{120}$ for every $xin[-1,1]$
So I managed to do item a) and obtain $p(x)=2x^4-4x^2+1$. However, when I try to do item b) and bound my error, I have repeated nodes, $x_0=-1$ and $x_2=1$ and therefore im not sure if I can use the bound I would like to use, say:
$$||W_{n+1}(x)||_{infty}leqleft(frac{b-a}{2}right)^{n+1}$$
Since my nodes are equidistant. Is there an aditional condition I should add because of the repetition of my nodes?
numerical-methods lagrange-interpolation
numerical-methods lagrange-interpolation
asked Nov 22 at 19:16
Arete the Mathematician
62
62
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3009532%2fhow-to-calculate-interpolation-error-with-repeated-nodes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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