Calculus and Numerical Methods. Second unit.
12 January 2015
Name: ..........................................................................................
1. (3 points) A line passing through the point (4, 1) together with the x and y axes determine a
triangle in the rst quadrant. Find the triangle with minimum area.
2. (3 p.) We consider the function f (x) = e3x .
a ) Find an approximation of e3/4 using the 3-order Maclaurin polynomial of f . Determine an
upper bound of the error.
b ) We consider the following values of the function f :
xi 0.1 0.2 0.3 0.4
f (xi ) 1.3499 1.8221 2.4596 3.3201
Find the linear (points 0.2 and 0.3), quadratic (0.2, 0.3 y 0.4) and cubic interpolating
polynomials. Determine two approximations of e3/4 using the linear and the cubic inter-
polation, and nd an upper bound of the errors.
3. (4 p) We consider the equation
ex − 5x − 2 = 0 .
a ) Show that there are two solutions, one positive (which we call p) and the other negative.
Find an interval [a, a + 1], with a ∈ Z, where p is.
b ) Using the bisection method, nd an approximation of p up to an error of 0.2.
c ) Using the Newton's method, nd an approximation of p up to an error of 10−4 .
d ) Transform the equation f (x) = 0 into an equation g(x) = x such that g veri es the
convergence conditions of the xed point method for p. Determine the number of iterations
we need to approximate p up to an error of 10−3 .
Formulas
Taylor's polynomial remainder (order n at a = 0):
f (n+1) (c) n+1
·x
(n + 1)!
where c is a point in the interval whose endpoints are x and 0.
Error using polynomial interpolation for the points x0 < x1 < . . . < xn :
f (n+1) (c)
· (x − x0 )(x − x1 ) · · · (x − xn )
(n + 1)!
where c ∈ (x0 , xn ) and x is a point in (x0 , xn ).
Bisection method: an upper bound for the error
b−a
2n
Newton's method: the iteration formula
f (pn−1 )
pn = pn−1 − , ∀n ≥ 1
f 0 (pn−1 )
Theorem: If f is two times dierentiable on [a,b], and
(a) f (a) · f (b) < 0,
(b) f 0 (x) 6= 0 ∀x ∈ [a, b],
(c) f 00 (x) ≥ 0, ∀x ∈ [a, b] or f 00 (x) ≤ 0, ∀x ∈ [a, b],
then (pn ) is convergent to the root if p0 ∈ [a, b] veri es f (p0 ) · f 00 (p0 ) > 0
Upper bound for the error (Newton's method):
M
|pn − pn−1 |2
2m
where m is a lower bound of |f 0 | and M an upper bound of |f 00 | in [a, b].
Fixed point method: the iteration formula
(
p0 ∈ [a, b]
pn = g(pn−1 )
Theorem: If
(i) g is continuous on [a, b] and g(x) ∈ [a, b], ∀x ∈ [a, b].
(ii) g is dierentiable on (a, b) and there exists k ∈ (0, 1) such that |g 0 (x)| ≤ k ∀x ∈ (a, b),
then pn converges to the unique xed point of g in [a, b], and an upper bound of the error is
kn
|p1 − p0 |
1−k
