An always successful method in univariate convex $C^2$ interpolation
An always successful method in univariate convex $C^2$ interpolation
复制标题
DOI：
10.1007/s002110050143
复制
发表时间：
1995-08
影响因子：
2.1
通讯作者：
Jochen W. Schmidt;W. Heß
中科院分区：
文献类型：
--
作者：
Jochen W. Schmidt;W. Heß
我们考虑了在相邻数据点的每个子区间增加两个节点而建立的网格上的三次样条凸插值问题。为了获得始终保持凸性的机会，附加的结必须是可变的。借助于STRELCASE算法，我们为添加的节点提供了可计算的区间，使得来自这些区间的所有节点都允许保持连续的保凸样条插值。
We consider convex interpolation with cubicsplines 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 ofcontinuity.