We are concerned with the problem of minimizing the supremum norm on an interval of a nonzero polynomial of degree at most n with integer coefficients. This is an old and hard problem that cannot be ...

Chebyshev polynomials, a central class of orthogonal polynomials, have long been pivotal in numerical analysis, approximation theory and the solution of differential equations. Their inherent ...

This is a preview. Log in through your library . Abstract A collocation scheme is proposed, on the basis of the Chebyshev nodes, for the approximation of elliptic problems with Dirichlet-Neumann ...