Monotone and convex interpolation by weighted cubic splines

Algorithms for interpolating by weighted cubic splines are constructed with the aim of preserving the monotonicity and convexity of the original discrete data. The analysis performed in this paper makes it possible to develop two algorithms with the automatic choice of the shape-controlling parameters (weights). One of them preserves the monotonicity of the data, while the other preserves the convexity. Certain numerical results are presented.