A linear approach to shape preserving spline approximation

Abstract

This report deals with approximation of a given scattered univariate or bivariate data set that possesses certain shape properties, such as convexity, monotonicity, and/or range restrictions. The data are approximated for instance by tensor-product B-splines preserving the shape characteristics present in the data. Shape preservation of the spline approximant is obtained by additional linear constraints. Constraints are constructed which are local {\em linear sufficient\/} conditions in the unknowns for convexity or monotonicity. In addition, it is attractive if the objective function of the minimization problem is also linear, as the problem can be written as a linear programming problem then. A special linear approach based on constrained least squares is presented, which reduces the complexity of the problem in case of large data sets in contrast with the $\ell_\infty$ and the $\ell_1$-norms. An algorithm based on iterative knot insertion which generates a sequence of shape preserving approximants is given. It is investigated which linear objective functions are suited to obtain an efficient knot insertion method