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 In this paper we discuss the application of Lawson's algorithm for computing best linear Chebyshev approximations to complex-valued functions.

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 ...