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
, of
degree n = 2.
![[Graphics:../Images/ChebyshevPolyMod_gr_369.gif]](../Images/ChebyshevPolyMod_gr_369.gif)
Compare the maximum error with the
theoretical error bound:
![[Graphics:../Images/ChebyshevPolyMod_gr_378.gif]](../Images/ChebyshevPolyMod_gr_378.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
, of
degree n = 2.
![[Graphics:../Images/ChebyshevPolyMod_gr_384.gif]](../Images/ChebyshevPolyMod_gr_384.gif)
Compare the maximum error with the
theoretical error bound:
![[Graphics:../Images/ChebyshevPolyMod_gr_393.gif]](../Images/ChebyshevPolyMod_gr_393.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
, of
degree n = 3.
![[Graphics:../Images/ChebyshevPolyMod_gr_399.gif]](../Images/ChebyshevPolyMod_gr_399.gif)
Compare the maximum error with the
theoretical error bound:
![[Graphics:../Images/ChebyshevPolyMod_gr_408.gif]](../Images/ChebyshevPolyMod_gr_408.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
, of
degree n = 4.
![[Graphics:../Images/ChebyshevPolyMod_gr_414.gif]](../Images/ChebyshevPolyMod_gr_414.gif)
Compare the maximum error with the
theoretical error bound:
![[Graphics:../Images/ChebyshevPolyMod_gr_423.gif]](../Images/ChebyshevPolyMod_gr_423.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
, of
degree n = 5.
![[Graphics:../Images/ChebyshevPolyMod_gr_429.gif]](../Images/ChebyshevPolyMod_gr_429.gif)
Compare the maximum error with the
theoretical error bound:
![[Graphics:../Images/ChebyshevPolyMod_gr_438.gif]](../Images/ChebyshevPolyMod_gr_438.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