Convex interval interpolation with cubic splines. II

From MaRDI portal
Publication:806933





[For part I see ibid. 26, 377-387 (1986; Zbl 0624.65007).] Considered is the problem of convex interval interpolation using cubic \(C^ 1\)-splines. A solution (if existing) is selected which minimizes the regularized mean curvature. The corresponding convex finite dimensional programming problem is solved numerically by means of a dualization approach.





Describes a project that uses

Uses Software






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

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