Convex interval interpolation with cubic splines. II (Q806933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convex interval interpolation with cubic splines. II |
scientific article; zbMATH DE number 4205850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex interval interpolation with cubic splines. II |
scientific article; zbMATH DE number 4205850 |
Statements
Convex interval interpolation with cubic splines. II (English)
0 references
1991
0 references
[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.
0 references
cubic splines
0 references
interval input data
0 references
curvature minimization
0 references
Fenchel dualization
0 references
unconstrained dual program
0 references
convex interval interpolation
0 references
0 references
0.9777757
0 references
0.9391835
0 references
0.92731565
0 references
0.9219216
0 references
0.9214106
0 references
0.91985226
0 references
0.9189554
0 references
