On the Calculation of the Piecewise Linear Approximation to a Discrete Function

A repeated scanning algorithm for determining the minimax approximation to an arbitrary function by means of a piecewise linear function with a fixed number of variable knots is described, and it is compared to optimal and suboptimal methods.