Algorithms for computing shape-preserving spline approximations to data
From MaRDI portal
Publication:789625
DOI10.1007/BF01390417zbMath0533.41003OpenAlexW2077578730MaRDI QIDQ789625
Publication date: 1985
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132989
Approximation with constraints (41A29) Spline approximation (41A15) Algorithms for approximation of functions (65D15)
Related Items (8)
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 ⋮ A dual algorithm for convex-concave data smoothing by cubic \(C^ 2\)- splines ⋮ A survey on univariate data interpolation and approximation by splines of given shape ⋮ Monotone interpolation of scattered data in \({\mathbb{R}}^ s\) ⋮ Convexity-preserving interpolatory subdivision ⋮ Convex interval interpolation with cubic splines. II
Cites Work
- Isotonic, convex and related splines
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- Automatic Curve Fitting Using an Adaptive Local Algorithm
- Degree of $L_p$ Approximation by Monotone Splines
- Convex Approximation by Splines
- An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
- Algorithms for Computing Shape Preserving Spline Interpolations to Data
- Interpolation by Convex Quadratic Splines
This page was built for publication: Algorithms for computing shape-preserving spline approximations to data