Monotone and convex cubic spline interpolation (Q1058685): Difference between revisions

The authors consider the problem of the existence of monotone and convex cubic \(C^ 1\) splines interpolating a set of data at the knots, and give a necessary and sufficient condition. The proof is constructive and leads to an algorithm for the construction of shape-preserving splines interpolating arbitrary sets of data [ibid. 21, 295-305 (1984)]. Further, they investigate the approximation properties of these splines when applied to the interpolation of \(C^ 4\) functions.