Approximation with interpolatory constraints
نویسندگان
چکیده
منابع مشابه
Approximation with Interpolatory Constraints
Given a triangular array of points on [−1, 1] satisfying certain minimal separation conditions, a classical theorem of Szabados asserts the existence of polynomial operators that provide interpolation at these points as well as a near-optimal degree of approximation for arbitrary continuous functions on the interval. This paper provides a simple, functional-analytic proof of this fact. This abs...
متن کاملInterpolatory Subdivision with Shape Constraints for Curves ∗
We derive two reformulations of the C1 Hermite subdivision scheme introduced by Merrien. One where we separate computation of values and derivatives and one based of refinement of a control polygon. We show that the latter leads to a subdivision matrix which is totally positive. Based on this we give algorithms for constructing subdivision curves that preserve positivity, monotonicity, and conv...
متن کاملInterpolatory Pointwise Estimates for Polynomial Approximation
We discuss whether or not it is possible to have interpolatory pointwise estimates in the approximation of a function f 2 C 0; 1], by polynomials. For the sake of completeness as well as in order to strengthen some existing results, we discuss brieey the situation in unconstrained approximation. Then we deal with positive and monotone constraints where we show exactly when such interpolatory es...
متن کاملApproximation order of interpolatory nonlinear subdivision schemes
Linear interpolatory subdivision schemes of C smoothness have approximation order at least r + 1. The present paper extends this result to nonlinear univariate schemes which are in proximity with linear schemes in a certain specific sense. The results apply to nonlinear subdivision schemes in Lie groups and in surfaces which are obtained from linear subdivision schemes. We indicate how to exten...
متن کاملC1 Interpolatory Subdivision with Shape Constraints for Curves
We derive two reformulations of the C1 Hermite subdivision scheme introduced in [12]. One where we separate computation of values and derivatives and one based of refinement of a control polygon. We show that the latter leads to a subdivision matrix which is totally positive. Based on this we give algorithms for constructing subdivision curves that preserve positivity, monotonicity, and convexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2001
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-01-06240-2