AbstractFor quadratic and related exponential splines necessary and sufficient conditions are given under which the properties of convexity or monotonicity carry over from the data set to the interpolants. It turns out that for quadratic splines the problems of convex or monotone interpolation may be not solvable. However, when using the more general exponential splines, the shape is preserved if the parameters occuring now are chosen appropriately. Furthermore, since convex or monotone spline interpolants are in general not uniquely determined, a strategy for selecting one of them is proposed
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
AbstractA review of shape preserving approximation methods and algorithms for approximating univaria...
AbstractIn this note, we use a new approach to define the Quadratic X-splines and then examine it fo...
AbstractAn interpolating quadratic spline was constructed which preserves the shape of data. The spl...
AbstractIn this note, we use a new approach to define the Quadratic X-splines and then examine it fo...
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
A rational spline solution to the problem of shape preserving interpolation is discussed. The ration...
AbstractPruess [12, 14] has shown that exponential splines can produce co-convex and co-monotone int...
Shape preserving approximations are constructed by interpolating the data with polynomial splines of...
AbstractPruess [12, 14] has shown that exponential splines can produce co-convex and co-monotone int...
AbstractThis paper is concerned with shape-preserving interpolation of discrete data by polynomial s...
A generalization of the semiclassical cubic spline known in the literature as the exponential spline...
AbstractWe study the reconstruction of a function defined on the real line from given, possibly nois...
AbstractThe aim of this paper is to describe an algorithm for computing co-monotone and/or co-convex...
AbstractThis paper is concerned with the convex interpolation of data sets. Based on the staircase a...
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
AbstractA review of shape preserving approximation methods and algorithms for approximating univaria...
AbstractIn this note, we use a new approach to define the Quadratic X-splines and then examine it fo...
AbstractAn interpolating quadratic spline was constructed which preserves the shape of data. The spl...
AbstractIn this note, we use a new approach to define the Quadratic X-splines and then examine it fo...
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
A rational spline solution to the problem of shape preserving interpolation is discussed. The ration...
AbstractPruess [12, 14] has shown that exponential splines can produce co-convex and co-monotone int...
Shape preserving approximations are constructed by interpolating the data with polynomial splines of...
AbstractPruess [12, 14] has shown that exponential splines can produce co-convex and co-monotone int...
AbstractThis paper is concerned with shape-preserving interpolation of discrete data by polynomial s...
A generalization of the semiclassical cubic spline known in the literature as the exponential spline...
AbstractWe study the reconstruction of a function defined on the real line from given, possibly nois...
AbstractThe aim of this paper is to describe an algorithm for computing co-monotone and/or co-convex...
AbstractThis paper is concerned with the convex interpolation of data sets. Based on the staircase a...
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
AbstractA review of shape preserving approximation methods and algorithms for approximating univaria...
AbstractIn this note, we use a new approach to define the Quadratic X-splines and then examine it fo...