Return to Article Details Improving approximation via linear combinations of Bernstein operators

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.

Ali A. Jaddoa∗1 and Hanadi Abdulsattar2 and Naser O. Jassim3
Date: May 11, 2026; accepted: August 29, 2026; published online: August 31, 2026.
Abstract.

In this paper we study linear combinations of Bernstein operators that admit the iterate 𝒵n=ℬn∘ℬn. Inside the span {ℬn,ℬ2⁢n,𝒵n}, 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 𝒬n 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, ℱn. We compute its moments and prove an error estimate of order n−2 for φ∈C4⁢[0,1] with explicit constants, a refinement of it in which the contribution of φ(4) is o⁡(n−2), an estimate in a modified fourth-order K-functional, uniform convergence on C⁡[0,1], and a Voronovskaja-type formula. The comparison with 𝒬n is the point of the construction: the choice removes the φ(4) 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, K-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 φ∈C⁡[0,1], it is defined as:

(1) ℬn⁢(φ,y)=∑w=0n(nw)⁢yw⁢(1−y)n−w⁢φ⁢(wn),y∈[0,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 𝒪⁡(n−1), 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) 𝒬n=2⁢ℬ2⁢n−ℬn,

which achieves a convergence rate of 𝒪⁡(n−2). Combinations of arbitrary order 𝒪⁡(n−k) 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 ℬnk. 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 ψy⁢(t)=t−y, consider all combinations, taken here as our ansatz,

L=a⁢ℬ2⁢n+b⁢ℬn+c⁢𝒵n,𝒵n=ℬn∘ℬn,

subject to two structural requirements: preservation of constants, a+b+c=1, and the vanishing of the 𝒪⁡(n−1) term of L⁡(ψy2,y), which reads a2+b+2⁢c=0. These two linear conditions leave one free parameter; solving them gives the one-parameter family

(3) Lc=(2+2⁢c)⁢ℬ2⁢n−(1+3⁢c)⁢ℬn+c⁢𝒵n,c∈ℝ,

whose member c=0 is exactly Butzer’s operator (2), in which the iterate plays no role; every c≠0 is a genuine use of iteration. Equivalently, writing Un=2⁢ℬn−𝒵n for the Boolean sum of the Bernstein operator [18], the family (3) is the affine line

Lc=(1+c)⁢𝒬n−c⁢Un,

through Butzer’s operator and Un, the parameter c being the position on it.

All members of (3) share the approximation order 𝒪⁡(n−2), so the parameter must be fixed by a finer criterion, and the central moments provide one. By Section 2, the leading term of Lc⁢(ψym,y) is, for every m≥2, an affine function of c with a single root; at the order n−2 exactly three moments contribute, those of m=2,3,4, with roots c=0, c=15 and c=13. The case m=2 is no exception: the two conditions defining (3) remove the 𝒪⁡(n−1) term of Lc⁢(ψy2,y) for every c, and what remains, c⁢y⁢(y−1)⁢n−2, vanishes only for c=0. The single free parameter can annihilate exactly one of the three terms, and no choice annihilates two, so (3) has exactly three distinguished members, L0=𝒬n, L1/5 and L1/3, 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) ℱn⁢(φ,y):=L1/3⁢(φ,y)=83⁢ℬ2⁢n⁢(φ,y)−2⁢ℬn⁢(φ,y)+13⁢𝒵n⁢(φ,y),

for which the fourth central moment satisfies Ωn,4=𝒪⁡(n−3), one power better than for a generic member of the family (here Ωn,m denotes the m-th central moment of ℱn; see Section 2). Throughout, ‖φ‖=maxy∈[0,1]⁡|φ⁡(y)|.

This choice is not a uniform improvement, and we do not claim it as one. The same computation shows that c=0 is the unique member of (3) reproducing e2, 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 ℱn is advantageous precisely on functions with large high-order derivatives and inferior to 𝒬n on ordinary smooth ones. We note at the outset that ℱn, like 𝒬n, is not a positive operator, so that the shape-preserving properties of ℬn 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 ℬn and 𝒵n, establishes the selection identities of Section 2 and the choice c=13, and computes the moments and central moments of ℱn. Section 3 contains the quantitative error estimates and a Voronovskaja-type theorem for φ∈C4⁢[0,1], together with the explicit comparison with 𝒬n; 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 𝒵n=ℬn∘ℬn, then those of ℱn, and finally establish, in Section 2, the asymptotic identities on which the selection of c=13 rests.

Lemma .

For each i∈ℕ0 let ei⁢(t)=ti; the operators map functions of t to functions of y. Then, for the classical Bernstein operator ℬn and the composition 𝒵n=ℬn∘ℬn, the following equalities hold for any y∈[0,1]:

ℬn⁢(e0,y)=𝒵n⁢(e0,y)=1,ℬn⁢(e1,y)=𝒵n⁢(e1,y)=y,ℬn⁢(e2,y)=y2+y⁡(1−y)n,
𝒵n⁢(e2,y)=y2+(2⁢n−1)⁢y⁢(1−y)n2,
ℬn⁢(e3,y)=y3+3⁢y2⁢(1−y)n+y⁢(1−y)⁢(1−2⁢y)n2,
𝒵n⁢(e3,y)=y3+6⁢y2⁢(1−y)n+13⁢y3−18⁢y2+5⁢yn2+−12⁢y3+18⁢y2−6⁢yn3
+4⁢y3−6⁢y2+2⁢yn4,
ℬn⁢(e4,y)=y4−6⁢y3⁢(y−1)n+y2⁢(y−1)⁢(11⁢y−7)n2−y⁡(y−1)⁢(6⁢y2−6⁢y+1)n3,
𝒵n⁢(e4,y)=y4−12⁢y3⁢(y−1)n+2⁢y2⁢(y−1)⁢(29⁢y−16)n2
−3⁢y⁢(y−1)⁢(48⁢y2−40⁢y+5)n3+y⁡(y−1)⁢(193⁢y2−185⁢y+31)n4
−y⁡(y−1)⁢(132⁢y2−132⁢y+23)n5+6⁢y⁢(y−1)⁢(6⁢y2−6⁢y+1)n6.

The corresponding formulas for ℬ2⁢n follow by replacing n with 2⁢n.

Proof.

The moments of ℬn are standard [13]; explicitly,

ℬn⁢(em,y)=n−m⁢∑k=0mS⁡(m,k)⁢nk¯⁢yk,

where S⁡(m,k) denote the Stirling numbers of the second kind and nk¯=n(n−1)⋯(n−k+1) is the falling factorial. Since ℬn⁢(em,⋅) is a polynomial of degree m, the moments of the composition are obtained by substituting that polynomial into the outer operator and applying the same formula termwise:

𝒵n⁢(em,y)=∑j=0m[ℬn⁢(em,⋅)]j⁢ℬn⁢(ej,y),

[⋅]j denoting the coefficient of sj. This is consistent with the properties of iterates established in [15, 8]. ∎

Lemma .

The central moments of ℬn and 𝒵n are given by:

ℬn⁢(ψy0,y)=𝒵n⁢(ψy0,y)=1,ℬn⁢(ψy1,y)=𝒵n⁢(ψy1,y)=0,
ℬn⁢(ψy2,y)=y⁡(1−y)n,𝒵n⁢(ψy2,y)=(2⁢n−1)⁢y⁢(1−y)n2,
ℬn⁢(ψy3,y)=y⁡(2⁢y2−3⁢y+1)n2,𝒵n⁢(ψy3,y)=(5⁢n2−6⁢n+2)⁢y⁢(1−y)⁢(1−2⁢y)n4,
ℬn⁢(ψy4,y)=3⁢y2⁢(y−1)2n2−y⁡(y−1)⁢(6⁢y2−6⁢y+1)n3,
𝒵n⁢(ψy4,y)=12⁢y2⁢(y−1)2n2−3⁢y⁢(y−1)⁢(32⁢y2−32⁢y+5)n3
+y⁡(y−1)⁢(177⁢y2−177⁢y+31)n4−y⁡(y−1)⁢(132⁢y2−132⁢y+23)n5
+6⁢y⁢(y−1)⁢(6⁢y2−6⁢y+1)n6.

Again, the formulas for ℬ2⁢n follow by replacing n with 2⁢n. In particular, writing σ2=σ2⁢(y)=y⁡(1−y), 𝒵n⁢(ψy2,y)=2⁢σ2⁢n−1+𝒪⁡(n−2) and 𝒵n⁢(ψy4,y)=3⁢(2⁢σ2)2⁢n−2+𝒪⁡(n−3): the variance of the iterate is asymptotically twice that of ℬn.

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 (t−y)m. ∎

Lemma .

Let ℱn be the operator defined in (4). Then for y∈[0,1]:

(i)⁢ℱn⁢(e0,y)=1,(ii)⁢ℱn⁢(e1,y)=y,(iii)⁢ℱn⁢(e2,y)=y2+y⁡(y−1)3⁢n2,
(iv)⁢ℱn⁢(e3,y)=y3+y⁢(y−1)⁢(5⁢y−1)3⁢n2−2⁢y⁢(y−1)⁢(2⁢y−1)n3
+2⁢y⁢(y−1)⁢(2⁢y−1)3⁢n4.
Proof.

The proof follows from the linearity of ℱn and the moments of the component operators established in Section 2. Since ℬn, ℬ2⁢n and 𝒵n preserve linear functions, we immediately obtain

(i)⁢ℱn⁢(e0,y)=83⁢ℬ2⁢n⁢(e0,y)−2⁢ℬn⁢(e0,y)+13⁢𝒵n⁢(e0,y)=83−2+13=1,
(ii)⁢ℱn⁢(e1,y)=83⁢ℬ2⁢n⁢(e1,y)−2⁢ℬn⁢(e1,y)+13⁢𝒵n⁢(e1,y)=8⁢y3−2⁢y+y3=y.
(iii)⁢ℱn⁢(e2,y) =83⁢ℬ2⁢n⁢(e2,y)−2⁢ℬn⁢(e2,y)+13⁢𝒵n⁢(e2,y)
=83⁢(y2+y⁡(1−y)2⁢n)−2⁢(y2+y⁡(1−y)n)
+13⁢(y2+(2⁢n−1)⁢y⁢(1−y)n2)
=y2+y⁡(1−y)⁢[43⁢n−2n+2⁢n−13⁢n2]
=y2+y⁡(1−y)⁢4⁢n−6⁢n+2⁢n−13⁢n2=y2+y⁡(y−1)3⁢n2.

For (iv), substituting the third moments of Section 2 and using
ℬ2⁢n⁢(e3,y)=y3+32⁢y2⁢(1−y)⁢n−1+14⁢y⁢(1−y)⁢(1−2⁢y)⁢n−2 gives

ℱn⁢(e3,y)−y3 =y2(−y)[83⋅32−⋅3+13⋅6]1n+y(−y)(−2y)[83⋅14−2]1n2
+13⁢[13⁢y3−18⁢y2+5⁢yn2+−12⁢y3+18⁢y2−6⁢yn3+4⁢y3−6⁢y2+2⁢yn4].

The bracket multiplying n−1 vanishes, and collecting the remaining terms yields the stated expression. ∎

Lemma .

Let Ωn,m⁢(y)=ℱn⁢(ψym,y) be the m-th central moment of ℱn. Then:

(i)⁢Ωn,0⁢(y)=1,(ii)⁢Ωn,1⁢(y)=0,(iii)⁢Ωn,2⁢(y)=y⁡(y−1)3⁢n2,
(iv)⁢Ωn,3⁢(y)=y⁢(y−1)⁢(2⁢y−1)3⁢n2−2⁢y⁢(y−1)⁢(2⁢y−1)n3+2⁢y⁢(y−1)⁢(2⁢y−1)3⁢n4,
(v)⁢Ωn,4⁢(y)=−2⁢y⁢(y−1)⁢(33⁢y2−33⁢y+5)3⁢n3+y⁡(y−1)⁢(177⁢y2−177⁢y+31)3⁢n4
+−y⁡(y−1)⁢(132⁢y2−132⁢y+23)3⁢n5+2⁢y⁢(y−1)⁢(6⁢y2−6⁢y+1)n6.

In particular Ωn,4⁢(y)=𝒪⁡(n−3) uniformly on [0,1].

Proof.

Using Ωn,m⁢(y)=∑j=0m(mj)⁢(−y)m−j⁢ℱn⁢(ej,y) and substituting the values of Section 2 for m≤3, and those of Section 2 for m=4, the results follow. Specifically, for m=2,

Ωn,2⁢(y) =ℱn⁢(e2,y)−2⁢y⁢ℱn⁢(e1,y)+y2⁢ℱn⁢(e0,y)
=(y2+y⁡(y−1)3⁢n2)−2⁢y2+y2=y⁡(y−1)3⁢n2,

and for m=4 the four displayed terms are obtained from the fourth moments of ℬ2⁢n, ℬn and 𝒵n recorded in Section 2. ∎

Lemma .

Let c∈ℝ and σ2=σ2⁢(y)=y⁡(1−y).

  1. (i)

    Expansions. For every k≥1

    ℬn⁢(ψy2⁢k,y)=(2⁢k−1)!!⁢σ2⁢knk+𝒪⁡(n−k−1),
    𝒵n⁢(ψy2⁢k,y)=2k⁢(2⁢k−1)!!⁢σ2⁢knk+𝒪⁡(n−k−1),

    and

    ℬn⁢(ψy2⁢k+1,y)=13⁢k⁢(2⁢k+1)!!⁢σ2⁢k⁢(1−2⁢y)nk+1+𝒪⁡(n−k−2),
    𝒵n⁢(ψy2⁢k+1,y)=5⋅2k−1⋅13⁢k⁢(2⁢k+1)!!⁢σ2⁢k⁢(1−2⁢y)nk+1+𝒪⁡(n−k−2),

    the corresponding expansions for ℬ2⁢n following on replacing n by 2⁢n, that is on dividing them by 2k and 2k+1 respectively.

  2. (ii)

    Even orders. For every k≥1

    Lc⁢(ψy2⁢k,y)=(2⁢k−1)!!⁢σ2⁢knk⁢κk⁢(c)+𝒪⁡(n−k−1),κk⁢(c)=2+2⁢c2k−(1+3⁢c)+c⁢ 2k,

    where κ1⁢(c)≡0, the second central moment being exact,

    Lc⁢(ψy2,y)=c⁢y⁢(y−1)⁢n−2,

    and where, for k≥2, κk⁢(c)=0 if and only if c=(2k−1)−1.

  3. (iii)

    Odd orders. For every k≥1

    Lc⁢(ψy2⁢k+1,y)=13⁢k⁢(2⁢k+1)!!⁢σ2⁢k⁢(1−2⁢y)nk+1⁢λk⁢(c)+𝒪⁡(n−k−2),
    λk⁢(c)=2+2⁢c2k+1−(1+3⁢c)+5⁢c⁢ 2k−1.

    Here λk⁢(c)=0 if and only if c=2⁢(2k−1)/(5⋅4k−6⋅2k+2).

  4. (iv)

    In particular, for ℱn=L1/3, Ωn,m⁢(y)=O⁡(n−⌈m/2⌉) for m≥2, the improved order O⁡(n−⌈m/2⌉−1) holding only for m∈{2,4}.

Proof.

The expansions. Let Tn,m⁢(y)=ℬn⁢(ψym,y); these satisfy the classical recurrence [13]

Tn,m+1⁢(y)=σ2n⁢[Tn,m′⁢(y)+m⁢Tn,m−1⁢(y)],Tn,0=1,Tn,1=0.

Induction on m shows that Tn,m is a polynomial in y all of whose coefficients are 𝒪⁡(n−⌈m/2⌉), so that differentiation does not change their order, and gives

Tn,2⁢k=(2⁢k−1)!!⁢σ2⁢knk+𝒪⁡(n−k−1),Tn,2⁢k+1=μk⁢σ2⁢k⁢(1−2⁢y)nk+1+𝒪⁡(n−k−2),

with μk=k⁡(2⁢k−1)!!+2⁢k⁢μk−1, that is μk=13⁢k⁢(2⁢k+1)!!; the base cases Tn,2=σ2⁢n−1 and Tn,3=σ2⁢(1−2⁢y)⁢n−2 are exact. Replacing n by 2⁢n gives the expansions for ℬ2⁢n, dividing them by 2k and 2k+1 respectively. For the iterate, write (t−y)m=∑j(mj)⁢(t−s)j⁢(s−y)m−j and apply the inner operator at s, then the outer one at y:

𝒵n(ψym;y)=∑j=0m(mj)ℬn((⋅−y)m−jTn,j(⋅);y).

Since Tn,j=𝒪⁡(n−⌈j/2⌉) and ℬn⁢(ψyi,y)=𝒪⁡(n−⌈i/2⌉), expanding Tn,j about y shows that the term of index j and Taylor order r is O⁡(n−⌈j/2⌉−⌈(m−j+r)/2⌉); this exponent is never below ⌈m/2⌉, and equality determines the terms that contribute at leading order. When m=2⁢k is even, replacing Tn,j⁢(s) by Tn,j⁢(y) suffices, as the Taylor correction Tn,j′⁢(y)⁢ℬn⁢(ψym−j+1,y) is one power of n smaller. When m=2⁢k+1 is odd, for each even index j=2⁢r the main term Tn,2⁢r⁢(y)⁢ℬn⁢(ψy2⁢k+1−2⁢r,y) and the Taylor derivative correction Tn,2⁢r′⁢(y)⁢ℬn⁢(ψy2⁢k+2−2⁢r,y) both contribute at the leading order 𝒪⁡(n−k−1). Summing these combined contributions over all indices yields the factor 2k for m=2⁢k and 5⋅2k−1 for m=2⁢k+1, completing the proof of (i); the cases m=2,3,4 of Section 2 confirm the factors 2, 5 and 4.

(ii). Substituting the three expansions into (3) and collecting the coefficient of (2⁢k−1)!!⁢σ2⁢k⁢n−k yields κk⁢(c). Multiplying κk⁢(c)=0 by 2k gives
c⁡(4k−3⋅2k+2)=2k−2, and since 4k−3⋅2k+2=(2k−1)⁢(2k−2) we obtain c=(2k−1)−1 for k≥2, both sides vanishing identically for k=1. There the moment is exact: by Section 2,

Lc⁢(ψy2,y)=σ2⁢[2+2⁢c2⁢n−1+3⁢cn+c⁢2⁢n−1n2]=−c⁢σ2n2=c⁢y⁢(y−1)n2.

(iii). The same substitution, with the factors 2−(k+1) and 5⋅2k−1 in place of 2−k and 2k, yields λk⁢(c); multiplying λk⁢(c)=0 by 2k+1 gives
c⁡(5⋅4k−6⋅2k+2)=2k+1−2, whence the root, the coefficient of c being positive. Section 2 confirms the case k=1, where λ1⁢(c)=12⁢(5⁢c−1).

(iv). By part (i) each of the three components of (4) has m-th central moment 𝒪⁡(n−⌈m/2⌉), so the triangle inequality gives Ωn,m=𝒪⁡(n−⌈m/2⌉) for every m≥2. For c=13 part (ii) gives κk=83⁢2−k−2+13⁢2k, so that κ1=κ2=0, κ3=1, κ4=72 and κk>0 for k≥3: the gain of one power of n occurs for m=2 and m=4 and fails from m=6 onwards. By part (iii), λ1⁢(13)=13≠0 and λk⁢(13)>0 for k≥1, so no odd moment gains a power. ∎

Remark .

Three consequences for the family (3).

(i) By Section 2(ii), Lc⁢(ψy2,y)=c⁢y⁢(y−1)⁢n−2 exactly, so 𝒬n=L0 is the only member reproducing e2 and the only one whose asymptotic error carries no φ′′ term; L1/5 and ℱn=L1/3 are the members singled out in the same way by the third and by the fourth moment.

(ii) No member is positive, 𝒬n included. For c>0 the second central moment is negative on (0,1); for c≤0 it is not, and one uses the fourth instead, Lc⁢(ψy4,y)=32⁢(3⁢c−1)⁢y2⁢(y−1)2⁢n−2+𝒪⁡(n−3) with 32⁢(3⁢c−1)≤−32. Consequently no Korovkin-type argument is available – convergence is obtained in Section 3 through the K-functional instead – and ℱn preserves neither monotonicity nor convexity.

(iii) Each member is nevertheless a combination of the positive operators ℬ2⁢n, ℬn and 𝒵n, so that

|Lc⁢(g,y)|≤|2+2⁢c|ℬ2⁢n⁢(|g|,y)+|1+3⁢c|ℬn⁢(|g|,y)+|c|𝒵n⁢(|g|,y),g∈C⁡[0,1],

and in particular |ℱn⁢(g,y)|≤83⁢ℬ2⁢n⁢(|g|,y)+2⁢ℬn⁢(|g|,y)+13⁢𝒵n⁢(|g|,y). 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 ℱn, then record in Section 3 the Taylor decomposition on which all the direct estimates rest. From it we deduce a direct estimate for φ∈C2⁢[0,1], the quantitative 𝒪⁡(n−2) estimate for φ∈C4⁢[0,1] with explicit constants, and a refinement of the latter in which the contribution of φ(4) is o⁡(n−2). We then give an estimate in a modified fourth-order K-functional and derive a Voronovskaja-type asymptotic formula for the whole family, from which the comparison between ℱn and Butzer’s operator 𝒬n follows explicitly.

Theorem 1.

The operators ℱn are uniformly bounded on C⁡[0,1]:

|ℱn⁢(φ,y)|≤5⁢‖φ‖(φ∈C⁡[0,1],y∈[0,1],n∈ℕ),

that is, ‖ℱn‖C→C≤5.

Proof.

By (4) and the triangle inequality,

|ℱn⁢(φ,y)| =|83⁢ℬ2⁢n⁢(φ,y)−2⁢ℬn⁢(φ,y)+13⁢𝒵n⁢(φ,y)|
≤83⁢|ℬ2⁢n⁢(φ,y)|+2⁢|ℬn⁢(φ,y)|+13⁢|𝒵n⁢(φ,y)|.

Each of ℬn, ℬ2⁢n and 𝒵n is a positive linear operator reproducing constants, so that

|ℬn⁢(φ,y)|≤‖φ‖,|ℬ2⁢n⁢(φ,y)|≤‖φ‖⁢and⁢|𝒵n⁢(φ,y)|≤‖φ‖.

Substituting these bounds back into the inequality:

|ℱn⁢(φ,y)| ≤|φ|(83+2+13)=5⁢‖φ‖.

∎

Lemma .

Let c∈ℝ, let r≥2 be even and φ∈Cr⁢[0,1]. Then, for every y∈[0,1],

(5) Łc⁢(φ,y)−φ⁡(y)=∑j=2rφ(j)⁢(y)j!⁢Lc⁢(ψyj,y)+Lc⁢(ψyr⁢εy,y),

where εy is defined for t≠y by

εy⁢(t)=ψy−r⁢(φ⁡(t)−∑j=0rψyjj!⁢φ(j)⁢(y)),εy⁢(y):=0.

Being a quotient of continuous functions away from t=y, and satisfying εy⁢(t)=1r!⁢(φ(r)⁢(ξt)−φ(r)⁢(y)) for some ξt between y and t, the function εy is continuous on the whole of [0,1] and |εy⁢(t)|≤1r!⁢ω⁢(φ(r),|t−y|). Moreover, with Cr a constant depending only on r and c,

(6) |Lc(ψyrεy;y)|≤Crnr/2ω(φ(r),n−1/2).
Proof.

Taylor’s formula with Lagrange remainder [19] gives φ⁡(t)= ∑j=0rψyjj!⁢φ(j)⁢(y)+ψyr⁢εy⁢(t) with εy as stated; applying Lc, which reproduces constants and linear functions yields (5).

For (6) put δ=n−1/2. From ω⁡(φ(r),λ⁢δ)≤(1+λ)⁢ω⁢(φ(r),δ),

|εy⁢(t)|≤ω⁡(φ(r),δ)r!⁢(1+|t−y|δ),

so that, 𝒜 denoting any of ℬ2⁢n, ℬn, 𝒵n and r being even,

𝒜⁡(ψyr⁢|εy|,y)≤ω⁡(φ(r),δ)r!⁢[𝒜⁡(ψyr,y)+δ−1⁢𝒜⁡(ψyr,y)⁢𝒜⁢(ψyr+2,y)],

by the Cauchy–Schwarz inequality [2] applied to |ψy|r+1=|ψy|r/2⋅|ψy|(r+2)/2. By Section 2(i) the two moments are 𝒪(n−r/2) and 𝒪(n−r/2−1), so the bracket is 𝒪(n−r/2)+n1/2𝒪(n−r/2−1/2)=𝒪(n−r/2). Passing to the three positive components (Section 2(iii)) gives (6). ∎

Theorem 2.

Let φ∈C2⁢[0,1]. Then, with C2 the constant of Section 3 for r=2 and c=13

|ℱn(φ;y)−φ(y)|≤‖φ′′‖24⁢n2+C2nω(φ′′,n−1/2),y∈[0,1],

ω denoting the modulus of continuity. In particular ‖ℱn⁢φ−φ‖=o⁡(n−1).

Proof.

Apply Section 3 with r=2: the sum in (5) reduces to 12⁢φ′′⁢(y)⁢Ωn,2⁢(y), and |Ωn,2⁢(y)|=|y⁡(y−1)|/(3⁢n2)≤1/(12⁢n2) by Section 2(iii), whence the first term. The second is ≤C2n−1ω(φ′′,n−1/2) by (6), and ω(φ′′,n−1/2)→0 gives the final assertion. ∎

Remark .

Neither of the two constants is sharp. The value 5 cannot be lowered to 1, a linear operator reproducing constants having norm 1 exactly when it is positive; but numerically ‖ℱn‖C→C stays below 1.77, and any sharpening of Theorem 1 improves the constant 6=1+5 of Theorem 5 in the same proportion. The rate o⁡(n−1) of Theorem 2 is likewise not 𝒪⁡(n−2): its second term is controlled only by the modulus of continuity of φ′′, and the order n−2 of Theorem 3 needs two further derivatives.

Theorem 3.

Let φ∈C4⁢[0,1] and n≥6. Then

‖ℱn⁢φ−φ‖≤1n2⁢(‖φ′′‖24+3⁢‖φ′′′‖324+‖φ(4)‖32).

In particular ‖ℱn⁢φ−φ‖=𝒪⁡(n−2) with explicit constants.

Proof.

Apply Section 3 with r=4,c=13 and recombine the last two terms of (5): since 124⁢ψy4⁢φ(4)⁢(y)+ψy4⁢εy=124⁢ψy4⁢φ(4)⁢(ξt)=:Ry⁢(t),

(7) ℱn⁢(φ,y)−φ⁡(y)=φ′′⁢(y)2⁢Ωn,2⁢(y)+φ′′′⁢(y)6⁢Ωn,3⁢(y)+ℱn⁢(Ry,y).

First term. As in Theorem 2, |Ωn,2⁢(y)|≤1/(12⁢n2).

Second term. By Section 2(iv), Ωn,3⁢(y)=y⁡(y−1)⁢(2⁢y−1)⁢n2−6⁢n+23⁢n4, and for n≥6 one has 0<n2−6⁢n+2≤n2, so that |Ωn,3⁢(y)|≤318⋅13⁢n2=354⁢n2, using maxy∈[0,1]⁡|y⁡(y−1)⁢(2⁢y−1)|=3/18.

Remainder. Since |Ry⁢(t)|≤‖φ(4)‖24⁢(t−y)4, Section 2(iii) gives

|ℱn⁢(Ry,y)|≤‖φ(4)‖24⁢Sn⁢(y),Sn⁢(y):=83⁢ℬ2⁢n⁢(ψy4,y)+2⁢ℬn⁢(ψy4,y)+13⁢𝒵n⁢(ψy4,y).

Substituting the fourth central moments of Section 2 and writing everything in terms of σ2=y⁡(1−y),

n2⁢Sn=σ4⁢(12−46n+59n2−44n3+12n4)+σ2n⁢(223−313⁢n+233⁢n2−2n3).

For n≥6 the negative terms of the two brackets are at most 46n+44n3<8 and 313⁢n+2n3<2, against the constants 12 and 223, so both are positive; hence n2⁢Sn increases with σ2 and attains its maximum at y=12:

n2⁢maxy∈[0,1]⁢Sn⁢(y)=34−2524⁢n+5348⁢n2−56⁢n3+14⁢n4≤34,

the inequality because 5348⁢n+14⁢n3<2524 for n≥6. Hence Sn≤34⁢n2 and |ℱn⁢(Ry,y)|≤‖φ(4)‖/(32⁢n2). Substituting the three estimates into (7) and taking the supremum over y∈[0,1] completes the proof. ∎

Remark .

The same proof applied to 𝒬n=L0 gives a better bound, and without the restriction n≥6: here 𝒬n⁢(ψy2,y)≡0 and 𝒬n(ψy3;y)=−y(y−1)(2y−1)/(2n2) exactly, and maxy⁡SnQ≤932⁢n−2 for SnQ:=2⁢ℬ2⁢n⁢(ψy4,y)+ℬn⁢(ψy4,y), so that

‖𝒬n⁢φ−φ‖≤1n2⁢(3⁢‖φ′′′‖216+3⁢‖φ(4)‖256).

Against the constants 124, 3324, 132 of Theorem 3, only the φ′′′ one favours ℱn: the φ′′ term is absent for 𝒬n, and its φ(4) constant is smaller by a factor 83. This is an artefact of the method, which estimates the remainder through Sn=12⁢σ4⁢n−2+𝒪⁡(n−3), larger than the 92⁢σ4⁢n−2 of 𝒬n, so that the cancellation Ωn,4=𝒪⁡(n−3) – the very reason for the choice c=13 – is invisible to it. The remedy is to split the remainder before estimating it, which is done in Theorem 4.

Theorem 4.

Let φ∈C4⁢[0,1] and n≥6. Then, with C4 the constant of Section 3 for r=4 and c=13

∥ℱnφ−φ∥≤1n2(‖φ′′‖24+3⁢‖φ′′′‖324)+‖φ(4)‖32⁢n3+C4n2ω(φ(4),n−1/2).

In particular the contribution of φ(4) to the error is o⁡(n−2).

Proof.

Apply Section 3 with r=4 and c=13, this time without recombining: the first two terms of (5) are bounded as in Theorem 3, and the last is ≤C4n−2ω(φ(4),n−1/2) by (6). For the third, write y⁡(y−1)=−σ2 in Section 2(v): the four polynomials in σ2 multiplying n−3,…,n−6 attain on [0,14] the maximum moduli 1324, 5348, 56, 14, all at σ2=14, so that bounding n−4,n−5,n−6 by n−3/6, n−3/36, n−3/216 for n≥6 gives

|Ωn,4⁢(y)|≤1n3⁢(1324+53288+5216+1864)=34⁢n3,

the same constant 34 as for Sn in Theorem 3, one power of n lower; the third term is therefore at most ‖φ(4)‖/(32⁢n3). ∎

The two bounds are not comparable at fixed n, the constant C4 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 𝒬n, whose fourth central moment is of the exact order n−2 (Section 3). Theorem 3, with its three explicit constants, is the one used in Theorem 5 below.

Definition .

For ϕ∈C4⁢[0,1] put

|ϕ|2,4:=‖ϕ′′‖+‖ϕ′′′‖+‖ϕ(4)‖.

For φ∈C⁡[0,1] and δ>0 we use the modified fourth-order K-functional

𝒦4⁢(φ,δ)=infϕ∈C4⁢[0,1]{‖φ−ϕ‖+δ|ϕ|2,4}.
Theorem 5.

Let φ∈C⁡[0,1] and n≥6. Then

‖φ−ℱn⁢φ‖≤ 6⁢𝒦4⁢(φ,1144⁢n2).
Proof.

Let ϕ∈C4⁢[0,1] be arbitrary. Writing
φ−ℱn⁢φ=(φ−ϕ)−ℱn⁢(φ−ϕ)+(ϕ−ℱn⁢ϕ) and using the linearity of ℱn,

‖φ−ℱn⁢φ‖≤‖φ−ϕ‖+‖ℱn⁢(φ−ϕ)‖+‖ϕ−ℱn⁢ϕ‖.

By Theorem 1, ‖ℱn⁢(φ−ϕ)‖≤5⁢‖φ−ϕ‖. By Theorem 3, the largest of the three constants being 124,

‖ϕ−ℱn⁢ϕ‖≤1n2⁢(‖ϕ′′‖24+3⁢‖ϕ′′′‖324+‖ϕ(4)‖32)≤|ϕ|2,424⁢n2.

Hence

‖φ−ℱn⁢φ‖≤6⁢‖φ−ϕ‖+|ϕ|2,424⁢n2=6⁢[‖φ−ϕ‖+1144⁢n2⁢|ϕ|2,4],

and taking the infimum over ϕ∈C4⁢[0,1] gives the claim by Section 3. ∎

Corollary .

For every φ∈C⁡[0,1],

limn→∞‖ℱn⁢φ−φ‖=0,

that is, ℱn⁢φ→φ uniformly on [0,1].

Proof.

Since C4⁢[0,1] is dense in C⁡[0,1], we have limδ→0+𝒦4⁢(φ,δ)=0 for every φ∈C⁡[0,1]. As (144⁢n2)−1→0, Theorem 5 gives the claim. ∎

Remark .

The functional of Section 3 is not Peetre’s K-functional for the pair (C,C4) [5], which carries ‖ϕ(4)‖ 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 C⁡(‖ϕ‖+‖ϕ(4)‖) on [0,1], so that 𝒦4⁢(φ,δ)≤C⁡(K~⁢(φ,δ)+δ⁢‖φ‖) with K~⁢(φ,δ)=infϕ∈C4⁢[0,1]{‖φ−ϕ‖+δ⁢‖ϕ(4)‖}; and by Johnen’s equivalence [5, 7], K~⁢(φ,t4)≍ω4⁢(φ,t). Hence

∥ℱnφ−φ∥≤C(ω4(φ,n−1/2)+n−2∥φ∥),

the classical direct estimate for combinations of order two. Theorems 1, 2, 3 and 5 hold, with comparable or better constants, for 𝒬n as well (Section 3); the difference between the two operators lies in Theorems 4, 6 and 3 alone.

Theorem 6.

Let c∈ℝ and φ∈C4⁢[0,1]. Then, for every y∈[0,1],

(8) limn→∞n2⁢(Lc⁢(φ,y)−φ⁡(y)) =c⁢y⁢(y−1)2⁢φ′′⁢(y)+(5⁢c−1)⁢y⁢(y−1)⁢(2⁢y−1)12⁢φ′′′⁢(y)
+(3⁢c−1)⁢y2⁢(y−1)216⁢φ(4)⁢(y).

The three coefficients vanish precisely for c=0, c=15 and c=13 respectively, and no value of c annihilates two of them.

Proof.

Apply Section 3 with r=4:

Lc⁢(φ,y)−φ⁡(y)=φ′′⁢(y)2⁢Lc⁢(ψy2,y)+φ′′′⁢(y)6⁢Lc⁢(ψy3,y)+φ(4)⁢(y)24⁢Lc⁢(ψy4,y)+Lc⁢(ψy4⁢εy,y).

By Section 2,

limn→∞n2⁢Lc⁢(ψy2,y)=c⁢y⁢(y−1),limn→∞n2⁢Lc⁢(ψy3,y)=(5⁢c−1)⁢y⁢(y−1)⁢(2⁢y−1)2,
limn→∞n2⁢Lc⁢(ψy4,y)=3⁢(3⁢c−1)⁢y2⁢(y−1)22,

the first being exact, and multiplying by n2 these three limits give the right-hand side of (8). The remaining term vanishes: by (6) with r=4,

n2|Lc(ψy4εy;y)|≤C4ω(φ(4),n−1/2)⟶0,

φ(4) being uniformly continuous on [0,1].

Finally, the three coefficients in (8) are affine in c with the distinct roots 0, 15 and 13, so that no value of c annihilates two of them. ∎

Corollary .

Let φ∈C4⁢[0,1] and y∈[0,1]. For the three distinguished members of (3),

(9) limn→∞n2⁢(ℱn⁢(φ,y)−φ⁡(y))=y⁡(y−1)6⁢φ′′⁢(y)+y⁢(y−1)⁢(2⁢y−1)18⁢φ′′′⁢(y),
limn→∞n2⁢(L1/5⁢φ−φ)⁢(y)=y⁡(y−1)10⁢φ′′⁢(y)−y2⁢(y−1)240⁢φ(4)⁢(y),
limn→∞n2⁢(𝒬n⁢φ−φ)⁢(y)=−y⁢(y−1)⁢(2⁢y−1)12⁢φ′′′⁢(y)−y2⁢(y−1)216⁢φ(4)⁢(y),

𝒬n=L0=2⁢ℬ2⁢n−ℬn being Butzer’s operator. Each of the three carries exactly two of the three derivatives: the asymptotic error of ℱn carries no φ(4) term, that of L1/5 no φ′′′ term, and that of 𝒬n no φ′′ term; correspondingly 𝒬n reproduces e2 and the other two do not (Section 2(i)).

Proof.

Put c=13, c=15 and c=0 in (8). ∎

4. Numerical examples

We test the operators on four functions,

φ1⁢(y)=sin2⁡(4⁢y)⁢cos2⁡(5⁢π⁢y),φ2⁢(y)=y⁡(1−y)⁢|y−12|,
φ3⁢(y)=ey,φ4⁢(y)=sin⁡(π⁢y),

the first oscillating rapidly, the second continuous with a corner, the third smooth, and the fourth the smooth function on which L1/5 is the best, and compare the three distinguished members L0=𝒬n, L1/5 and L1/3=ℱn with one another and with ℬ2⁢n. The Bernstein operator is taken at 2⁢n because the combinations read φ at the same 2⁢n+1 nodes, so that the four operators use the same data; their cost differs, 𝒵n requiring an 𝒪⁡(n2) precomputation of the inner values ℬn⁢(φ,k/n).

On the uniform grid yj=j/J, j=0,…,J, with J=20 000, in double precision, we measure

Max⁢E=maxj⁡|Ln⁢(φ,yj)−φ⁡(yj)|,Avg⁢E=1J+1⁢∑j=0J|Ln⁢(φ,yj)−φ⁡(yj)|,

and the empirical order of convergence

EOC=log2⁡(Max⁢En/2/Max⁢En),

each entry being placed in the column of the finer n; 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 L1 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 φ2 contributes to the sup norm at every n but occupies a shrinking set, so that Max E decays with order 12 and Avg E with order 1. The results are collected as follows. Tables 1 and 4 report the errors and the empirical orders for φ1,…,φ4 in turn. Figure 1 and Figure 3 show the four approximants for φ1 and φ2; for φ3 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 n in logarithmic scales, the guide lines carrying the slopes predicted by the theory: −1 and −2 for the smooth functions, −12 for φ2.

The rapidly oscillating φ1 is the function on which ℱn is at its best: its empirical order passes 2 while that of ℬ2⁢n is still below 1. An order above 2 is of course transient, all three combinations being of exact order n−2 on φ1∈C∞ by Theorem 6; it records that the asymptotic regime has not yet been reached, the quantity n2⁢Max⁢E still decreasing towards its limit for ℱn while it has nearly settled for 𝒬n. The member with the smaller asymptotic constant is the one that reaches its regime last, so that here a transient EOC above 2 is itself a sign of the cancellation of the φ(4) term.

n 40 80 160 320 640
ℬ2⁢n Max E 4.00⋅10−1 2.71⋅10−1 1.62⋅10−1 8.89⋅10−2 4.68⋅10−2
Avg E 9.83⋅10−2 6.59⋅10−2 3.92⋅10−2 2.15⋅10−2 1.13⋅10−2
EOC – 0.56 0.74 0.86 0.93
𝒬n Max E 2.92⋅10−1 1.42⋅10−1 5.25⋅10−2 1.63⋅10−2 4.57⋅10−3
Avg E 7.38⋅10−2 3.55⋅10−2 1.31⋅10−2 4.06⋅10−3 1.14⋅10−3
EOC – 1.04 1.43 1.69 1.84
L1/5 Max E 2.63⋅10−1 1.12⋅10−1 3.47⋅10−2 9.03⋅10−3 2.20⋅10−3
Avg E 6.66⋅10−2 2.80⋅10−2 8.64⋅10−3 2.24⋅10−3 5.44⋅10−4
EOC – 1.24 1.69 1.94 2.04
ℱn Max E 2.43⋅10−1 9.17⋅10−2 2.28⋅10−2 4.25⋅10−3 6.52⋅10−4
Avg E 6.20⋅10−2 2.33⋅10−2 5.75⋅10−3 1.04⋅10−3 1.55⋅10−4
EOC – 1.41 2.01 2.42 2.71
Table 1. Errors and empirical orders for φ1⁢(y)=sin2⁡(4⁢y)⁢cos2⁡(5⁢π⁢y).
Refer to caption
Figure 1. Approximation of φ1 by ℬ2⁢n, 𝒬n, L1/5 and ℱn at n=40, 160.
Refer to caption
Figure 2. Maximum error against n in logarithmic scales for φ1; the guide lines have slopes −1 and −2.

The corner of φ2 costs every operator its order: all four decay like n−1/2 in the sup norm, and only a constant factor separates the three combinations.

n 40 80 160 320 640
ℬ2⁢n Max E 1.08⋅10−2 7.77⋅10−3 5.54⋅10−3 3.93⋅10−3 2.78⋅10−3
Avg E 1.73⋅10−3 9.07⋅10−4 4.67⋅10−4 2.38⋅10−4 1.20⋅10−4
EOC – 0.48 0.49 0.49 0.50
𝒬n Max E 6.79⋅10−3 4.71⋅10−3 3.30⋅10−3 2.32⋅10−3 1.64⋅10−3
Avg E 4.45⋅10−4 2.20⋅10−4 1.09⋅10−4 5.46⋅10−5 2.73⋅10−5
EOC – 0.53 0.51 0.51 0.50
L1/5 Max E 6.20⋅10−3 4.31⋅10−3 3.02⋅10−3 2.13⋅10−3 1.50⋅10−3
Avg E 3.80⋅10−4 1.91⋅10−4 9.54⋅10−5 4.77⋅10−5 2.38⋅10−5
EOC – 0.53 0.51 0.51 0.50
ℱn Max E 5.81⋅10−3 4.04⋅10−3 2.84⋅10−3 2.00⋅10−3 1.41⋅10−3
Avg E 3.79⋅10−4 1.88⋅10−4 9.30⋅10−5 4.62⋅10−5 2.30⋅10−5
EOC – 0.52 0.51 0.51 0.50
Table 2. Errors and empirical orders for φ2⁢(y)=y⁡(1−y)⁢|y−12|.
Refer to caption
Figure 3. Approximation of φ2 by ℬ2⁢n, 𝒬n, L1/5 and ℱn at n=40,160.
Refer to caption
Figure 4. Maximum error against n in logarithmic scales for φ2; the guide line has slope −12.

On the smooth φ3 the three combinations all reach the order n−2, and their ranking is the reverse of the one on φ1.

n 40 80 160 320 640
ℬ2⁢n Max E 2.74⋅10−3 1.37⋅10−3 6.84⋅10−4 3.42⋅10−4 1.71⋅10−4
Avg E 1.76⋅10−3 8.80⋅10−4 4.40⋅10−4 2.20⋅10−4 1.10⋅10−4
EOC – 1.00 1.00 1.00 1.00
𝒬n Max E 9.39⋅10−6 2.35⋅10−6 5.87⋅10−7 1.47⋅10−7 3.67⋅10−8
Avg E 5.63⋅10−6 1.41⋅10−6 3.52⋅10−7 8.80⋅10−8 2.20⋅10−8
EOC – 2.00 2.00 2.00 2.00
L1/5 Max E 2.90⋅10−5 7.25⋅10−6 1.81⋅10−6 4.53⋅10−7 1.13⋅10−7
Avg E 1.85⋅10−5 4.62⋅10−6 1.16⋅10−6 2.89⋅10−7 7.22⋅10−8
EOC – 2.00 2.00 2.00 2.00
ℱn Max E 4.98⋅10−5 1.25⋅10−5 3.13⋅10−6 7.82⋅10−7 1.96⋅10−7
Avg E 3.04⋅10−5 7.58⋅10−6 1.90⋅10−6 4.74⋅10−7 1.18⋅10−7
EOC – 2.00 2.00 2.00 2.00
Table 3. Errors and empirical orders for φ3⁢(y)=ey.
Refer to caption
Figure 5. Pointwise absolute errors of ℬ2⁢n, 𝒬n, L1/5 and ℱn for φ3 at n=160, on a logarithmic vertical scale.
Refer to caption
Figure 6. Maximum error against n in logarithmic scales for φ3; the guide lines have slopes −1 and −2.

On φ4 the member selected by the third central moment, L1/5, is the best of the three.

n 40 80 160 320 640
ℬ2⁢n Max E 1.53⋅10−2 7.68⋅10−3 3.85⋅10−3 1.93⋅10−3 9.63⋅10−4
Avg E 7.94⋅10−3 3.97⋅10−3 1.99⋅10−3 9.94⋅10−4 4.97⋅10−4
EOC – 0.99 1.00 1.00 1.00
𝒬n Max E 2.28⋅10−4 5.83⋅10−5 1.47⋅10−5 3.70⋅10−6 9.27⋅10−7
Avg E 1.03⋅10−4 2.62⋅10−5 6.60⋅10−6 1.66⋅10−6 4.15⋅10−7
EOC – 1.97 1.99 1.99 2.00
L1/5 Max E 4.98⋅10−5 1.28⋅10−5 3.39⋅10−6 8.85⋅10−7 2.26⋅10−7
Avg E 3.66⋅10−5 9.21⋅10−6 2.31⋅10−6 5.80⋅10−7 1.45⋅10−7
EOC – 1.96 1.92 1.94 1.97
ℱn Max E 2.21⋅10−4 5.96⋅10−5 1.55⋅10−5 3.94⋅10−6 9.94⋅10−7
Avg E 9.70⋅10−5 2.55⋅10−5 6.56⋅10−6 1.66⋅10−6 4.19⋅10−7
EOC – 1.89 1.95 1.97 1.99
Table 4. Errors and empirical orders for φ4⁢(y)=sin⁡(π⁢y).
Refer to caption

Maximum error against n in logarithmic scales for φ4; the guide line has slope −2

Figure 7. Maximum error for φ4.

ℱn 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 φ1, whose fourth derivative is large relative to its second, the first difference decides and ℱn wins; on φ3, whose derivatives are of comparable size, the second decides and 𝒬n wins. The observed factors are the predicted ones: the ratios 4.98⋅10−5/9.39⋅10−6=5.30 and 2.90⋅10−5/9.39⋅10−6=3.09 of Table 3 agree with the ratios 5.33 and 3.08 of the corresponding asymptotic constants of (8). The formula itself is confirmed at three values of c at once: on φ4, n2⁢Max⁢E at n=640 equals 0.380, 0.093 and 0.407 for 𝒬n, L1/5 and ℱn, against 0.381, 0.095 and 0.411 for maxy of the modulus of the constant that (8) gives at c=0, c=15 and c=13, the deviation falling like n−1. On φ2 no operator reaches the order n−2, the missing smoothness leaving only a constant factor between them.

Nor is ℱn the best member of (3) on every function: on φ4 the member selected by the third central moment, L1/5, 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 ℱn precisely when φ(4) dominates.

5. Conclusion

The family (3) is what the two requirements – preservation of constants and the vanishing of the 𝒪⁡(n−1) term of the second central moment – leave free. Every member has approximation order 𝒪⁡(n−2), an order already available from Butzer’s operator 𝒬n=L0, 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 L0=𝒬n, L1/5 and L1/3=ℱn, the first classical and the other two new. For the third we proved a uniform bound, direct estimates of order o⁡(n−1) for φ∈C2⁢[0,1] and n−2 for φ∈C4⁢[0,1] with explicit constants, a refinement of the latter in which the contribution of φ(4) is o⁡(n−2), an estimate in a modified fourth-order K-functional, uniform convergence on C⁡[0,1], 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 𝒬n as well, with comparable or better constants, and the sole quantitative exception is Theorem 4, whose o⁡(n−2) gain rests on the cancellation Ωn,4=𝒪⁡(n−3) and has no counterpart for 𝒬n. No member is positive either, so that the shape-preserving properties of ℬn 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 ℱn precisely when φ(4) 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 m=5 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