MATH 174 B

Laboratory Exercise 6
` Optimal Polynomial Interpolation
ANSWER KEY

Score:

15
15

Do as indicated.
1. In the lecture, we had defined the Chebyshev Polynomials both in their trigonometric and recursive
form. Specifically, we had seen that the degree n Chebyshev Polynomial can be derived by using
Chebyshev polynomials of lower degree using the recursive formula
Tn+1 (x) = 2xTn (x) Tn1 (x) with T0 (x) = 1 and T1 (x) = x.
Generate T11 (x) and find the corresponding monic Chebyshev polynomial T11 (x). Write both polynomials below together with their roots.
Answer: The Chebyshev polynomial of degree 11 is
T11 (x) = 1024x11 2816x9 + 2816x7 1232x5 + 220x3 11x
2pts
while its corresponding monic version is
11x7
77x5
55x3
11x
11x9
+

.
T11 (x) = x11
4
4
64
256
1024

1pt

The roots of both of these polynomials are approximately

0.989821, 0.909632, 0.75575, 0.540641, 0.281733, 0, 0.281733, 0.540641, 0.75575, 0.909632, 0.989821.
1pt
2. Recall that our goal in this section is to minimize the error
n+1
f (n+1) () Y
En (x) =
(x xi )
(n + 1)! i=1

in the polynomial interpolation of a function f . Since the first factor is fixed in the sense that we
cannot alter the given function, our only hope of minimizing the error with respect to some measure
n+1
Y
of error is to minimize (x) =
(x xi ). This is where the Chebyshev polynomials come in play.
i=1

Note that we have proved that Tn+1 has the least possible ` norm among all monic polynomials of
degree n + 1. Since is monic and of degree n + 1, it follows that
kTn+1 k 6 kk.
Therefore, for the error En to be minimum with respect to the ` norm, we should set
(x) = Tn+1 (x). Having realized this, what are the abscissas (xi s) that should be used in the
interpolation.
(Hint: What is the significance of the xi s to ? Then relate this to Tn+1 .)
Note: If you cannot think of the answer and wishes to proceed to the next item, you
may ask your laboratory teacher. But doing so will forfeit any score for this item.
Answer: Note that each of the interpolatory abscissas xj is a zero of , then setting (x) = Tn+1
will imply that xj is a zero of Tn+1 (x). Hence, to minimize kk the nodes must be chosen to
coincide with the zeros of Tn+1 .
3pts
However, it should be noted that since the domain of Tn+1 is [1, 1] then our abscissas will always
lie in this interval irregardless of the intended domain of the interpolating polynomial. Whenever
the interval of interpolation [a, b] is not [1, 1], we scale the roots xj to get the new set of abscissas
xj given by
ba
a+b
xj =
xj +
, j = 1, ..., n, n + 1.
2
2

3. Last week, we approximated the probability that you will pass the second exam. Recall that this
probability is given by
Z 1
(x0.4098)2
1

e 2(0.2306)2 dx.
0.6 0.2306 2
This time, approximate this integral by interpolating the integrand using 11 abscissas that will
minimize the ` norm of the error. Write the interpolating polynomial and the probability below.
Answer: The interpolating polynomial derived using the scaled zeros of Tn+1 is
P10 (x) =0.3568019 + 2.7195121x + 8.3563436x2 14.64309x3 + 79.173878x4 456.87868x5
+ 777.24533x6 266.41122x7 512.02094x8 + 532.67626x9 150.50898x10
3pts
and the approximate for the probability of passing the second exam is
Z 1
P10 (x)dx 0.199494.
0.6

1pt

4. Determine
the accuracy of the interpolation above by giving the error bound. Note that



max f (11) (x) 5.14042 1010 .
x[0,1]

Solution:


 f (n+1) () n+1

Y


|En (x)| = 
(x xi ) , (0, 1)
 (n + 1)!

i=1
 (n+1) 
f
() 
6 max 
max |(x)|
x[0,1] (n + 1)!  x[0,1]




But max f (11) (x) 5.14042 1010 and max |(x)| = kk = 1.45082 106 . Hence,
x[0,1]

x[0,1]

|En (x)| 6

5.14042 1010
1.45082 106 0.00186834.
11!

2pts

5. Now we have another interpolating polynomial for the integrand. Why will this not belie the Unisolvence Theorem?
Answer: These polynomials are not covered by the Unisolvence Theorem since they have different
interpolation abscissas.
2pts

***end of exercise***