Codex Wiki
OurBigBook.com
Site
Source code
Chebyshev polynomial domination lemma
Home
Mathematics
Area of mathematics
Analysis
Numerical analysis
Chebyshev polynomial
OurBigBook.com
Words: 23
If
f
has degree at most
n
and
∣
f
∣
<
1
on
[
−
1
,
1
]
, alternation at the extrema of
T
n
implies
∣
f
(
t
)
∣
<
∣
T
n
(
t
)
∣
outside that interval.
Ancestors
(6)
Chebyshev polynomial
Numerical analysis
Analysis
Area of mathematics
Mathematics
Home