Math 2.0

Special functions Object

Chebyshev polynomials

Description

The Chebyshev polynomials of the first kind are the polynomials Tn∈ℤ[x]T_n \in \Z[x], n≥0n \ge 0, given by T0=1,T1=x,Tn+1=2x Tn−Tn−1(n≥1).T_0 = 1, \qquad T_1 = x, \qquad T_{n+1} = 2x \, T_n - T_{n-1} \quad (n \ge 1). They are characterised by Tn(cos⁡θ)=cos⁡(nθ)T_n(\cos \theta) = \cos(n \theta) for all real θ\theta. The Chebyshev polynomials of the second kind UnU_n satisfy the same recursion with U0=1U_0 = 1 and U1=2xU_1 = 2x, and Un(cos⁡θ)sin⁡θ=sin⁡((n+1)θ)U_n(\cos \theta) \sin \theta = \sin((n + 1) \theta).

Remarks

The first values are T2=2x2−1T_2 = 2x^2 - 1, T3=4x3−3xT_3 = 4x^3 - 3x and T4=8x4−8x2+1T_4 = 8x^4 - 8x^2 + 1. Check for T2T_2: cos⁡(2θ)=2cos⁡2θ−1\cos(2\theta) = 2 \cos^2 \theta - 1. For n≥1n \ge 1, TnT_n has degree nn and leading coefficient 2n−12^{n-1}. Its roots are the nn numbers cos⁡(2k−1)π2n\cos \frac{(2k - 1)\pi}{2n}, k=1,…,nk = 1, \dots, n, all in (−1,1)(-1, 1). On [−1,1][-1, 1] one has ∣Tn(x)∣≤1\abs{T_n(x)} \le 1, and the TnT_n are orthogonal for the weight (1−x2)−1/2(1 - x^2)^{-1/2}: ∫−11Tm(x)Tn(x)(1−x2)−1/2 dx=0\int_{-1}^{1} T_m(x) T_n(x) (1 - x^2)^{-1/2} \, dx = 0 for m≠nm \ne n. They also satisfy Tm(Tn(x))=Tmn(x)T_m(T_n(x)) = T_{mn}(x). Their roots are good nodes for polynomial interpolation on [−1,1][-1, 1].

Further reading

  1. Web https://en.wikipedia.org/wiki/Chebyshev_polynomials
About this page
TagM6EAR1JHPP
URIm2://M6EAR1JHPP
Kindobject
WritingW0 stub
MSC33C45, 12E10, 41A50
Same as
Changed2 November 2026

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.