Chebyshev nodes explained

[ -1 , 1 ], 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. Polynomial interpolants constructed from these nodes minimize the effect of Runge's phenomenon.

Definition

For a given positive integer

n the Chebyshev nodes of the first kind in the open interval ( -1 , 1 ) are$$x\_k\; =\; \backslash cos\backslash left(\backslash frac\backslash pi\backslash right),\; \backslash quad\; k\; =\; 0,\; \backslash ldots,\; n-1.$$

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:$$x\_k\; =\; \backslash frac\; +\; \backslash frac\; \backslash cos\backslash left(\backslash frac\backslash pi\backslash right),\; \backslash quad\; k\; =\; 0,\; \backslash ldots,\; n-1.$$

Similarly, for a given positive integer

n the Chebyshev nodes of the second kind in the closed interval [ -1 , 1 ] are$$x\_k\; =\; \backslash cos\backslash left(\backslash frac\backslash pi\backslash right),\; \backslash quad\; k\; =\; 0,\; \backslash ldots,\; n-1.$$

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. 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

The Chebyshev nodes are important in approximation theory because they form a particularly good set of nodes for polynomial interpolation. Given a function on the interval

[ -1 , +1 ] and n points x _{1,} x _{2,} \ldots , x _{n,} in that interval, the interpolation polynomial is that unique polynomial P _{n-1} of degree at most n - 1 which has value f(x _{i)} at each point x _{i} . The interpolation error at x is$$f(x)\; -\; P\_(x)\; =\; \backslash frac\; \backslash prod\_^n\; (x-x\_i)$$for some \xi (depending on) in . So it is logical to try to minimize$$\backslash max\_\; \backslash biggl|\; \backslash prod\_^n\; (x-x\_i)\; \backslash biggr|.$$

This product is a monic polynomial of degree . It may be shown that the maximum absolute value (maximum norm) of any such polynomial is bounded from below by . This bound is attained by the scaled Chebyshev polynomials, which are also monic. (Recall that for .) Therefore, when the interpolation nodes are the roots of, the error satisfies$$\backslash left|f(x)\; -\; P\_(x)\backslash right|\; \backslash le\; \backslash frac\; \backslash max\_\; \backslash left|\; f^\; (\backslash xi)\; \backslash right|.$$For an arbitrary interval [''a'', ''b''] a change of variable shows that$$\backslash left|f(x)\; -\; P\_(x)\backslash right|\; \backslash le\; \backslash frac\; \backslash left(\backslash frac\backslash right)^n\; \backslash max\_\; \backslash left|f^\; (\backslash xi)\backslash right|.$$

Even order modified Chebyshev nodes

Many applications for Chebyshev nodes, such as the design of equally terminated passive Chebyshev filters, cannot use Chebyshev nodes directly, due to the lack of a root at 0. However, the Chebyshev nodes may be modified into a usable form by translating the roots down such that the lowest roots are moved to zero, thereby creating two roots at zero of the modified Chebyshev nodes.^[1]

The even order modification translation is:

X _{kEven} = \sqrt{ (X ^{2} _{n/ 2})/(1- X ^{2} _{n/ 2}) } \text n>2

The sign of the

\sqrt{ } function is chosen to be the same as the sign of X _{k} .

For example, the Chebyshev nodes for a 4th order Chebyshev function are,, and

X ^{2} _{n/ 2} is 0 . 382683 ^{2} , or 0.146446. Running all the nodes through the translation yields X _{kEven} to be .

The modified even order Chebyshev nodes now contains two nodes of zero, and is suitable for use in designing even order Chebyshev filters with equally terminated passive element networks.

References

• Book: Fink . Kurtis D. . John H. . Mathews . Numerical Methods using MATLAB . Upper Saddle River NJ . Prentice Hall . 1999 . 3rd .
• Book: Stewart . Gilbert W. . Afternotes on Numerical Analysis . . 978-0-89871-362-6 . 1996 .

Further reading

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

Notes and References

1. Book: Saal, Rudolf . Handbook of Filter Design . Allgemeine Elektricitais-Gesellschaft . January 1979 . 3-87087-070-2 . 1st . Munich, Germany . 25, 26, 56-61, 116, 117 . English, German.