Convex interval interpolation with cubic splines. II

DOI10.1007/BF01931292zbMath0729.65005OpenAlexW2042480453MaRDI QIDQ806933

Jochen W. Schmidt

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931292

zbMATH Keywords

cubic splinescurvature minimizationconvex interval interpolationFenchel dualizationinterval input dataunconstrained dual program

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Interval and finite arithmetic (65G30) Numerical interpolation (65D05) Spline approximation (41A15)

Uses Software

• pchip

Cites Work

• Convex interval interpolation with cubic splines
• Algorithms for computing shape-preserving spline approximations to data
• Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
• Convex spline interpolants with minimal curvature
• Monotone and convex cubic spline interpolation
• An unconstrained dual program for computing convex \(C^ 1\)-spline approximants
• Positivity of cubic polynomials on intervals and positive spline interpolation
• Determination of shape preserving spline interpolants with minimal curvature via dual programs
• Unconstrained duals to partially separable constrained programs
• A practical guide to splines
• Monotone Piecewise Cubic Interpolation
• On Monotone and Convex Spline Interpolation
• SPLINE FUNCTIONS AND THE PROBLEM OF GRADUATION

This page was built for publication: Convex interval interpolation with cubic splines. II