Convex interval interpolation with cubic splines
type: Item
instance of: scholarly article
title: Convex interval interpolation with cubic splines
zbMATH Open document ID: 0624.65007
DOI: 10.1007/BF01933717
author: Jochen W. Schmidt
published in: BIT
publication date: 1986-01-01T00:00:00Z
review text: The problem of convex interpolation with cubic splines (one-dimensional case) is considered in the situation of interval-valued function data. A necessary and sufficient condition is formulated for the solvability of the problem. On the basis of this condition an effective algorithm is proposed for the construction of the solution set. The algorithm uses a general method for solving a system of weakly coupled inequalities.
Mathematics Subject Classification ID: 65D07
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 41A15
zbMATH DE Number: 4013844
zbMATH Keywords: convex interpolation
zbMATH Keywords: cubic splines
zbMATH Keywords: interval-valued function data
zbMATH Keywords: solvability
zbMATH Keywords: algorithm
zbMATH Keywords: system of weakly coupled inequalities
reviewed by: Svetoslav Markov
describes a project that uses: pchip
MaRDI profile type: Publication
cites work: Convex spline interpolants with minimal curvature
cites work: Determination of shape preserving spline interpolants with minimal curvature via dual programs
cites work: Convex Cubic Splines
cites work: Monotone Piecewise Cubic Interpolation
cites work: Q3049739
cites work: Convex cubic Hermite-spline interpolation
cites work: Uniform approximation by some Hermite interpolating splines
cites work: Monotone and Convex Spline Interpolation
cites work: Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
full work available at URL: https://doi.org/10.1007/bf01933717
OpenAlex ID: W4231948784
description: scientific article; zbMATH DE number 4013844