Monotone and convex cubic spline interpolation (Q1058685): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:25, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monotone and convex cubic spline interpolation |
scientific article |
Statements
Monotone and convex cubic spline interpolation (English)
0 references
1984
0 references
The authors consider the problem of the existence of monotone and convex cubic \(C^ 1\) splines interpolating a set of data at the knots, and give a necessary and sufficient condition. The proof is constructive and leads to an algorithm for the construction of shape-preserving splines interpolating arbitrary sets of data [ibid. 21, 295-305 (1984)]. Further, they investigate the approximation properties of these splines when applied to the interpolation of \(C^ 4\) functions.
0 references
monotone interpolation
0 references
convex interpolation
0 references
shape-preserving splines
0 references
