Abstract
We consider convex interpolation with cubic $C^2$ splines on grids built by adding two knots in each subinterval of neighbouring data sites. The additional knots have to be variable in order to get a chance to always retain convexity. By means of the staircase algorithm we provide computable intervals for the added knots such that all knots from these intervals allow convexity preserving spline interpolation of $C^2$ continuity.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
