One-Sided Chebyshev Approximation

In the previous chapter, an algorithm for obtaining the linear (ordinary) Chebyshev approximation is given [1]. The linear Chebyshevapproximation is a double-sided one, meaning that some of the elements of the residual vector have values ≥ 0 and the others have values < 0. In other words, for the discrete linear Chebyshev approximation, some of the discrete points are above or on, and some are below the approximating curve (surface). Hence, the approximation is the ordinary or the double-sided one.