Chebyshev nodes

From Wikipedia, the free encyclopedia
Here we plot the Chebyshev nodes of the first kind and the second kind, both for n = 8. For both kinds of nodes, we first plot the points equi-distant on the upper half unit circle in blue. Then the blue points are projected down to the x-axis. The projected points, in red, are the Chebyshev nodes.

In numerical analysis, Chebyshev nodes are a set of specific real algebraic numbers, used as nodes for polynomial interpolation. They are the projection of equispaced points on the unit circle onto the real interval the diameter of the circle.

The Chebyshev nodes of the first kind, also called the Chebyshev zeros, are the zeros of the Chebyshev polynomials of the first kind. The Chebyshev nodes of the second kind, also called the Chebyshev extrema, are the extrema of the Chebyshev polynomials of the first kind, which are also the zeros of the Chebyshev polynomials of the second kind. Both of these sets of numbers are commonly referred to as Chebyshev nodes in literature.[1] Polynomial interpolants constructed from these nodes minimize the effect of Runge's phenomenon.[2]

Definition[edit]

Chebyshev nodes of both kinds from to <.

For a given positive integer n the Chebyshev nodes of the first kind in the open interval (−1, 1) are

These are the roots of the Chebyshev polynomials of the first kind with degree n. For nodes over an arbitrary interval [a, b] an affine transformation can be used:

Similarly, for a given positive integer n the Chebyshev nodes of the second kind in the closed interval [−1, 1] are

These are the roots of the Chebyshev polynomials of the second kind with degree n. For nodes over an arbitrary interval [a, b] an affine transformation can be used as above. The Chebyshev nodes of the second kind are also referred to as Chebyshev-Lobatto points or Chebyshev extreme points.[3] Note that the Chebyshev nodes of the second kind include the end points of the interval while the Chebyshev nodes of the first kind do not include the end points. These formulas generate Chebyshev nodes which are sorted from greatest to least on the real interval.

Both kinds of nodes are always symmetric about the midpoint of the interval. Hence, for odd n, both kinds of nodes will include the midpoint. Geometrically, for both kinds of nodes, we first place n points on the upper half of the unit circle with equal spacing between them. Then the points are projected down to the x-axis. The projected points on the x-axis are called Chebyshev nodes.

Approximation[edit]

The Chebyshev nodes are important in approximation theory because they form a particularly good set of nodes for polynomial interpolation. Given a function f on the interval and points in that interval, the interpolation polynomial is that unique polynomial of degree at most which has value at each point . The interpolation error at is

for some (depending on x) in [−1, 1].[4] So it is logical to try to minimize

This product is a monic polynomial of degree n. It may be shown that the maximum absolute value (maximum norm) of any such polynomial is bounded from below by 21−n. This bound is attained by the scaled Chebyshev polynomials 21−n Tn, which are also monic. (Recall that |Tn(x)| ≤ 1 for x ∈ [−1, 1].[5]) Therefore, when the interpolation nodes xi are the roots of Tn, the error satisfies

For an arbitrary interval [a, b] a change of variable shows that

Notes[edit]

  1. ^ Trefethen 2012, pp. 7
  2. ^ Fink & Mathews 1999, pp. 236–238
  3. ^ Trefethen 2012, pp. 7
  4. ^ Stewart 1996, (20.3)
  5. ^ Stewart 1996, Lecture 20, §14

References[edit]

  • Fink, Kurtis D.; Mathews, John H. (1999). Numerical Methods using MATLAB (3rd ed.). Upper Saddle River NJ: Prentice Hall.
  • Stewart, Gilbert W. (1996). Afternotes on Numerical Analysis. SIAM. ISBN 978-0-89871-362-6.
  • Trefethen, Lloyd N. (2012), Approximation Theory and Approximation Practice, SIAM

Further reading[edit]

  • Burden, Richard L.; Faires, J. Douglas: Numerical Analysis, 8th ed., pages 503–512, ISBN 0-534-39200-8.