Chebychev Polynomials

ichebys001p1In this project the aim is to study the mathematical properties of Chebychev polynomials and their role in numerical approximation.

The concept of ‘good’ and ‘best’ numerical approximations and the Remes algorithm will be investigated and, if time permits, further applications of Chebychev polynomials could be considered.

This project is mainly analytical but would involve some programming (Maple would be fine).

Supervisor: Dr David Graham