Algorithms for computing shape-preserving spline approximations to data
From MaRDI portal
We treat the problem of approximating data that are sampled with error from a function known to be convex and increasing. The approximating function is a polynomial spline with knots at the data points. This paper presents results (analogous to those in earlier work) that describe some approximation properties of polynomial splines, and it also presents algorithms for determining the existence of a shape-preserving approximant for given data.
Recommendations
Cites work
- Algorithms for Computing Shape Preserving Spline Interpolations to Data
- An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
- Automatic Curve Fitting Using an Adaptive Local Algorithm
- Convex Approximation by Splines
- Degree of L_p Approximation by Monotone Splines
- Interpolation by Convex Quadratic Splines
- Isotonic, convex and related splines
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
Cited in
(15)- Quadratic and related exponential splines in shape preserving interpolation
- An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
- A survey on univariate data interpolation and approximation by splines of given shape
- Least squares data fitting using shape preserving piecewise approximations
- Convexity-preserving interpolatory subdivision
- Shape preserving approximations by polynomials and splines
- Algorithms for shape preserving local approximation with automatic selection of tension parameters
- Shape preservation of scientific data through rational fractal splines
- scientific article; zbMATH DE number 4073652 (Why is no real title available?)
- scientific article; zbMATH DE number 3994878 (Why is no real title available?)
- Structure-preserving function approximation via convex optimization
- A linear approach to shape preserving spline approximation
- Monotone interpolation of scattered data in \({\mathbb{R}}^ s\)
- Convex interval interpolation with cubic splines. II
- A dual algorithm for convex-concave data smoothing by cubic C^ 2- splines
This page was built for publication: Algorithms for computing shape-preserving spline approximations to data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q789625)
