Solution 1.
1 (a). Using the
nodes
.
Now plot the function
and
polynomial
.
![[Graphics:../Images/LagrangePolyMod_gr_117.gif]](../Images/LagrangePolyMod_gr_117.gif)
1 (b). Using the
nodes
.
Now plot the function
and
polynomial
.
![[Graphics:../Images/LagrangePolyMod_gr_127.gif]](../Images/LagrangePolyMod_gr_127.gif)
1 (c). Using the
nodes
.
Now plot the function
and
polynomial
.
![[Graphics:../Images/LagrangePolyMod_gr_137.gif]](../Images/LagrangePolyMod_gr_137.gif)
Notice that the three polynomials of degree n = 1 were different.
Compare the various graphs.
![[Graphics:../Images/LagrangePolyMod_gr_151.gif]](../Images/LagrangePolyMod_gr_151.gif)
Notice that the three polynomials of degree n = 1 are different. The error in approximating f[x] will also be different.
![[Graphics:../Images/LagrangePolyMod_gr_157.gif]](../Images/LagrangePolyMod_gr_157.gif)
Which polynomial has the smallest overall error on the entire
interval
. Later
we will discover that
was
based on "Chebyshev's nodes."
(c) John H. Mathews 2004