On monotone and convex spline interpolation

Abstract

This paper is concerned with the problem of existence of monotone and/or convex splines, having degree n and order of continuity k, which interpolate to a set of data at the knots. The interpolating splines are obtained by using Bernstein polynomials of suitable continuous piecewise linear functions; they satisfy the inequality k ⩽ n − k k \leqslant n - k . The theorems presented here are useful in developing algorithms for the construction of shape-preserving splines interpolating arbitrary sets of data points. Earlier results of McAllister, Passow and Roulier can be deduced from those given in this paper.