Understanding Taylor series error function and Lagrange error bound
$begingroup$
I am in high school and find math interesting so lately I have been trying to learn as much about it as I can. I recently began studying Taylor Series as it pertains to the research areas that I am currently following and have two questions. I am trying to conceptualize Lagrange's error bound and the remainder function.
I have read that:
$f(x)=f(c)+f'(c)(x-c)+...+frac{f^{(n)}(c)}{n!}(x-c)^{n}+R_n(x)$
where $R_n(x)$ is the remainder given by:
$frac{f^{(n+1)}(z)}{(n+1)!}(x-c)^{n+1}$.
From what I have read, I understand that the remainder gives the difference between a given Taylor polynomial and its original function, $f(x)$. I have also read about La Grange's error bound which differs from the remainder.
My first question is, if Lagrange's error bound gives the maximum "remainder" for a given $x$, how does it differ from the remainder function $R_n(x)$? Are they equivalent? If a function can be found from its Taylor polynomial and Remainder term or any combination vice-versa, what is the purpose of Lagrange's error bound?
My second question is, how is the error term function, $R_n(x)$ derived? I understand that it can be found from the difference between a function and its Taylor polynomial but I am not sure where it originates from in general form.
Any help with conceptualizing this is greatly appreciated.
calculus taylor-expansion error-function
$endgroup$
add a comment |
$begingroup$
I am in high school and find math interesting so lately I have been trying to learn as much about it as I can. I recently began studying Taylor Series as it pertains to the research areas that I am currently following and have two questions. I am trying to conceptualize Lagrange's error bound and the remainder function.
I have read that:
$f(x)=f(c)+f'(c)(x-c)+...+frac{f^{(n)}(c)}{n!}(x-c)^{n}+R_n(x)$
where $R_n(x)$ is the remainder given by:
$frac{f^{(n+1)}(z)}{(n+1)!}(x-c)^{n+1}$.
From what I have read, I understand that the remainder gives the difference between a given Taylor polynomial and its original function, $f(x)$. I have also read about La Grange's error bound which differs from the remainder.
My first question is, if Lagrange's error bound gives the maximum "remainder" for a given $x$, how does it differ from the remainder function $R_n(x)$? Are they equivalent? If a function can be found from its Taylor polynomial and Remainder term or any combination vice-versa, what is the purpose of Lagrange's error bound?
My second question is, how is the error term function, $R_n(x)$ derived? I understand that it can be found from the difference between a function and its Taylor polynomial but I am not sure where it originates from in general form.
Any help with conceptualizing this is greatly appreciated.
calculus taylor-expansion error-function
$endgroup$
add a comment |
$begingroup$
I am in high school and find math interesting so lately I have been trying to learn as much about it as I can. I recently began studying Taylor Series as it pertains to the research areas that I am currently following and have two questions. I am trying to conceptualize Lagrange's error bound and the remainder function.
I have read that:
$f(x)=f(c)+f'(c)(x-c)+...+frac{f^{(n)}(c)}{n!}(x-c)^{n}+R_n(x)$
where $R_n(x)$ is the remainder given by:
$frac{f^{(n+1)}(z)}{(n+1)!}(x-c)^{n+1}$.
From what I have read, I understand that the remainder gives the difference between a given Taylor polynomial and its original function, $f(x)$. I have also read about La Grange's error bound which differs from the remainder.
My first question is, if Lagrange's error bound gives the maximum "remainder" for a given $x$, how does it differ from the remainder function $R_n(x)$? Are they equivalent? If a function can be found from its Taylor polynomial and Remainder term or any combination vice-versa, what is the purpose of Lagrange's error bound?
My second question is, how is the error term function, $R_n(x)$ derived? I understand that it can be found from the difference between a function and its Taylor polynomial but I am not sure where it originates from in general form.
Any help with conceptualizing this is greatly appreciated.
calculus taylor-expansion error-function
$endgroup$
I am in high school and find math interesting so lately I have been trying to learn as much about it as I can. I recently began studying Taylor Series as it pertains to the research areas that I am currently following and have two questions. I am trying to conceptualize Lagrange's error bound and the remainder function.
I have read that:
$f(x)=f(c)+f'(c)(x-c)+...+frac{f^{(n)}(c)}{n!}(x-c)^{n}+R_n(x)$
where $R_n(x)$ is the remainder given by:
$frac{f^{(n+1)}(z)}{(n+1)!}(x-c)^{n+1}$.
From what I have read, I understand that the remainder gives the difference between a given Taylor polynomial and its original function, $f(x)$. I have also read about La Grange's error bound which differs from the remainder.
My first question is, if Lagrange's error bound gives the maximum "remainder" for a given $x$, how does it differ from the remainder function $R_n(x)$? Are they equivalent? If a function can be found from its Taylor polynomial and Remainder term or any combination vice-versa, what is the purpose of Lagrange's error bound?
My second question is, how is the error term function, $R_n(x)$ derived? I understand that it can be found from the difference between a function and its Taylor polynomial but I am not sure where it originates from in general form.
Any help with conceptualizing this is greatly appreciated.
calculus taylor-expansion error-function
calculus taylor-expansion error-function
edited Jan 9 at 2:55
Gnumbertester
asked Jan 9 at 0:08
GnumbertesterGnumbertester
495111
495111
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
$R_n(x)$ is defined to be the difference between the function and its $n$th order Taylor polynomial (not series).
It is an important consequence of the Mean Value Theorem that there exists $z$ between $x$ and $c$ such that the remainder can be written as $R_n(x) = frac{f^{(n+1)}(z)}{(n+1)!} (x-c)^{n+1}$. However in general we do not know more about the exact value of $z$ (or $f^{(n+1)}(z)$) beyond the fact that it lies between $x$ and $c$.
Since we often cannot compute the remainder explicitly, we would like to bound it. For example, it would be nice to say $|R_n(x)| le 0.01$; this would tell us that the value of the $n$th order Taylor polynomial at $x$ is within $0.01$ of the actual function value at $x$. Error bounds use assumptions on $f$ to bound $|R_n(x)|$.
$endgroup$
add a comment |
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
});
}
});
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%2f3066899%2funderstanding-taylor-series-error-function-and-lagrange-error-bound%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
$begingroup$
$R_n(x)$ is defined to be the difference between the function and its $n$th order Taylor polynomial (not series).
It is an important consequence of the Mean Value Theorem that there exists $z$ between $x$ and $c$ such that the remainder can be written as $R_n(x) = frac{f^{(n+1)}(z)}{(n+1)!} (x-c)^{n+1}$. However in general we do not know more about the exact value of $z$ (or $f^{(n+1)}(z)$) beyond the fact that it lies between $x$ and $c$.
Since we often cannot compute the remainder explicitly, we would like to bound it. For example, it would be nice to say $|R_n(x)| le 0.01$; this would tell us that the value of the $n$th order Taylor polynomial at $x$ is within $0.01$ of the actual function value at $x$. Error bounds use assumptions on $f$ to bound $|R_n(x)|$.
$endgroup$
add a comment |
$begingroup$
$R_n(x)$ is defined to be the difference between the function and its $n$th order Taylor polynomial (not series).
It is an important consequence of the Mean Value Theorem that there exists $z$ between $x$ and $c$ such that the remainder can be written as $R_n(x) = frac{f^{(n+1)}(z)}{(n+1)!} (x-c)^{n+1}$. However in general we do not know more about the exact value of $z$ (or $f^{(n+1)}(z)$) beyond the fact that it lies between $x$ and $c$.
Since we often cannot compute the remainder explicitly, we would like to bound it. For example, it would be nice to say $|R_n(x)| le 0.01$; this would tell us that the value of the $n$th order Taylor polynomial at $x$ is within $0.01$ of the actual function value at $x$. Error bounds use assumptions on $f$ to bound $|R_n(x)|$.
$endgroup$
add a comment |
$begingroup$
$R_n(x)$ is defined to be the difference between the function and its $n$th order Taylor polynomial (not series).
It is an important consequence of the Mean Value Theorem that there exists $z$ between $x$ and $c$ such that the remainder can be written as $R_n(x) = frac{f^{(n+1)}(z)}{(n+1)!} (x-c)^{n+1}$. However in general we do not know more about the exact value of $z$ (or $f^{(n+1)}(z)$) beyond the fact that it lies between $x$ and $c$.
Since we often cannot compute the remainder explicitly, we would like to bound it. For example, it would be nice to say $|R_n(x)| le 0.01$; this would tell us that the value of the $n$th order Taylor polynomial at $x$ is within $0.01$ of the actual function value at $x$. Error bounds use assumptions on $f$ to bound $|R_n(x)|$.
$endgroup$
$R_n(x)$ is defined to be the difference between the function and its $n$th order Taylor polynomial (not series).
It is an important consequence of the Mean Value Theorem that there exists $z$ between $x$ and $c$ such that the remainder can be written as $R_n(x) = frac{f^{(n+1)}(z)}{(n+1)!} (x-c)^{n+1}$. However in general we do not know more about the exact value of $z$ (or $f^{(n+1)}(z)$) beyond the fact that it lies between $x$ and $c$.
Since we often cannot compute the remainder explicitly, we would like to bound it. For example, it would be nice to say $|R_n(x)| le 0.01$; this would tell us that the value of the $n$th order Taylor polynomial at $x$ is within $0.01$ of the actual function value at $x$. Error bounds use assumptions on $f$ to bound $|R_n(x)|$.
answered Jan 9 at 0:18
angryavianangryavian
40.6k23380
40.6k23380
add a comment |
add a comment |
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.
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%2f3066899%2funderstanding-taylor-series-error-function-and-lagrange-error-bound%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