Abstract
?
Authors
Tiberiu Popoviciu
(Institutul de Calcul)
Original title (in French)
Sur la conservation de l’allure de convexité des fonctions par des polynomes d’approximation
Keywords
Cite this paper as
T. Popoviciu, Sur la conservation de l’allure de convexité des fonctions par des polynomes d’approximation, Abstract spaces and approximation (Proc. Conf., Oberwolfach, 1968), pp. 328-337, Birkhäuser, Basel, 1969 (in French)
About this paper
Journal
Abstract spaces and approximation (Proc. Conf., Oberwolfach, 1968)
Publisher Name
Birkhäuser, Basel
Print ISSN
not available
Online ISSN
not available
Google Scholar citations
MR, ZBL
to be inserted
Paper (preprint) in HTML form
On the preservation of the convexity of functions by approximation polynomials
-
1.
In approximation problems, we usually look for an approximation function.of the given functionso that the errorof the approximate equality
| (1) |
checks certain restrictions (delimitations, etc.) imposed by the very nature of the problem under consideration.
But it is important to try to preserve, through approximation (1), certain properties of the function's shapeIn general, the approximation functionis chosen from a certain determined set of functions, a set which depends in some way on the functionFor example, one can choosein a set satisfying certain interpolation conditions.
Obviously, we must first clarify what we mean by the behavior, or more precisely, by a specific behavior, of a function, and then what we mean by preserving this behavior. We will not attempt to define the behavior of a function. We will only study some properties that we agree characterize certain behaviors, such as: non-negativity, monotonicity, convexity of a given order, etc.
2. To clarify, let us consider the operatordefined on the function space, real and of a real variable, defined on a setof the real axis, having its values ​​in the set of real functions defined on the setof the real axis. In what follows, unless otherwise stated, we will assume that the operatoris linear and we introduce the
Definition. We will say that the operatorpreserves (on) convexity, non-concavity, polynomiality, non-convexity respectively concavity of order(of the function) if the functionofis convex, non-concave, polynomial, non-convex respectively concave of order(on) for any convex, non-concave, polynomial, non-convex, respectively concave function of order(on).
Let us recall that a functionis said to be convex, non-concave, polynomial, non-convex respectively concave of orderonif all the differences divided by orderof this function onany distinct points, or nodesofare positive, non-negative, zero, non-positive, and negative, respectively. The properties of these functions, as well as those of divided differences, are well known. We move from convex, non-concave, and polynomial functions of orderto concave, nonconvex, and polynomial functions of orderby changing their sign (on) so by going fromhasand vice versa. The properties of concavity and non-convexity conservation therefore simply follow (in the case of linear operators)), properties of preservation of convexity and non-concaveness of the same order. The caseThis corresponds to the preservation of the sign of the function. Positive operators (and in general, non-negative operators) play a very important role in the theory of polynomial, trigonometric, and other similar approximations. The casecorresponds to the preservation of monotony andto the preservation of the usual convexity.
3. We studied the casefor several determined operators. Our research began with the observation that the well-known SN Bernstein polynomial
| (2) |
conserves over the intervalthe non-concave orderof the functionfor everything[2]. In this case we can takeWe obtained some general results concerning operators of type (2) [5] and concerning the preservation of sign and monotonicity by the interpolation polynomials of L. Fejér [6], which is also of the same type. We also obtained some analogous results for the Lagrange interpolation polynomial [4], [7].
We will refer tothe Lagrange polynomial (of degreetaking the same values ​​as the functionon theknots.
Because the coefficient ofin the polynomialis equal toIt follows that the property, almost obvious, is that if, this polynomial preserves the non-concaveness of orderover any intervalThis property is, moreover, equivalent to non-concavity of orderBut it is easy to demonstrate that this polynomial preserves non-concavity of orderon the intervalassuming
| (4) |
