Given a convex function \(f\) without any smoothness requirements on its derivatives, we estimate its error of approximation by \(\mathbf{C}^{1}\) convex quadratic splines in terms of \(\omega_{3}(f, 1 / n)\). C 1993 Academic Press, Inc.
On Convex Approximation by Quadratic Splines
โ Scribed by Kamen G. Ivanov; Boyan Popov
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 221 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
โฆ Synopsis
In a recent paper by Hu it is proved that for any convex function f there is a C 1 convex quadratic spline s with n knots that approximates f at the rate of | 3 ( f, n &1 ). The knots of the spline are basically equally spaced. In this paper we give a simple construction of such a spline with equally spaced knots. 1996 Academic Press, Inc.
for k=i&1, i, i+1.
(2)
article no. 0032 110
๐ SIMILAR VOLUMES
When a quadratic NURBS curve is used to describe the path of a computer-controlled cuttin9 machine, the NURBS curve is usually approximated by many straight-line segments. It is preferable to describe the cutting path as an arc spline, a tangent-continuous, piecewise curve made of circular arcs and