Convexity preserving interpolation with exponential splines
type: Item
instance of: scholarly article
title: Convexity preserving interpolation with exponential splines
zbMATH Open document ID: 0581.41013
DOI: 10.1007/BF02240208
author: Walter Heß
author: Jochen W. Schmidt
published in: Computing
publication date: 1986-01-01T00:00:00Z
review text: Sufficient and necessary conditions are derived under which interpolating splines are convex if the data set is in convex position. In order to select one of the interpolants, by means of a well-known objective function a quadratic optimization problem is stated which can be solved effectively by passing to a dual program.
Mathematics Subject Classification ID: 41A15
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 65D07
zbMATH DE Number: 3929614
zbMATH Keywords: convexity conditions
zbMATH Keywords: weakly coupled system of inequalities
zbMATH Keywords: numerical algorithms
zbMATH Keywords: quadratic programming
zbMATH Keywords: unconstrained dual program with tridiagonal Hessian
zbMATH Keywords: interpolating splines
zbMATH Keywords: quadratic optimization problem
MaRDI profile type: Publication
cites work: Convex spline interpolants with minimal curvature
cites work: Scalar- and planar-valued curve fitting using splines under tension
cites work: Determination of shape preserving spline interpolants with minimal curvature via dual programs
cites work: Properties of splines in tension
cites work: An algorithm for the computation of the exponential spline
cites work: Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
cites work: An Interpolation Curve Using a Spline in Tension
cites work: Q4023802
full work available at URL: https://doi.org/10.1007/bf02240208
OpenAlex ID: W20558287
description: scientific article; zbMATH DE number 3929614