摘要：In this paper we are introducing the Chebyshev polynomials together with their most important properties. Those polynomials are playing an essential role for the optimization of Richardson method, presented here in a schematic form. This is a problem similar to another classical problem in numerical analysis: the identification of the best approximation of a regular function by an interpolating Lagrange polynomial. The Chebyshev polynomials are representing a remedy against the loss of signifiance or illconditioning in approximation problems
