Determination of shape preserving spline interpolants with minimal curvature via dual programs
type: Item
instance of: scholarly article
title: Determination of shape preserving spline interpolants with minimal curvature via dual programs
zbMATH Open document ID: 0662.41008
DOI: 10.1016/0021-9045(88)90036-6
author: Siegfried Dietze
author: Jochen W. Schmidt
published in: Journal of Approximation Theory
publication date: 1988-01-01T00:00:00Z
review text: Programming problems that occur in the convexity or monotonicity preserving spline interpolation are studied. Numerical solutions of such problems for cubic spline interpolants are given.
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 41A05
zbMATH DE Number: 4082191
zbMATH Keywords: Programming problems
zbMATH Keywords: spline interpolation
zbMATH Keywords: Numerical solutions
zbMATH Keywords: cubic spline interpolants
describes a project that uses: pchip
MaRDI profile type: Publication
full work available at URL: 0021-9045(88)90036-6
OpenAlex ID: W2014860631
cites work: Convex spline interpolants with minimal curvature
cites work: Q3928936
cites work: Monotone Piecewise Cubic Interpolation
cites work: Q5650526
cites work: Uniform approximation by some Hermite interpolating splines
cites work: Q5638112
cites work: Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
cites work: Q5603731
cites work: On Monotone and Convex Spline Interpolation
cites work: Monotone and convex cubic spline interpolation
cites work: Convexity preserving interpolation with exponential splines
cites work: Convex interval interpolation with cubic splines
cites work: Q3469662
cites work: On tridiagonal linear complementarity problems
cites work: Positivity of cubic polynomials on intervals and positive spline interpolation
description: scientific article; zbMATH DE number 4082191