Next  |  Prev  |  Up  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

Chebyshev Polynomials

\epsfig{file=eps/first-even-chebs-c.eps,width=\textwidth }

The $ n$ th Chebyshev polynomial may be defined by

$\displaystyle T_n(x) = \left\{\begin{array}{ll}
\cos[n\cos^{-1}(x)], & \vert x\vert\le1 \\ [5pt]
\cosh[n\cosh^{-1}(x)], & \vert x\vert>1 \\
\end{array} \right..
$

Clearly, $ T_0(x)=1$ and $ T_1(x)=x$ .
Using the double-angle trig formula $ \cos(2\theta)=2\cos^2(\theta)-1$ , it can be verified that

$\displaystyle \zbox{T_n(x) = 2x T_{n-1}(x) - T_{n-2}(x)} \quad (n\ge 2)
$


Next  |  Prev  |  Up  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

[Comment on this page via email]

``FFT Windows'', by Julius O. Smith III and Bill Putnam, (From Lecture Overheads, Music 421).
Copyright © 2020-06-27 by Julius O. Smith III and Bill Putnam
Center for Computer Research in Music and Acoustics (CCRMA),   Stanford University
CCRMA  [Automatic-links disclaimer]