AP Calculus BC
Lagrange Error Bound: Bounding Taylor Polynomial Error
If P_n is the degree n Taylor polynomial for f centered at a, then |f(x) - P_n(x)| <= M |x - a|^(n+1) / (n+1)!, where M is at least as large as the absolute value of the (n+1)st derivative of f everywhere between a and x. The bound is a ceiling on the error and is usually larger than the actual error.
The bound
A Taylor polynomial centered at approximates near (CED Topic 10.11, Finding Taylor Polynomial Approximations of Functions). The Lagrange error bound, CED Topic 10.12, limits how far off that approximation can be.
Here is a number satisfying for every between and . The right side has the same shape as the next term of the Taylor polynomial, with the derivative value replaced by its largest possible size on the interval.
Three inputs go into it: the degree of the polynomial, the distance from the center, and the bound . Everything in the formula uses : the derivative order, the factorial and the power.
Choosing M
Finding is the only step that takes judgment. does not have to be the exact maximum of . Any number that is at least as large works, and a simple overestimate is often the best choice.
| Situation | How to get M |
|---|---|
| is or | Use , since sine and cosine never exceed in absolute value |
| is increasing on the interval | Use its value at the endpoint farthest to the right |
| is decreasing on the interval | Use its value at the left endpoint |
| The problem states a bound on | Use the stated bound |
| The maximum is an awkward number such as | Round up to a convenient value, such as |
The interval that matters runs from the center to the point being approximated. must cover the whole interval. Evaluating the derivative only at the center is a common error and can give a value that is too small.
Three ways the bound is used
- Bound the error of a given approximation. Compute and report it as the largest possible error.
- Trap the true value. If the error is at most , then .
- Find a degree that guarantees a required accuracy. Write the bound in terms of and increase until it falls below the tolerance.
For the third use, take approximated at by a Maclaurin polynomial. Every derivative of sine is bounded by , so the error is at most . To get this under , compare factorials: gives , which is too large, and gives , which is small enough. So , and the bound first guarantees the accuracy at degree .
Lagrange bound or alternating series bound
Two error bounds appear in this unit, and they apply in different situations. The Lagrange bound works for any Taylor polynomial as long as you can bound the next derivative. The alternating series error bound (CED Topic 10.10) applies only when the Taylor series, evaluated at the given , is an alternating series whose terms decrease in size to . In that case the error is at most the size of the first omitted term, with no derivative needed.
When both apply, either one is valid, and the alternating bound is usually less work. When the series does not alternate at the given , such as the series for at a positive , the Lagrange bound is the one to use.
Common mistakes
- Using the th derivative. The bound uses derivative number .
- Writing in the denominator or in the numerator. Both use .
- Evaluating only at the center. must hold on the whole interval between and .
- Using where belongs when the center is not .
- Stating that the error equals the bound. Write that the error is at most the bound.
- Choosing an that requires knowing the very value being approximated. Round up to a number you can justify.
Worked examples
Worked example
A sine approximation with M = 1
The third-degree Maclaurin polynomial for is . Use the Lagrange error bound to bound the error in approximating with .
- Identify the inputs: , , , so the bound uses the fourth derivative.
- The fourth derivative of is , and for all . Take .
- Apply the bound: .
- A sharper bound is available. The Maclaurin polynomial for sine has no term, so . Using with the fifth derivative and : the error is at most .
- Check: and . The actual error is about , inside both bounds.
With the error is at most . Treating the same polynomial as tightens this to about .
Worked example
An exponential with a rounded-up M
Use , the second-degree Maclaurin polynomial for , to approximate , and bound the error.
- Compute the approximation: .
- Identify the inputs: , , . The third derivative is .
- Find on . Since is increasing, its maximum there is . That is the number being approximated, so round up: gives . Take .
- Apply the bound: .
- Check: , so the actual error is about , under the bound.
with error at most .
Worked example
A derivative bound supplied by the problem
A function has derivatives of all orders, with , and . It is known that for . Approximate with the second-degree Taylor polynomial centered at , and find an interval that must contain .
- Build the polynomial: .
- Evaluate at , where : .
- Identify the inputs for the bound: , , and from the given information.
- Apply the bound: .
- Trap the true value: .
with error at most , so .
Frequently asked questions
How do I choose M in the Lagrange error bound?
Look at the derivative of order on the interval between the center and the -value. If it is a sine or cosine, use . If its absolute value is increasing or decreasing, use the value at the endpoint where it is largest. If the problem gives a bound, use that. You may always round up to a simpler number, because any at least as large as the true maximum is valid.
Is the Lagrange error bound the actual error?
No. It is an upper limit on the size of the error. The actual error is usually smaller, sometimes much smaller. In the example above, the bound is about and the actual error is about .
When can I use the alternating series error bound instead?
When the Taylor series at the given alternates in sign and its terms decrease in size to . Then the error of a partial sum is at most the size of the first omitted term. For a series that does not alternate at that , use the Lagrange bound.