학술논문
Numerische Berechnung monotoner und konvexer Spline-Interpolierender.
Document Type
Journal
Author
Hornung, U. AMS Author Profile
Source
Subject
65 Numerical analysis -- 65D Numerical approximation and computational geometry
65D07Splines
65D07
Language
German
Abstract
From the text: ``A number of theorems exist on monotone and convex splines [see, for example, C. de Boor and B. Swartz, J. Approximation Theory {\bf 21} (1977), no. 4, 411--416; MR0481727 (58 \#1826); R. A. DeVore, SIAM J. Math. Anal. {\bf 8} (1977), no. 5, 891--905; MR0510725 (58 \#23259)]. This article is based on the premise that splines can be characterized by certain minimal properties [see S. D. Fisher and J. W. Jerome, {\it Minimum norm extremals in function spaces}, Lecture Notes in Math., Vol. 479, Springer, Berlin, 1975; MR0442780 (56 \#1159)]. In contrast to the usual formulations we consider conditions of monotonicity and convexity as additional constraints in problems of infinite optimization. The solutions of these problems turn out to be splines.''