On the Preservation of the Shape of Convexity of Functions by Approximation Polynomials

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)

PDF

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

Original text
Rate this translation
Your feedback will be used to help improve Google Translate

On the preservation of the convexity of functions by approximation polynomials

By
TIBERIU POPOVICIU
THE CALCULATION INSTITUTE
OF THE CLUJ BRANCH OF THE ACADEMY
OF THE SOCIALIST REPUBLIC OF ROMANIA
  1. 1.

    In approximation problems, we usually look for an approximation function.φ\varphiof the given functionffso that the errorfφf-\varphiof the approximate equality

fφf\approx\varphi (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 shapeffIn general, the approximation functionφ\varphiis chosen from a certain determined set of functions, a set which depends in some way on the functionffFor example, one can chooseφ\varphiin 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 operatorF[f|x]F[f\mid x]defined on the function spaceff, real and of a real variablexx, defined on a setEEof the real axis, having its values ​​in the set of real functions defined on the setIIof the real axis. In what follows, unless otherwise stated, we will assume that the operatorF[f|x]F[f\mid x]is linear and we introduce the

Definition. We will say that the operatorF[f|x]F[f\mid x]preserves (onII) convexity, non-concavity, polynomiality, non-convexity respectively concavity of ordernn(of the functionff) if the functionF[f|x]F[f\mid x]ofxxis convex, non-concave, polynomial, non-convex respectively concave of ordernn(onII) for any convex, non-concave, polynomial, non-convex, respectively concave function of ordernn(onEE).

Let us recall that a functionffis said to be convex, non-concave, polynomial, non-convex respectively concave of ordern(1)n(\geqq-1)onEEif all the differences divided by ordern+1,[x1,x2,,xn+2;f]n+1,\left[x_{1},x_{2},\ldots,x_{n+2};f\right]of this function onn+2n+2any distinct points, or nodesx1,x2,,xn+2x_{1},x_{2},\ldots,x_{n+2}ofEEare 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 ordernnto concave, nonconvex, and polynomial functions of ordernnby changing their sign (onEE) so by going fromffhasf-fand vice versa. The properties of concavity and non-convexity conservation therefore simply follow (in the case of linear operators)F[f|x]F[f\mid x]), properties of preservation of convexity and non-concaveness of the same order. The casen=1n=-1This 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 casen=0n=0corresponds to the preservation of monotony andn=1n=1to the preservation of the usual convexity.
3. We studied the casen>1n>-1for several determined operators. Our research began with the observation that the well-known SN Bernstein polynomial

α=0mf(αm)(mα)xα(1x)mα\sum_{\alpha=0}^{m}f\left(\frac{\alpha}{m}\right)\binom{m}{\alpha}x^{\alpha}(1-x)^{m-\alpha} (2)

conserves over the interval[0.1][0,1]the non-concave ordernnof the functionfffor everythingn1n\geqq-1[2]. In this case we can takeE=I=[0.1]E=I=[0,1]We 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 toL(x1,x2,,xn+1;f|x)L\left(x_{1},x_{2},\ldots,x_{n+1};f\mid x\right)the Lagrange polynomial (of degreenntaking the same values ​​as the functionffon then+1n+1knotsx1,x2,,xn+1x_{1},x_{2},\ldots,x_{n+1}.

Because the coefficient ofxnx^{n}in the polynomialL(x1,x2,,xn+1;f|x)L\left(x_{1},x_{2},\ldots,x_{n+1};f\mid x\right)is equal to[x1,x2,,xn+1;f]\left[x_{1},x_{2},\ldots,x_{n+1};f\right]It follows that the property, almost obvious, is that ifx1,x2,,xn+1Ex_{1},x_{2},\ldots,x_{n+1}\in E, this polynomial preserves the non-concaveness of ordern1n-1over any intervalIIThis property is, moreover, equivalent to non-concavity of ordern1n-1But it is easy to demonstrate that this polynomial preserves non-concavity of ordern2n-2on the interval[x1+x2++xnn,x2+x3++xn+1n]\left[\frac{x_{1}+x_{2}+\cdots+x_{n}}{n},\frac{x_{2}+x_{3}+\cdots+x_{n+1}}{n}\right]assuming

 that x1<x2<<xn+1\text{ that }x_{1}<x_{2}<\cdots<x_{n+1} (4)
1969

Related Posts