Example 5.  What is the maximum over the interval  [0, 1]  for each of the quantities, where  [Graphics:Images/ChebyshevPolyMod_gr_442.gif]  is the Chebyshev polynomial.
5 (a).  Find  [Graphics:Images/ChebyshevPolyMod_gr_443.gif].  
5 (b).  Find  [Graphics:Images/ChebyshevPolyMod_gr_444.gif].  
5 (c).  Find  [Graphics:Images/ChebyshevPolyMod_gr_445.gif].  
5 (d).  Find  [Graphics:Images/ChebyshevPolyMod_gr_446.gif].  
5 (e).  Find  [Graphics:Images/ChebyshevPolyMod_gr_447.gif].  
5 (f).  Compare the result with the error bounds for the Lagrange polynomial based on equally spaced points.

Solution 5.

5 (a-e).  The error bounds for the Chebyshev polynomials are:

[Graphics:../Images/ChebyshevPolyMod_gr_448.gif]



[Graphics:../Images/ChebyshevPolyMod_gr_449.gif]

[Graphics:../Images/ChebyshevPolyMod_gr_450.gif]

[Graphics:../Images/ChebyshevPolyMod_gr_451.gif]

[Graphics:../Images/ChebyshevPolyMod_gr_452.gif]

[Graphics:../Images/ChebyshevPolyMod_gr_453.gif]

5 (f).  The error bounds for the Lagrange polynomial based on equally spaced abscissas were


    [Graphics:../Images/ChebyshevPolyMod_gr_454.gif]  

The error bound for the Chebyshev polynomial is smaller than the error bound for the Lagrange polynomial using equally spaced abscissas.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004