Chebyshev nodes

From Wikipedia, the free encyclopedia

In numerical analysis, Chebyshev nodes are the roots of the Chebyshev polynomial of the first kind. They are often used as nodes in polynomial interpolation because the resulting interpolation polynomial minimizes the problem of Runge's phenomenon.

1 Definition
2 Notes
3 Approximation using Chebyshev nodes
4 References

[edit] Definition

For a given n, the n Chebyshev nodes are

$x_i = \cos\left(\frac{2i-1}{2n}\pi\right) \mbox{ , } i=1,\ldots,n.$

[edit] Notes

All Chebyshev nodes are contained in the interval [−1, 1]. To get nodes over an arbitrary interval [a, b] a linear transformation can be used.

$\tilde{x}_i = \frac{1}{2} (a+b) + \frac{1}{2} (b-a) \cos\left(\frac{2i-1}{2n}\pi\right).$

[edit] Approximation using Chebyshev nodes

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 [−1, 1], we want to find a polynomial of some given degree, say n, which approximates f well in the maximum norm or Chebyshev norm which is defined as

$\|g\|_{\infty} := \max \lbrace\, |g(x)| : x \in [-1,1]\, \rbrace.$

Such a polynomial p can be constructed by polynomial interpolation: we pick n + 1 points x₀, ..., x_n in the interval [−1, 1], and then we let p be the unique polynomial which coincides with f on these points.

The interpolation error for polynomial interpolation is

$f(x) - p(x) = \frac{f^{(n+1)}(\xi)}{(n+1)!} \prod_{i=0}^n (x-x_i)$

for some $ξ$ in [−1, 1]. So it is logical to try to minimize

$\max_{x \in [-1,1]} \prod_{i=0}^n (x-x_i).$

The product Π (x − x_i) is a polynomial of degree n + 1 with leading coefficient 1 (such a polynomial is said to be monic). It turns out that the maximum norm of any such polynomial is greater than or equal to 2⁻ⁿ. Furthermore, the scaled Chebyshev polynomials 2⁻ⁿ T_n+1 are monic and attain equality, because |T_n+1(x)| ≤ 1 for x ∈ [−1, 1].