Convexity preserving interpolation with exponential splines

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1986 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 36, pages 335-342 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: Walter Heß; Jochen W. Schmidt;

doi: 10.1007/bf02240208

Convexity preserving interpolation with exponential splines

- Summary
- Subjects
- Metrics

Abstract

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.

Related Organizations

TU Dresden
Germany

Keywords

interpolating splines, Spline approximation, quadratic optimization problem, convexity conditions, numerical algorithms, quadratic programming, Quadratic programming, unconstrained dual program with tridiagonal Hessian, Numerical computation using splines, weakly coupled system of inequalities

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	20
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%