A dual algorithm for convex-concave data smoothing by cubicC 2-splines
- 1 December 1990
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 57 (1) , 333-350
- https://doi.org/10.1007/bf01386414
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Determination of shape preserving spline interpolants with minimal curvature via dual programsJournal of Approximation Theory, 1988
- An algorithm for computing constrained smoothing spline functionsNumerische Mathematik, 1987
- An unconstrained dual program for computing convexC 1-spline approximantsComputing, 1987
- On tridiagonal linear complementarity problemsNumerische Mathematik, 1987
- Constrained interpolation and smoothingConstructive Approximation, 1986
- Convex spline interpolants with minimal curvatureComputing, 1985
- Algorithms for computing shape preserving spline approximations to dataNumerische Mathematik, 1985
- A Practical Guide to SplinesPublished by Springer Nature ,1978
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Smoothing by spline functionsNumerische Mathematik, 1967