In this paper the problem of convexity-preserving interpolation is investigated by introducing a class of C2 polynomial splines of nonuniform degree. It is shown that as the degrees increase globally the spline converges to the linear interpolant with the best-approximation rate. An algorithm is presented for constructing C2 convexity-preserving interpolants and several numerical results are given.
No takes yet. Share an insight, caveat, or question.
Kaklis et al. (1990) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: