A local algorithm for constructing non-negative cubic splines
type: Item
instance of: scholarly article
title: A local algorithm for constructing non-negative cubic splines
zbMATH Open document ID: 0731.41016
DOI: 10.1016/0021-9045(91)90082-L
author: B. Fischer
author: Gerhard Opfer
author: Madan L. Puri
published in: Journal of Approximation Theory
publication date: 1991-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 65D07
zbMATH DE Number: 4208739
zbMATH Keywords: algorithm
zbMATH Keywords: cubic spline
reviewed by: Georgi R. Grozev
MaRDI profile type: Publication
cites work: Q5540873
cites work: A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures
cites work: Q5639142
cites work: Interpolation by non-negative polynomials
cites work: Convex spline interpolants with minimal curvature
cites work: Q3755924
cites work: Periodic splines and spectral estimation
cites work: An Analysis of Two Algorithms for Shape-Preserving Cubic Spline Interpolation
cites work: A Construction of Nonnegative Approximate Quadratures
cites work: A practical guide to splines
cites work: Splines with Nonnegative B-Spline Coefficients
cites work: Nonparametric maximum likelihood estimation of probability densities by penalty function methods
cites work: Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces
cites work: Convexity preserving interpolation with exponential splines
cites work: A Smoothest Curve Approximation
cites work: Q3049739
cites work: Q4049510
cites work: Monotone Approximation by Algebraic Polynomials
cites work: The derivation of cubic splines with obstacles by methods of optimization and optimal control
cites work: Q3724924
cites work: Convex interval interpolation with cubic splines
cites work: Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
cites work: Q5182610
cites work: On Shape Preserving Quadratic Spline Interpolation
cites work: Monotone approximation
cites work: Q3243490
cites work: Convergence rates for monotone cubic spline interpolation
cites work: Smoothing noisy data with spline functions
full work available at URL: 0021-9045(91)90082-l
OpenAlex ID: W2043610583
description: scientific article; zbMATH DE number 4208739