Abstract
In the present paper the problem of approximating given data sets by convex cubicC 1-splines is considered. To this programming problem a dual program is constructed which is unconstrained. Therefore an efficient computational treatment is possible.
Zusammenfassung
Es wird die Aufgabe betrachtet, eine vorgegebene Datenmenge durch konvexe kubischeC 1-Splines zu approximieren. Zu diesem Problem wird eine zugehörige duale Optimierungsaufgabe konstruiert, welche den Vorteil hat, daß keine Nebenbedingungen auftreten, und welche sich daher effektiver als das Ausgangsproblem numerisch behandeln läßt.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beatson, R. K.: Monotone and convex approximation by splines. SIAM J. Numer. Anal.19, 1278–1285 (1982).
Burmeister, W., Heß, W., Schmidt, J. W.: Convex spline interpolants with minimal curvature. Computing35, 219–229 (1985).
de Boor, C.: A Practical Guide to Splines. New York-Heidelberg-Berlin: Springer-Verlag 1978.
Dietze, S., Schmidt, J. W.: Determination if shape preserving spline interpolants with minimal curvature via dual programs. Preprint TU Dresden 07-06-1985. J. Approx. Theory51 (1987).
Dott, S. L., McAllister, D. F.: Algorithms for computing shape preserving spline approximations to data. Numer. Math.46, 159–174 (1985).
Elfving, T., Andersson, L.-E.: An algorithm for computing constrained smoothing spline functions. Linköping Univ. preprint Li TH-MAT-R-86-07 (1986).
Hřebíček, J., Mikulík, M.: Monotone and convex splines. Sborník Referátů VI. Letní Školy, Doksy 1985, Mat.-Fyz. Fakulta Univ. Karlov. Praha, 1986.
Irvine, L. D., Martin, S. P., Smith, P. W.: Constrained interpolation and smoothing. Constr. Approximation2, 129–151 (1986).
Krätzschmar, M.: A new approach for solving discretized obstacle problems. Numer. Math. (submitted).
Maeß, G.: Smooth interpolation with curves and surfaces by quadratic splines with minimal curvature. Proceed. Numer. Methods and Appl., Sofia84, 75–81 (1985).
Neuman, E.: Uniform approximation by some Hermite interpolating splines. J. Comput. Appl. Math.4, 7–9 (1978).
Reinsch, C. H.: Smoothing by spline functions. Numer. Math.10, 177–183 (1967).
Rockafellar, R. T.: Convex Analysis. Princeton, N. J.: Princeton Univ. Press 1970.
Schmidt, J. W.: Convex interval interpolation with cubic splines. BIT26, 377–387 (1986).
Schmidt, J. W.: On tridiagonal linear complementarity problems. Numer. Math.51, 11–21 (1987).
Schmidt, J. W.: Specially structured convex optimization problems: Computational aspects and applications. In: P. Rózsa (ed.): Numerical Methods. Colloquia Math. Soc. János Bolyai, Vol. 50, pp. 544–558, North-Holland 1987.
Schmidt, J. W., Heß, W.: Quadratic and related exponential splines in shape preserving interpolation. J. Comput. Appl. Math.18, 321–329 (1987).
Schoenberg, I. J.: Spline functions and the problem of graduation. Proc. Nat. Acad. Sci.52, 947–950 (1964).
Späth, H.: Spline-Algorithmen zur Konstruktion glatter Kurven und Flächen (4. Aufl.). München-Wien: R. Oldenbourg Verlag 1986.
Stoer, J., Witzgall, C.: Convexity and optimization in finite dimensions. Berlin-Heidelberg-New York: Springer-Verlag 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schmidt, J.W. An unconstrained dual program for computing convexC 1-spline approximants. Computing 39, 133–140 (1987). https://doi.org/10.1007/BF02310102
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02310102