Math 2.0

Numerical analysis Definition

Chebyshev nodes

Builds on Chebyshev polynomialsInterval

Definition

Let n≥1n \ge 1 be an integer. The Chebyshev nodes of order nn in [−1,1][-1, 1] are the nn numbers xk=cos⁡((2k−1)π2n),k=1,…,n.x_k = \cos\left(\frac{(2k - 1)\pi}{2n}\right), \qquad k = 1, \dots, n. They are the zeros of the Chebyshev polynomial TnT_n of the first kind. For an interval [a,b][a, b] with a<ba < b, the Chebyshev nodes of order nn in [a,b][a, b] are the numbers a+b2+b−a2xk\frac{a + b}{2} + \frac{b - a}{2} x_k, k=1,…,nk = 1, \dots, n.

Remarks

Example: for n=3n = 3 the nodes are cos⁡(π/6),cos⁡(π/2),cos⁡(5π/6)\cos(\pi/6), \cos(\pi/2), \cos(5\pi/6), that is 3/2\sqrt{3}/2, 00 and −3/2-\sqrt{3}/2. Check: T3(x)=4x3−3x=x(4x2−3)T_3(x) = 4x^3 - 3x = x(4x^2 - 3) vanishes exactly there.

Non-example: the equally spaced points −1,0,1-1, 0, 1 are not the Chebyshev nodes of order 33, since T3(1)=1≠0T_3(1) = 1 \ne 0.

The node polynomial is ∏k=1n(x−xk)=21−nTn(x)\prod_{k=1}^{n} (x - x_k) = 2^{1-n} T_n(x), whose maximum on [−1,1][-1, 1] is 21−n2^{1-n}, the least possible for a monic polynomial of degree nn. Hence, if ff has nn continuous derivatives and pp interpolates ff at these nodes, then max⁡[−1,1]∣f−p∣≤max⁡∣f(n)∣2n−1n!\max_{[-1, 1]} \abs{f - p} \le \frac{\max \abs{f^{(n)}}}{2^{n-1} n!}. The points cos⁡(kπ/n)\cos(k\pi/n), k=0,…,nk = 0, \dots, n, where Tn=±1T_n = \pm 1, are the Chebyshev extreme points, also called Chebyshev–Lobatto points.

Reading path

To understand this page from the ground up, read these 11 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Chebyshev polynomials object
  2. Construction of the reals from Cauchy sequences concept
  3. Integers object
  4. Ordered field definition
  5. Rational numbers object
  6. Ring of integers statement
  7. The rationals form a field statement
  8. The rationals form an ordered field statement
  9. Order on the reals definition
  10. Interval definition
  11. Chebyshev nodes definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Chebyshev_nodes
About this page
TagYWTXGDC427
URIm2://YWTXGDC427
Kinddefinition
WritingW0 stub
MSC65D05, 41A05, 33C45
DefinesChebyshev nodes
UsesChebyshev polynomials, Interval

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.