<s>
In	O
numerical	B-General_Concept
analysis	I-General_Concept
,	O
Chebyshev	B-Algorithm
nodes	I-Algorithm
are	O
specific	O
real	O
algebraic	O
numbers	O
,	O
namely	O
the	O
roots	O
of	O
the	O
Chebyshev	O
polynomials	O
of	O
the	O
first	O
kind	O
.	O
</s>
<s>
These	O
are	O
the	O
roots	O
of	O
the	O
Chebyshev	O
polynomial	O
of	O
the	O
first	O
kind	O
of	O
degree	O
n	O
.	O
For	O
nodes	O
over	O
an	O
arbitrary	O
interval	O
[	O
a	O
,	O
b ]	O
an	O
affine	B-Algorithm
transformation	I-Algorithm
can	O
be	O
used	O
:	O
</s>
<s>
The	O
Chebyshev	B-Algorithm
nodes	I-Algorithm
are	O
important	O
in	O
approximation	B-Algorithm
theory	I-Algorithm
because	O
they	O
form	O
a	O
particularly	O
good	O
set	O
of	O
nodes	O
for	O
polynomial	O
interpolation	O
.	O
</s>
