Convexity preserving interpolation with exponential splines (Q1068299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3929614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convexity preserving interpolation with exponential splines |
scientific article; zbMATH DE number 3929614 |
Statements
Convexity preserving interpolation with exponential splines (English)
0 references
1986
0 references
Sufficient and necessary conditions are derived under which interpolating splines are convex if the data set is in convex position. In order to select one of the interpolants, by means of a well-known objective function a quadratic optimization problem is stated which can be solved effectively by passing to a dual program.
0 references
convexity conditions
0 references
weakly coupled system of inequalities
0 references
numerical algorithms
0 references
quadratic programming
0 references
unconstrained dual program with tridiagonal Hessian
0 references
interpolating splines
0 references
quadratic optimization problem
0 references
0 references
0.905584990978241
0 references
0.8501310348510742
0 references
