Definitions‎ > ‎

Home

Welcome to the home page! Here you will learn a little about the history and background of Chebyshev polynomials.
 
Chebyshev polynomials, named for Pafnuty Chebyshev, a 19-th century Russian mathematician, are a sequence of orthogonal polynomials that can be defined recursively, like Fibonacci numbers.  Typically when talking about Chebyshev polynomials there are two types; Chebyshev polynomials of the first kind and Chebyshev polynomials of the second kind.  Chebyshev polynomials of the first kind are denoted by Tn and Chebyshev polynomials of the second kind are denoted by Un. But they can also be written as monic polynomials of degree n whose deviation from zero is as small as possible, which will be the main focus of this site. The problem is finding these polynomials.  The objective of this site is to demonstrate a simple method of finding Chebyshev polynomials and to provide proof that supports Chebyshev's work.