Polynomial Interpolation Using Equispaced versus Chebyshev-Lobatto Points

This Demonstration plots in the interval as well as the function's polynomial interpolation for equally spaced points and for the Chebyshev–Lobatto points.
In the discrete Chebyshev–Gauss–Lobatto case, the interior points are given by . These points are the extremums of the Chebyshev polynomial of the first kind .
You can change the degree of interpolation or the number of interior interpolation points, . As gets larger, the error (computed as the norm of vector with varying from to with a spacing of 0.005), displayed with the red text in the figure, decreases exponentially for the Chebyshev–Lobatto points, while the same computed error increases exponentially in the equispaced case. This behavior is known as the Runge phenomenon.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


[1] L. N. Trefethen, Spectral Methods in Matlab, Philadelphia: SIAM, 2000.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.