Determination of shape preserving spline interpolants with minimal curvature via dual programs

DOI10.1016/0021-9045(88)90036-6MaRDI QIDQ1113404zbMATH OpenOpenAlexFDO

Authors Siegfried Dietze, Jochen W. Schmidt

Publication date 1988

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9045(88)90036-6

zbMATH Keywords

cubic spline interpolantsNumerical solutionsProgramming problemsspline interpolation

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Spline approximation (41A15)

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.

Cites work

• Convex interval interpolation with cubic splines
• Convex spline interpolants with minimal curvature
• Convexity preserving interpolation with exponential splines
• scientific article; zbMATH DE number 4136673 (Why is no real title available?)
• scientific article; zbMATH DE number 3744430 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 3378720 (Why is no real title available?)
• Monotone and convex cubic spline interpolation
• Monotone Piecewise Cubic Interpolation
• On Monotone and Convex Spline Interpolation
• On tridiagonal linear complementarity problems
• Positivity of cubic polynomials on intervals and positive spline interpolation
• Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation
• Uniform approximation by some Hermite interpolating splines

Cited in

(16)

• Convex spline interpolants with minimal curvature
• Convexity preserving interpolation with exponential splines
• On tridiagonal linear complementarity problems
• Positivity of cubic polynomials on intervals and positive spline interpolation
• A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
• Constrained smoothing of histograms by quadratic splines
• Unconstrained duals to partially separable constrained programs
• A survey on univariate data interpolation and approximation by splines of given shape
• Powell-Sabin splines in range restricted interpolation of scattered data
• Positive quartic, monotone quintic \(C^ 2\)-spline interpolation in one and two dimensions
• On the choice of the initial value of a quadratic spline in positive interpolation
• Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation
• Optimizing at the end-points the Akima's interpolation method of smooth curve fitting
• Convex interval interpolation with cubic splines
• Convex interval interpolation with cubic splines. II
• A dual algorithm for convex-concave data smoothing by cubic C^ 2- splines

Describes a project that uses

Uses Software

• pchip

This page was built for publication: Determination of shape preserving spline interpolants with minimal curvature via dual programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113404)