Algorithms for computing shape-preserving spline approximations to data
From MaRDI portal
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
(13)- A linear approach to shape preserving spline approximation
- Convex interval interpolation with cubic splines. II
- Shape preservation of scientific data through rational fractal splines
- A dual algorithm for convex-concave data smoothing by cubic C^ 2- splines
- Structure-preserving function approximation via convex optimization
- Monotone interpolation of scattered data in \({\mathbb{R}}^ s\)
- scientific article; zbMATH DE number 4073652 (Why is no real title available?)
- Convexity-preserving interpolatory subdivision
- scientific article; zbMATH DE number 3994878 (Why is no real title available?)
- A survey on univariate data interpolation and approximation by splines of given shape
- Quadratic and related exponential splines in shape preserving interpolation
- An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
- Shape preserving approximations by polynomials and 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)
