Improving approximation via linear combinations of Bernstein operatorsThanks: ∗1General Directorate of Basrah Education, Ministry of Education, 61001, Basrah, Iraq, e-mail: pgs.ali.jaddoa@uobasrah.edu.iq, ORCID: 0009-0009-4618-3395.Thanks: 2Department of Mathematics, University of Basrah, College of Education for Pure Sciences, Basrah, Iraq, e-mail: Hanadi.sattar@uobasrah.edu.iq, ORCID: 0000-0002-9989-2170. Thanks: 3Department of Computer Sciences, University of Basrah, College of Computer Sciences and Information Technology, Basrah, Iraq, e-mail: nasir.jasim@uobasrah.edu.iq, ORCID: 0000-0003-4545-4682.
Abstract.
In this paper we study linear combinations of Bernstein operators that admit the iterate . Inside the span , which we adopt as an ansatz, requiring that constants be preserved and that the leading term of the second central moment vanish leaves a one-parameter family, of which Butzer’s operator is the member using no iterate. The remaining parameter can annihilate the leading term of exactly one of the three central moments that enter the error at the leading order, so that the family has exactly three distinguished members; we study the one selected by the fourth moment, . We compute its moments and prove an error estimate of order for with explicit constants, a refinement of it in which the contribution of is , an estimate in a modified fourth-order -functional, uniform convergence on , and a Voronovskaja-type formula. The comparison with is the point of the construction: the choice removes the term of the asymptotic error and introduces a term, so that neither operator dominates the other. Numerical examples illustrate both regimes.
Key words and phrases:
Bernstein operators, linear combinations, iterates of operators, rate of convergence, Voronovskaja-type formula, -functional.2005 Mathematics Subject Classification
41A35, 41A36, 47A58.1. Introduction
In 1912, Bernstein [3] introduced a very famous operator in approximation theory. For a function , it is defined as:
| (1) |
This operator is widely used because of its simple binomial structure and its ability to preserve the shape of the function; however, its main drawback is the slow rate of convergence, which is only , and this motivates the search for modified operators with better approximation behaviour. To fix this speed problem, various modification techniques have been developed in the literature. One common approach, initiated by Butzer in 1953 [4], involves forming linear combinations of Bernstein operators. This technique effectively reduces lower-order errors and accelerates the approximation process; the systematic theory of such combinations, together with the moduli of smoothness appropriate to them, is developed in [7]. A classic example is given by
| (2) |
which achieves a convergence rate of . Combinations of arbitrary order are obtained in the same manner and have long been available; see May [14] for the general exponential-type framework and Ditzian and Ivanov [6] for the converse theory that accompanies them.
Another approach relies on iterating the operator, denoted as . Kelisky and Rivlin [11] were among the first to investigate this, followed by important results on behaviour and stability from Micchelli [15], Raşa [18], and recently Acu and Raşa [1]. Parallel to these developments, significant effort has been directed towards designing operators that reproduce specific functions or incorporate shape parameters to enhance modelling flexibility and accuracy [12, 10, 22, 16, 21, 17, 23]. A different device for raising the order, which we do not pursue here, is that of quasi-interpolants [20].
The combination studied here is not postulated but obtained from two structural requirements. Writing , consider all combinations, taken here as our ansatz,
subject to two structural requirements: preservation of constants, , and the vanishing of the term of , which reads . These two linear conditions leave one free parameter; solving them gives the one-parameter family
| (3) |
whose member is exactly Butzer’s operator (2), in which the iterate plays no role; every is a genuine use of iteration. Equivalently, writing for the Boolean sum of the Bernstein operator [18], the family (3) is the affine line
through Butzer’s operator and , the parameter being the position on it.
All members of (3) share the approximation order , so the parameter must be fixed by a finer criterion, and the central moments provide one. By Section 2, the leading term of is, for every , an affine function of with a single root; at the order exactly three moments contribute, those of , with roots , and . The case is no exception: the two conditions defining (3) remove the term of for every , and what remains, , vanishes only for . The single free parameter can annihilate exactly one of the three terms, and no choice annihilates two, so (3) has exactly three distinguished members, , and , the first being Butzer’s operator and the other two new. We study the member selected by the fourth moment, the one that removes the term of highest differential order, and it is
| (4) |
for which the fourth central moment satisfies , one power better than for a generic member of the family (here denotes the -th central moment of ; see Section 2). Throughout, .
This choice is not a uniform improvement, and we do not claim it as one. The same computation shows that is the unique member of (3) reproducing , and the unique one whose asymptotic error carries no term. Admitting the iterate therefore trades a second-order term for the annihilation of a fourth-order one, so that is advantageous precisely on functions with large high-order derivatives and inferior to on ordinary smooth ones. We note at the outset that , like , is not a positive operator, so that the shape-preserving properties of are not inherited (Section 2). The trade-off is made quantitative in Section 3 and confirmed numerically in Section 4 .
The paper is organized as follows. Section 2 records the moments of and , establishes the selection identities of Section 2 and the choice , and computes the moments and central moments of . Section 3 contains the quantitative error estimates and a Voronovskaja-type theorem for , together with the explicit comparison with ; the quantitative form of the Voronovskaja formula, for which we refer to Gonska [9], is not pursued here. Section 4 reports numerical experiments on both smooth and non-smooth test functions.
2. Preliminaries and Auxiliary Results
In this section we collect the auxiliary results needed later. We first record the moments and central moments of the classical Bernstein operator and of its second iterate , then those of , and finally establish, in Section 2, the asymptotic identities on which the selection of rests.
Lemma .
For each let ; the operators map functions of to functions of . Then, for the classical Bernstein operator and the composition , the following equalities hold for any :
The corresponding formulas for follow by replacing with .
Proof.
The moments of are standard [13]; explicitly,
where denote the Stirling numbers of the second kind and is the falling factorial. Since is a polynomial of degree , the moments of the composition are obtained by substituting that polynomial into the outer operator and applying the same formula termwise:
denoting the coefficient of . This is consistent with the properties of iterates established in [15, 8]. ∎
Lemma .
The central moments of and are given by:
Again, the formulas for follow by replacing with . In particular, writing , and : the variance of the iterate is asymptotically twice that of .
Proof.
The results follow by expressing the central moments in terms of the raw moments of Section 2, using the linearity of the operators and the binomial expansion of . ∎
Lemma .
Let be the operator defined in (4). Then for :
Proof.
The proof follows from the linearity of and the moments of the component operators established in Section 2. Since , and preserve linear functions, we immediately obtain
For , substituting the third moments of Section 2 and using
gives
The bracket multiplying vanishes, and collecting the remaining terms yields the stated expression. ∎
Lemma .
Let be the -th central moment of . Then:
In particular uniformly on .
Proof.
Lemma .
Let and .
- (i)
Expansions. For every
and
the corresponding expansions for following on replacing by , that is on dividing them by and respectively.
- (ii)
Even orders. For every
where , the second central moment being exact,
and where, for , if and only if .
- (iii)
Odd orders. For every
Here if and only if .
- (iv)
In particular, for , for , the improved order holding only for .
Proof.
The expansions. Let ; these satisfy the classical recurrence [13]
Induction on shows that is a polynomial in all of whose coefficients are , so that differentiation does not change their order, and gives
with , that is ; the base cases and are exact. Replacing by gives the expansions for , dividing them by and respectively. For the iterate, write and apply the inner operator at , then the outer one at :
Since and , expanding about shows that the term of index and Taylor order is ; this exponent is never below , and equality determines the terms that contribute at leading order. When is even, replacing by suffices, as the Taylor correction is one power of smaller. When is odd, for each even index the main term and the Taylor derivative correction both contribute at the leading order . Summing these combined contributions over all indices yields the factor for and for , completing the proof of (i); the cases of Section 2 confirm the factors , and .
(ii). Substituting the three expansions into (3) and
collecting the coefficient of yields
. Multiplying by gives
, and since
we obtain for
, both sides vanishing identically for . There the moment is
exact: by Section 2,
(iii). The same substitution, with the factors and
in place of and , yields ;
multiplying by gives
, whence the root, the coefficient
of being positive. Section 2 confirms the case , where
.
(iv). By part (i) each of the three components of (4) has -th central moment , so the triangle inequality gives for every . For part (ii) gives , so that , , and for : the gain of one power of occurs for and and fails from onwards. By part (iii), and for , so no odd moment gains a power. ∎
Remark .
Three consequences for the family (3).
(i) By Section 2(ii), exactly, so is the only member reproducing and the only one whose asymptotic error carries no term; and are the members singled out in the same way by the third and by the fourth moment.
(ii) No member is positive, included. For the second central moment is negative on ; for it is not, and one uses the fourth instead, with . Consequently no Korovkin-type argument is available – convergence is obtained in Section 3 through the -functional instead – and preserves neither monotonicity nor convexity.
(iii) Each member is nevertheless a combination of the positive operators , and , so that
and in particular . Every estimate below rests on this inequality, the Cauchy–Schwarz inequality [2] being applied to each component separately; we refer to it as passing to the three positive components.
3. Main Results
In this section we first establish the uniform boundedness of , then record in Section 3 the Taylor decomposition on which all the direct estimates rest. From it we deduce a direct estimate for , the quantitative estimate for with explicit constants, and a refinement of the latter in which the contribution of is . We then give an estimate in a modified fourth-order -functional and derive a Voronovskaja-type asymptotic formula for the whole family, from which the comparison between and Butzer’s operator follows explicitly.
Theorem 1.
The operators are uniformly bounded on :
that is, .
Proof.
By (4) and the triangle inequality,
Each of , and is a positive linear operator reproducing constants, so that
Substituting these bounds back into the inequality:
∎
Lemma .
Let , let be even and . Then, for every ,
| (5) |
where is defined for by
Being a quotient of continuous functions away from , and satisfying for some between and , the function is continuous on the whole of and . Moreover, with a constant depending only on and ,
| (6) |
Proof.
Theorem 2.
Let . Then, with the constant of Section 3 for and
denoting the modulus of continuity. In particular .
Proof.
Remark .
Neither of the two constants is sharp. The value cannot be lowered to , a linear operator reproducing constants having norm exactly when it is positive; but numerically stays below , and any sharpening of Theorem 1 improves the constant of Theorem 5 in the same proportion. The rate of Theorem 2 is likewise not : its second term is controlled only by the modulus of continuity of , and the order of Theorem 3 needs two further derivatives.
Theorem 3.
Let and . Then
In particular with explicit constants.
Proof.
First term. As in Theorem 2, .
Second term. By Section 2(iv), , and for one has , so that , using .
Remainder. Since , Section 2(iii) gives
Substituting the fourth central moments of Section 2 and writing everything in terms of ,
For the negative terms of the two brackets are at most and , against the constants and , so both are positive; hence increases with and attains its maximum at :
the inequality because for . Hence and . Substituting the three estimates into (7) and taking the supremum over completes the proof. ∎
Remark .
The same proof applied to gives a better bound, and without the restriction : here and exactly, and for , so that
Against the constants , , of Theorem 3, only the one favours : the term is absent for , and its constant is smaller by a factor . This is an artefact of the method, which estimates the remainder through , larger than the of , so that the cancellation – the very reason for the choice – is invisible to it. The remedy is to split the remainder before estimating it, which is done in Theorem 4.
Theorem 4.
Let and . Then, with the constant of Section 3 for and
In particular the contribution of to the error is .
Proof.
Apply Section 3 with and , this time without recombining: the first two terms of (5) are bounded as in Theorem 3, and the last is by (6). For the third, write in Section 2(v): the four polynomials in multiplying attain on the maximum moduli , , , , all at , so that bounding by , , for gives
the same constant as for in Theorem 3, one power of lower; the third term is therefore at most . ∎
The two bounds are not comparable at fixed , the constant of Theorem 4 not being explicit; but Theorem 4 is the sharper statement asymptotically, and it is the only estimate of this section without a counterpart for , whose fourth central moment is of the exact order (Section 3). Theorem 3, with its three explicit constants, is the one used in Theorem 5 below.
Definition .
For put
For and we use the modified fourth-order -functional
Theorem 5.
Let and . Then
Proof.
Corollary .
For every ,
that is, uniformly on .
Proof.
Since is dense in , we have for every . As , Theorem 5 gives the claim. ∎
Remark .
The functional of Section 3 is not Peetre’s -functional for the pair [5], which carries alone; the two lower-order seminorms are forced by the term of Theorem 3. Theorem 5 can nevertheless be placed in the classical setting. By the Landau–Kolmogorov inequality and are bounded by on , so that with ; and by Johnen’s equivalence [5, 7], . Hence
the classical direct estimate for combinations of order two. Theorems 1, 2, 3 and 5 hold, with comparable or better constants, for as well (Section 3); the difference between the two operators lies in Theorems 4, 6 and 3 alone.
Theorem 6.
Let and . Then, for every ,
| (8) | ||||
The three coefficients vanish precisely for , and respectively, and no value of annihilates two of them.
Proof.
Apply Section 3 with :
By Section 2,
the first being exact, and multiplying by these three limits give the right-hand side of (8). The remaining term vanishes: by (6) with ,
being uniformly continuous on .
Finally, the three coefficients in (8) are affine in with the distinct roots , and , so that no value of annihilates two of them. ∎
Corollary .
Proof.
Put , and in (8). ∎
4. Numerical examples
We test the operators on four functions,
the first oscillating rapidly, the second continuous with a corner, the third smooth, and the fourth the smooth function on which is the best, and compare the three distinguished members , and with one another and with . The Bernstein operator is taken at because the combinations read at the same nodes, so that the four operators use the same data; their cost differs, requiring an precomputation of the inner values .
On the uniform grid , , with , in double precision, we measure
and the empirical order of convergence
each entry being placed in the column of the finer ; the first column carries no entry, its predecessor not being tabulated. All values are given to three significant figures. Avg E is a grid average, that is a quadrature approximation to the error, and the EOC row refers to Max E alone. The two columns may therefore show different orders without disagreeing: in Table 2 the corner of contributes to the sup norm at every but occupies a shrinking set, so that Max E decays with order and Avg E with order . The results are collected as follows. Tables 1 and 4 report the errors and the empirical orders for in turn. Figure 1 and Figure 3 show the four approximants for and ; for they would be indistinguishable from the function at this accuracy, so Figure 5 shows the pointwise errors instead, on a logarithmic vertical scale. Figures 2, 4, 6 and 7 show the maximum error against in logarithmic scales, the guide lines carrying the slopes predicted by the theory: and for the smooth functions, for .
The rapidly oscillating is the function on which is at its best: its empirical order passes while that of is still below . An order above is of course transient, all three combinations being of exact order on by Theorem 6; it records that the asymptotic regime has not yet been reached, the quantity still decreasing towards its limit for while it has nearly settled for . The member with the smaller asymptotic constant is the one that reaches its regime last, so that here a transient EOC above is itself a sign of the cancellation of the term.
| Max E | ||||||
|---|---|---|---|---|---|---|
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – |
The corner of costs every operator its order: all four decay like in the sup norm, and only a constant factor separates the three combinations.
| Max E | ||||||
|---|---|---|---|---|---|---|
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – |
On the smooth the three combinations all reach the order , and their ranking is the reverse of the one on .
| Max E | ||||||
|---|---|---|---|---|---|---|
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – |
On the member selected by the third central moment, , is the best of the three.
| Max E | ||||||
|---|---|---|---|---|---|---|
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – | |||||
| Max E | ||||||
| Avg E | ||||||
| EOC | – |
Maximum error against in logarithmic scales for ; the guide line has slope
is the most accurate of the three combinations in Tables 1 and 2 and the least accurate in Table 3, and Section 3 says why. On , whose fourth derivative is large relative to its second, the first difference decides and wins; on , whose derivatives are of comparable size, the second decides and wins. The observed factors are the predicted ones: the ratios and of Table 3 agree with the ratios and of the corresponding asymptotic constants of (8). The formula itself is confirmed at three values of at once: on , at equals , and for , and , against , and for of the modulus of the constant that (8) gives at , and , the deviation falling like . On no operator reaches the order , the missing smoothness leaving only a constant factor between them.
Nor is the best member of (3) on every function: on the member selected by the third central moment, , is about four times more accurate than either of the other two, the term being the one that dominates there. Which member is best adapted to a given function is read off from (8), and it is precisely when dominates.
5. Conclusion
The family (3) is what the two requirements – preservation of constants and the vanishing of the term of the second central moment – leave free. Every member has approximation order , an order already available from Butzer’s operator , so the order itself is not what the construction contributes; what the remaining free parameter can still do is annihilate the leading term of exactly one of the three central moments that enter the error at that order, and this classifies the distinguished members of the family as , and , the first classical and the other two new. For the third we proved a uniform bound, direct estimates of order for and for with explicit constants, a refinement of the latter in which the contribution of is , an estimate in a modified fourth-order -functional, uniform convergence on , and the Voronovskaja-type formula of Theorem 6, stated for the whole family.
That formula is not the only place where the members differ, but almost: the estimates of Theorems 1, 2, 3 and 5 hold for as well, with comparable or better constants, and the sole quantitative exception is Theorem 4, whose gain rests on the cancellation and has no counterpart for . No member is positive either, so that the shape-preserving properties of are lost in every case. No member is uniformly better than the others either, and which one is best adapted to a given function is read off from the three coefficients of (8) – it is precisely when dominates – as the experiments of Section 4 confirm, each of the three being the most accurate on at least one of the four test functions. Two directions seem worth pursuing. The members singled out by the higher central moments through Section 2 begin at and have not been examined here, nor has the description of the classes of functions on which each distinguished member is preferable, of which Section 4 gives only numerical evidence. The second is the extension of the same selection principle to bivariate operators on multidimensional domains, and to families carrying shape parameters, where an additional degree of freedom would allow more than one moment to be annihilated at once.
References
- [1] A.M. Acu and I. Raşa, Ulam stability for the composition of operators, Symmetry, 12 (2020) no. 7, Art. no. 1159. https://doi.org/10.3390/sym12071159
- [2] F. Altomare and M. Campiti, Korovkin-type Approximation Theory and its Applications, de Gruyter Studies in Mathematics 17, Walter de Gruyter, Berlin, 1994. https://doi.org/10.1515/9783110884586
- [3] S.N. Bernstein, Démonstration du Théorème de Weierstrass fondée sur le calcul des probabilités, Commun. Soc. Math. Kharkov, 13 (1912) no. 1, pp. 1–2.
- [4] P.L. Butzer, Linear combinations of Bernstein polynomials, Canad. J. Math., 5 (1953), pp. 559–567. https://doi.org/10.4153/CJM-1953-063-7
- [5] R.A. DeVore and G.G. Lorentz, Constructive Approximation, Grundlehren der mathematischen Wissenschaften 303, Springer-Verlag, Berlin, 1993.
- [6] Z. Ditzian and K.G. Ivanov, Strong converse inequalities, J. Anal. Math., 61 (1993), pp. 61–111. https://doi.org/10.1007/BF02788839
- [7] Z. Ditzian and V. Totik, Moduli of Smoothness, Springer Series in Computational Mathematics 9, Springer-Verlag, New York, 1987. https://doi.org/10.1007/978-1-4612-4778-4
- [8] I. Gavrea and M. Ivan, Asymptotic behaviour of the iterates of positive linear operators, Abstract and Applied Analysis, 2011 (2011), Art. ID 670509. https://doi.org/10.1155/2011/670509
- [9] H. Gonska, On the degree of approximation in Voronovskaja’s theorem, Studia Univ. Babeş-Bolyai Math., 52 (2007) no. 3, pp. 103–115.
- [10] A. Kajla and T. Acar, Modified -Bernstein operators with better approximation properties, Ann. Funct. Anal., 10 (2019) no. 4, pp. 570–582. https://doi.org/10.1215/20088752-2019-0015
- [11] R.P. Kelisky and T.J. Rivlin, Iterates of Bernstein polynomials, Pacific J. Math., 21 (1967) no. 3, pp. 511–520. https://doi.org/10.2140/pjm.1967.21.511
- [12] J.P. King, Positive linear operators which preserve , Acta Math. Hungar., 99 (2003) no. 3, pp. 203–208. https://doi.org/10.1023/A:1024571126455
- [13] G.G. Lorentz, Bernstein Polynomials, University of Toronto Press, Toronto, 1953.
- [14] C.P. May, Saturation and inverse theorems for combinations of a class of exponential-type operators, Canad. J. Math., 28 (1976) no. 6, pp. 1224–1250. https://doi.org/10.4153/CJM-1976-123-8
- [15] C.A. Micchelli, The saturation class and iterates of the Bernstein polynomials, J. Approx. Theory, 8 (1973) no. 1, pp. 1–18. https://doi.org/10.1016/0021-9045(73)90028-2
- [16] F. Özger, H.M. Srivastava and S.A. Mohiuddine, Approximation of functions by a new class of generalized Bernstein-Schurer operators, RACSAM, 114 (2020) no. 4, Art. no. 173. https://doi.org/10.1007/s13398-020-00903-6
- [17] R.S. Rajawat, K.K. Singh and V.N. Mishra, Approximation by modified Bernstein polynomials based on real parameters, Math. Found. Comput., 7 (2024) no. 3, pp. 297–309. https://doi.org/10.3934/mfc.2023005
- [18] I. Raşa, Iterated Boolean sums of Bernstein and related operators, Rev. Anal. Numér. Théor. Approx., 35 (2006) no. 1, pp. 111–115. https://doi.org/10.33993/jnaat351-1018
- [19] W. Rudin, Principles of Mathematical Analysis, 3rd ed., McGraw–Hill, New York, 1976.
- [20] P. Sablonnière, Bernstein quasi-interpolants, Approx. Theory Appl., 8 (1992) no. 3, pp. 62–76.
- [21] M. Sofyalıoğlu, K. Kanat and B. Çekim, Parametric Generalization of the Modified Bernstein Operators, Filomat, 36 (2022) no. 5, pp. 1699–1709. https://doi.org/10.2298/FIL2205699S
- [22] F. Usta, On New Modification of Bernstein Operators: Theory and Applications, Iran. J. Sci. Technol. Trans. Sci., 44 (2020) no. 6, pp. 1801–1809. https://doi.org/10.1007/s40995-020-00919-y
- [23] G. Zhou and Q.-B. Cai, Approximation properties of -Bernstein operators, Filomat, 39 (2025) no. 23, pp. 8193–8207. https://doi.org/10.2298/FIL2523193Z









