Connect via MCP →

Enter Calculation

Formula

Advertisement

Results

Chebyshev Polynomial of the First Kind
T_3(x)
101 rows computed
Degree n3
Min T_n(x)-1
Max T_n(x)1
x T_3(x)
-1 -1
-0.98 -0.824768
-0.96 -0.658944
-0.94 -0.502336
-0.92 -0.354752
-0.9 -0.216
-0.88 -0.085888
-0.86 0.035776
-0.84 0.149184
-0.82 0.254528
-0.8 0.352
-0.78 0.441792
-0.76 0.524096
-0.74 0.599104
-0.72 0.667008
-0.7 0.728
-0.68 0.782272
-0.66 0.830016
-0.64 0.871424
-0.62 0.906688
-0.6 0.936
-0.58 0.959552
-0.56 0.977536
-0.54 0.990144
-0.52 0.997568
-0.5 1
-0.48 0.997632
-0.46 0.990656
-0.44 0.979264
-0.42 0.963648
-0.4 0.944
-0.38 0.920512
-0.36 0.893376
-0.34 0.862784
-0.32 0.828928
-0.3 0.792
-0.28 0.752192
-0.26 0.709696
-0.24 0.664704
-0.22 0.617408
-0.2 0.568
-0.18 0.516672
-0.16 0.463616
-0.14 0.409024
-0.12 0.353088
-0.1 0.296
-0.08 0.237952
-0.06 0.179136
-0.04 0.119744
-0.02 0.059968
0 -0
0.02 -0.059968
0.04 -0.119744
0.06 -0.179136
0.08 -0.237952
0.1 -0.296
0.12 -0.353088
0.14 -0.409024
0.16 -0.463616
0.18 -0.516672
0.2 -0.568
0.22 -0.617408
0.24 -0.664704
0.26 -0.709696
0.28 -0.752192
0.3 -0.792
0.32 -0.828928
0.34 -0.862784
0.36 -0.893376
0.38 -0.920512
0.4 -0.944
0.42 -0.963648
0.44 -0.979264
0.46 -0.990656
0.48 -0.997632
0.5 -1
0.52 -0.997568
0.54 -0.990144
0.56 -0.977536
0.58 -0.959552
0.6 -0.936
0.62 -0.906688
0.64 -0.871424
0.66 -0.830016
0.68 -0.782272
0.7 -0.728
0.72 -0.667008
0.74 -0.599104
0.76 -0.524096
0.78 -0.441792
0.8 -0.352
0.82 -0.254528
0.84 -0.149184
0.86 -0.035776
0.88 0.085888
0.9 0.216
0.92 0.354752
0.94 0.502336
0.96 0.658944
0.98 0.824768
1 1

What is the Chebyshev Polynomial of the First Kind?

The Chebyshev polynomials of the first kind, written \(T_n(x)\), are a family of orthogonal polynomials that appear throughout numerical analysis, approximation theory, signal processing, and the design of digital filters. This calculator builds a table of \(T_n(x)\) values over a chosen range of \(x\) and an optional curve, given a degree \(n\), a starting \(x\), a step size, and a number of rows. It is a pure-mathematics tool and applies universally with no region-specific rules.

Curves of the first several Chebyshev polynomials of the first kind on the interval from minus one to one
Graphs of \(T_0\) through \(T_4\) on \([-1, 1]\), all oscillating between \(-1\) and \(1\).

How to Use It

Enter the degree \(n\) (a non-negative integer such as 0, 1, 2, 3...). Set the initial value of \(x\) (the canonical domain is \(-1\) to \(1\), though the recurrence works for any real \(x\)). Choose the increment (step) added to \(x\) for each row, and the number of repetitions (rows) to generate. The default sweep of \(\text{initialX} = -1\), \(\text{step} = 0.02\), \(\text{rows} = 101\) walks \(x\) from \(-1.00\) to \(+1.00\) inclusive.

The Formula

The robust method used here is the three-term recurrence:

$$T_0(x) = 1, \quad T_1(x) = x, \quad \text{and} \quad T_k(x) = 2x \cdot T_{k-1}(x) - T_{k-2}(x) \quad \text{for } k \ge 2.$$

Equivalently, on the interval \(-1 \le x \le 1\) one has the trigonometric form $$T_n(x) = \cos(n \cdot \arccos x).$$ The first few explicit polynomials are \(T_2(x) = 2x^2 - 1\), \(T_3(x) = 4x^3 - 3x\), and \(T_4(x) = 8x^4 - 8x^2 + 1\). On \([-1, 1]\) the values always satisfy \(|T_n(x)| \le 1\); outside that band the magnitude grows quickly.

Recurrence diagram showing each Chebyshev polynomial built from the two previous ones
The three-term recurrence: each \(T_n\) is built from \(T_{n-1}\) and \(T_{n-2}\).

Worked Example

For \(n = 3\) the polynomial is \(T_3(x) = 4x^3 - 3x\). At \(x = -1\): $$4(-1) - 3(-1) = -1.$$ At \(x = -0.5\): $$4(-0.125) + 1.5 = 1.$$ At \(x = 0\): \(0\). At \(x = 0.5\): $$0.5 - 1.5 = -1.$$ At \(x = 1\): $$4 - 3 = 1.$$ So a table with \(\text{initialX} = -1\), \(\text{step} = 0.5\), \(\text{rows} = 5\) gives the sequence \(-1, 1, 0, -1, 1\).

FAQ

Can n be zero? Yes. \(T_0(x) = 1\) for every \(x\), so every row shows \(1\).

Can x go outside [-1, 1]? Yes — the recurrence still computes correct (possibly large) values; only the trigonometric form is restricted to \(|x| \le 1\).

What if the step is zero? Every row repeats the same \(x\) value, which is allowed but produces a constant table.

Last updated: