A local algorithm for constructing non-negative cubic splines
The authors describe an algorithm for interpolation of positive functions by non-negative splines. The algorithm can be described shortly as follows: First they consider the natural cubic spline which satisfies the interpolation conditions. In the second step in each subinterval between two successive knots in which this spline assumes negative values, the relevant portion of the spline is replaced by a non-negative cubic spline. This is carried out by the addition of extra knots, the location of which depends only on the values of the original spline. In the last step these additional knots are varied in order to minimize the strain energy integral. The described algorithm can be applied also to produce splines which stay locally (i.e. between two consecutive knots) below or above given constant bounds.
- A Construction of Nonnegative Approximate Quadratures
- A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures
- A practical guide to splines
- A Smoothest Curve Approximation
- An Analysis of Two Algorithms for Shape-Preserving Cubic Spline Interpolation
- Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces
- Convergence rates for monotone cubic spline interpolation
- Convex interval interpolation with cubic splines
- Convex spline interpolants with minimal curvature
- Convexity preserving interpolation with exponential splines
- scientific article; zbMATH DE number 3644388 (Why is no real title available?)
- scientific article; zbMATH DE number 3129782 (Why is no real title available?)
- scientific article; zbMATH DE number 3955673 (Why is no real title available?)
- scientific article; zbMATH DE number 4004830 (Why is no real title available?)
- scientific article; zbMATH DE number 3464164 (Why is no real title available?)
- scientific article; zbMATH DE number 3431190 (Why is no real title available?)
- scientific article; zbMATH DE number 3254460 (Why is no real title available?)
- scientific article; zbMATH DE number 3366295 (Why is no real title available?)
- Interpolation by non-negative polynomials
- Monotone approximation
- Monotone Approximation by Algebraic Polynomials
- Nonparametric maximum likelihood estimation of probability densities by penalty function methods
- On Shape Preserving Quadratic Spline Interpolation
- Periodic splines and spectral estimation
- Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
- Smoothing noisy data with spline functions
- Splines with Nonnegative B-Spline Coefficients
- The derivation of cubic splines with obstacles by methods of optimization and optimal control
- Positivity of cubic polynomials on intervals and positive spline interpolation
- Nonnegative splines, in particular of degree five
- Constrained smoothing of histograms by quadratic splines
- On the construction of optimal monotone cubic spline interpolations
- Powell-Sabin splines in range restricted interpolation of scattered data
- A-splines: local interpolation and approximation using G^k-continuous piecewise real algebraic curves
- Best interpolation in a strip. II: Reduction to unconstrained convex optimization
- An algorithm for the construction of a nonnegative cubic spline
- scientific article; zbMATH DE number 19407 (Why is no real title available?)
- scientific article; zbMATH DE number 20269 (Why is no real title available?)
- Algorithm 828
- Range restricted scattered data interpolation using convex combination of cubic Bézier triangles
- A criterion for the positivity of rational cubic \(C^ 2\)-spline interpolants
- Global and local data reduction strategies for cubic splines
This page was built for publication: A local algorithm for constructing non-negative cubic splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807885)
