Abstract
We offer the algorithm for choosing tension parameters of the generalized splines for convexity preserving interpolation. The resulting spline minimally differs from the classical cubic spline and coincides with it if sufficient convexity conditions are satisfied for the last one. We consider specific algorithms for different generalized cubic splines such as rational, exponential, variable power, hyperbolic splines, and splines with additional knots.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call