Abstract
A necessary and sufficient criterion is presented under which the problem of the convex interval interpolation with cubicC 1-splines has at least one solution. The criterion is given as an algorithm which turns out to be effective.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Burmeister, W. Heß and J. W. Schmidt,Convex spline interpolants with minimal curvature, Computing 35 (1985), 219–229.
S. Dietze and J. W. Schmidt,Determination of shape preserving spline interpolants with minimal curvature via dual programs, TU Dresden Informationen 07-06-85 (1985) and J. Approx. Theory (to appear).
B. Dimsdale,Convex cubic splines, J. Res. Develop. 22 (1978), 168–178.
F. N. Fritsch and R. E. Carlson,Monotone piecewise cubic interpolation, SIAM J. Numer. Anal. 17 (1980), 238–246.
U. Hornung,Numerische Berechnung monotoner und konvexer Spline-Interpolierender, Z. Angew. Math. Mech. 59 (1979), T64-T65.
H. Mettke,Convex cubic Hermite-spline interpolation, J. Comput. Appl. Math. 9 (1983), 205–211.
E. Neuman,Uniform approximation by some Hermite interpolating splines, J. Comput. Appl. Math. 4 (1978), 7–9.
E. Neuman,Shape preserving interpolation by polynomial splines, Report Nr. N-112, University of Wroclaw 1982.
E. Passow and J. A. Roulier,Monotone and convex spline interpolation, SIAM J. Numer. Anal. 14 (1977), 904–909.
J. W. Schmidt and W. Heß,Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation, Elem. Math. 39 (1984), 85–95.
Author information
Authors and Affiliations
Additional information
Dedicated to Professor Julius Albrecht on the occasion of his 60th birthday.
Rights and permissions
About this article
Cite this article
Schmidt, J.W. Convex interval interpolation with cubic splines. BIT 26, 377–387 (1986). https://doi.org/10.1007/BF01933717
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933717