Can someone explain the Taylor's Theorem error bound?

Click For Summary
The discussion clarifies the Taylor's Theorem error bound, emphasizing that the error E(x) is defined as the difference between the actual function value f(x) and its Taylor polynomial approximation Tn(x). The expression M*(x-a)^(n+1)/(n+1)! serves as an upper bound for the error, allowing for estimation without knowing the exact function or its derivatives. By finding a suitable positive number M that bounds the (n+1)th derivative of f, one can ensure that the worst-case error is manageable. This approach is crucial for practical applications where exact values are not available. Understanding these concepts helps in effectively using Taylor polynomials for approximations.
A.MHF
Messages
26
Reaction score
1

Homework Statement



So I've read a lot about this but still can't figure what's going on.
I understand that to find the error of approximation all we have to do is:
|E(x)| = |f(x)-Tn(x)|
But what about
M*(xn+1/(n+1)!)
What's the point of this? and why does it have to be greater than or equal to |E(x)|? How would evaluating the next derivative of the desired Taylor polynomial help us?

Homework Equations



-

The Attempt at a Solution



-[/B]
 
Physics news on Phys.org
I moved your question to the discussion forum since it's more general than a homework problem.

f(x) is the exact value of the function evaluated at x. Tn(x) is an approximation of f(x). The error E(x) is, by definition, the difference between the actual value f(x) and the approximate value we get from Tn(x). So when you write ##\lvert E(x) \rvert = \lvert f(x)-T_n(x) \rvert##, you're doing little more than stating the definition of E(x).

Keep in mind that we generally don't know what ##f(x)## is equal to. We need some way of calculating the answer. That's where ##T_n(x)## comes in. If you want the exact answer, you'll have to sum an infinite number of terms. But most of the time, we don't need an exact answer; we just need one that's close enough. In other words, we only need to sum a finite number of terms so that |E(x)| is small enough for our purposes. But remember, we don't know what f(x) is, so somehow we have to be able to come up with an upper bound for E(x) without knowing what f(x) is. That's where the expression for the error bound comes in.
 
  • Like
Likes Fervent Freyja and A.MHF
A.MHF said:

Homework Statement



So I've read a lot about this but still can't figure what's going on.
I understand that to find the error of approximation all we have to do is:
|E(x)| = |f(x)-Tn(x)|
<Snip>

-

This is an _estimate_ of the error; if you knew the actual error, you add it to the function and get the actual value.
 
  • Like
Likes A.MHF
A.MHF said:

Homework Statement



So I've read a lot about this but still can't figure what's going on.
I understand that to find the error of approximation all we have to do is:
|E(x)| = |f(x)-Tn(x)|
But what about
M*(xn+1/(n+1)!)
What's the point of this? and why does it have to be greater than or equal to |E(x)|? How would evaluating the next derivative of the desired Taylor polynomial help us?

Homework Equations



-

The Attempt at a Solution



-[/B]

The actual error ##E_n(x) = f(x) - T_n(x)## when we expand about ##x = a## has the form
E_n(x) = \frac{(x-a)^{n+1}}{(n+1)!} f^{(n+1)}(\xi),
where ##\xi## is some unknown point in the interval between ##a## and ##x##, and ##f^{(n+1)}## is the ##(n+1)##st derivative of ##f##. Since we generally do not know the value of ##\xi## explicitly, and also may not even know exact numerical values of the function ##f^{(n+1)}##, we cannot in general compute the error exactly. However, we can bound the error a lot more easily: if we somehow find a positive number ##M## such that ##|f^{(n+1)}(\xi)| \leq M## for sure, then we know that
|E_n(x)| \leq \frac{M (x-a)^{n+1}}{(n+1)!},
so we at least know the worst-case error (which will almost always be worse than the actual error). The best value of ##M## in this regard is the maximum of ##|f^{(n)}|## on the interval between ##x## and ##a##, but even that will often be unavailable or unobtainable. In that case, just choose any ##M## larger than that. Usually it is not too difficult to cook up such a value in a practical problem.
 
  • Like
Likes A.MHF
Thanks guys, that was super helpful!
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
Replies
5
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K