Interpolation by convex quadratic splines
HTML articles powered by AMS MathViewer
- by David F. McAllister and John A. Roulier PDF
- Math. Comp. 32 (1978), 1154-1162 Request permission
Abstract:
Algorithms are presented for computing a quadratic spline interpolant with variable knots which preserves the monotonicity and convexity of the data. It is also shown that such a spline may not exist for fixed knots.References
- K. De Bor, Prakticheskoe rukovodstvo po splaĭ nam, “Radio i Svyaz′”, Moscow, 1985 (Russian). Translated from the English by V. K. Galitskiĭ and S. A. Shestakov; Translation edited and with a preface by V. I. Skurikhin. MR 804666 R. PETER DUBE, "Univariate blending functions and alternatives," Comput. Graphics and Image Processing, v. 6, 1977, pp. 394-408. R. PETER DUBE, "Automatic generation of parameters for preliminary interactive design of free-form curves." (To appear.)
- G. G. Lorentz, Approximation of functions, Holt, Rinehart and Winston, New York-Chicago, Ill.-Toronto, Ont., 1966. MR 0213785
- David F. McAllister, Eli Passow, and John A. Roulier, Algorithms for computing shape preserving spline interpolations to data, Math. Comp. 31 (1977), no. 139, 717–725. MR 448805, DOI 10.1090/S0025-5718-1977-0448805-0
- Eli Passow and John A. Roulier, Monotone and convex spline interpolation, SIAM J. Numer. Anal. 14 (1977), no. 5, 904–909. MR 470566, DOI 10.1137/0714060
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Math. Comp. 32 (1978), 1154-1162
- MSC: Primary 41A05; Secondary 41A15
- DOI: https://doi.org/10.1090/S0025-5718-1978-0481734-6
- MathSciNet review: 0481734