Example 2.  Error Analysis.  Investigate the error for the Chebyshev polynomial approximations in Example 1.

Solution 2.

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

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_258.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_259.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_260.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_261.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_262.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

The error bound is about 2.6 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_267.gif],  of degree n = 2.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_270.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_271.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_272.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_273.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_274.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

The error bound is about 2.3 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_279.gif],  of degree n = 3.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_282.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_283.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_284.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_285.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_286.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

The error bound is about 2.3 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_291.gif],  of degree n = 4.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_294.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_295.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_296.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_297.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_298.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

The error bound is about 2.3 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_303.gif],  of degree n = 5.

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


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

[Graphics:../Images/ChebyshevPolyMod_gr_306.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_307.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_308.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_309.gif]
[Graphics:../Images/ChebyshevPolyMod_gr_310.gif]

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

Compare the maximum error with the theoretical error bound:

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

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

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

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

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2004