[ Initial Order of Chebyshev Polynomial: {15) ] [ Initial entries number: {11} ]

IMPLEMENTATION
Chebyshev Polynomial Method

Chebyshev polynomials are important in numerical analysis. There are two types of Chebyshev polynomials, both of which are
solutions to the Chebyshev difference equations:

To test the Chebyshev Polynomial method, new static methods ChevyshevT - (first kind) and ChevyshevU - (second kind) has been added. The implementation of these type of polynomials
are based on their recurrence relation. The TestChebyshevPolynomial() method has
been written, added and executed:

static void TestChebyshev Polynomial();
{
for (int i = 0; i < t2; i++)
{
double x = 0.25 * (i - 5.0);
ListBox1.Items.Add(" x = " + x + ".00, " + "T" + t1 + "(x) = " + SpecialFunctions.ChebyshevT(x, t1).ToString());
ListBox2.Items.Add(" x = " + x + ".00, " + "U" + t1 + "(x) = " + SpecialFunctions.ChebyshevU(x, t1).ToString());
}
}