Example 4.  Error Analysis.  Investigate the error for the Chebyshev polynomial approximations in Example 3.

Solution 4.

4 (a).  Investigate the error for the Chebyshev interpolation polynomial [Graphics:../Images/ChebyshevPolyMod_gr_367.gif],  of degree n = 2.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_370.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_371.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_372.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_373.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_374.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

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

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

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

The error bound is about 1.15 times as large as the maximum error.  This is to be expected, after all it is an "error bound."

 

 

 

4 (b).  Investigate the error for the Chebyshev interpolation polynomial [Graphics:../Images/ChebyshevPolyMod_gr_382.gif],  of degree n = 2.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_385.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_386.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_387.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_388.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_389.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

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

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

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

The error bound is about 1.6 times as large as the maximum error.  This is to be expected, after all it is an "error bound."

 

 

 

4 (c).  Investigate the error for the Chebyshev interpolation polynomial [Graphics:../Images/ChebyshevPolyMod_gr_397.gif],  of degree n = 3.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_400.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_401.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_402.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_403.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_404.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

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

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

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

The error bound is about 1.11 times as large as the maximum error.  This is to be expected, after all it is an "error bound."

 

 

 

4 (d).  Investigate the error for the Chebyshev interpolation polynomial [Graphics:../Images/ChebyshevPolyMod_gr_412.gif],  of degree n = 4.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_415.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_416.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_417.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_418.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_419.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

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

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

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

The error bound is about 1.6 times as large as the maximum error.  This is to be expected, after all it is an "error bound."

 

 

 

4 (e).  Investigate the error for the Chebyshev interpolation polynomial [Graphics:../Images/ChebyshevPolyMod_gr_427.gif],  of degree n = 5.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_430.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_431.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_432.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_433.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_434.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

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

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

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

The error bound is about 1.11 times as large as the maximum error.  This is to be expected, after all it is an "error bound."

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004