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
, of
degree n = 2.
![[Graphics:../Images/ChebyshevPolyMod_gr_257.gif]](../Images/ChebyshevPolyMod_gr_257.gif)
Compare the maximum error with the
theoretical error bound:
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
, of
degree n = 2.
![[Graphics:../Images/ChebyshevPolyMod_gr_269.gif]](../Images/ChebyshevPolyMod_gr_269.gif)
Compare the maximum error with the
theoretical error bound:
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
, of
degree n = 3.
![[Graphics:../Images/ChebyshevPolyMod_gr_281.gif]](../Images/ChebyshevPolyMod_gr_281.gif)
Compare the maximum error with the
theoretical error bound:
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
, of
degree n = 4.
![[Graphics:../Images/ChebyshevPolyMod_gr_293.gif]](../Images/ChebyshevPolyMod_gr_293.gif)
Compare the maximum error with the
theoretical error bound:
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
, of
degree n = 5.
![[Graphics:../Images/ChebyshevPolyMod_gr_305.gif]](../Images/ChebyshevPolyMod_gr_305.gif)
Compare the maximum error with the
theoretical error bound:
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