Fast one-sided approximation with spline functions

Abstract

For the approximation of functions, interpolation compromises approximation error for computational convenience. For a bounded interpolation operator the Lebesque inequality bounds the factor by which the interpolation differs from the best approximation available in the range of the operator. A comparable process for one-sided approximation is not readily apparent. Methods are suggested for the computationally economical construction of one-sided spline approximation to large classes of functions, and criteria for comparing such approximation operators are investigated. Since the operators are generally nonlinear the Lebesque inequality is invalidated as an aid for comparing with the best one-sided approximation in the range of the operator, but comparable inequalities are shown to exist in some cases.