ABSTRACT
In this chapter and the following four chapters, 5 algorithms for the discrete linear Chebyshev (L∞ or minimax) approximations are described. In this chapter, we consider the first of these algorithms, the (ordinary) linear Chebyshev approximation, which requires that the Chebyshev or L∞ norm of the residuals (errors) in the approximation be as small as possible [1, 2].
