Convex interval interpolation with cubic splines (Q578836): Difference between revisions
From MaRDI portal
Latest revision as of 09:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex interval interpolation with cubic splines |
scientific article |
Statements
Convex interval interpolation with cubic splines (English)
0 references
1986
0 references
The problem of convex interpolation with cubic splines (one-dimensional case) is considered in the situation of interval-valued function data. A necessary and sufficient condition is formulated for the solvability of the problem. On the basis of this condition an effective algorithm is proposed for the construction of the solution set. The algorithm uses a general method for solving a system of weakly coupled inequalities.
0 references
convex interpolation
0 references
cubic splines
0 references
interval-valued function data
0 references
solvability
0 references
algorithm
0 references
system of weakly coupled inequalities
0 references
0 references
