Polynomial and spline approximation by quadratic programming
โ Scribed by Amos, D. E.; Slater, M. L.
- Book ID
- 118009767
- Publisher
- Association for Computing Machinery
- Year
- 1969
- Tongue
- English
- Weight
- 254 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0001-0782
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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.
We prove that if a function \(f \in \mathbb{C}[0,1]\) changes sign finitely many times, then for any \(n\) large enough the degree of copositive approximation to \(f\) by quadratic spliners with \(n-1\) equally spaced knots can be estimated by \(C \omega_{2}(f, 1 / n)\), where \(C\) is an absolute c
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 equall
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