Some Probabilistic Generalizations of the Cheney–Sharma and Bernstein Approximation Operators

: The objective of this paper is to give some probabilistic derivations of the Cheney, Sharma, and Bernstein approximation operators. Motivated by these probabilistic derivations, generalizations of the Cheney, Sharma, and Bernstein operators are deﬁned. The convergence property of the Bernstein generalization is established. It is also shown that the Cheney–Sharma operator is the Sz á sz–Mirakyan operator averaged by a certain probability distribution.


Introduction
Polynomial operators for the approximation of a function have been researched extensively due to the important Weierstrass Approximation Theorem.This theorem states that every continuous function defined on a closed interval can be approximated by a polynomial function.For the approximation of functions, linear positive operators are used because they are computationally simpler.A fundamental operator is the Bernstein operator, defined as follows.
The Bernstein operator of order n, defined on C[0,1], is given by where f is any real function defined on [0, 1], and b n,k (x) is the binomial probability mass function (pmf).
The quantity b n,k (x) is also known as the Bernstein basis function.
By starting with the identity (see [1,2]) Axioms 2022, 11, 537.https://doi.org/10.3390/axioms11100537https://www.mdpi.com/journal/axiomsCheney and Sharma [3] defined the operator P n by where t ≤ 0, 0 ≤ x ≤ 1 and n > −1, and L (n) k (t) is the Laguerre polynomial of degree k.The operator P n of Cheney and Sharma corresponds to the pmf which is nonnegative since t ≤ 0 and normalized by virtue of (3).When t = 0, Equation ( 5) reduces to the negative binomial pmf Then, (4) becomes the Meyer-Konig-Zeller operator: The probabilistic approach to studying approximation operators, in particular, the Cheney-Sharma operator, has been considered, among others, by [4,5].Cismasiu [6] considered a probabilistic representation of the Szász-Inverse Beta operators.The generalization and construction of approximation operators are still of continuing interest.The main reason for this is that the modified or generalized operators give an improved approximation compared to the original operator.The classic Bernstein operator has been modified and studied by many researchers; see [7][8][9][10].Some examples of exotic operators are the parametric generalization of Schurer-Kantorovich operators and their bivariate form [11], Baskakov-Schurer-Szász-Stancu operators [12], and Szász-Mirakjan Beta-type operators [13].In this paper, the probabilistic approach is employed to obtain generalizations of Bernstein and other approximation operators.The motivation for considering this approach is that it provides a systematic method to construct and generalize approximation operators, and the probabilistic setting ensures the positivity of the operators.
In Section 2, we give a probabilistic representation and derivation of the Cheney-Sharma operator.By applying this probabilistic representation to the Bernstein operator (1), we define in Section 3 a generalization of the Bernstein operator (1).The convergence property of this generalization is examined.Further generalizations are also given.Section 4 presents another probabilistic representation of the Cheney-Sharma operator.The Cheney-Sharma operator could also be obtained by averaging the Szász-Mirakyan operator, and this is given in Section 5. Graphical analysis for the generalization of the Bernstein operator is given in Section 6. Section 7 concludes with some remarks.

A Probabilistic Representation and Derivation of the Cheney-Sharma Operator
Let N = {N(λ); λ ≥ 0} be a Poisson process, where N(λ) has the pmf given by Let M = {M(x; β + i); β ≥ 0, 0 < x < 1} be a negative binomial process, with pmf (6) written as a pmf conditional on i: Consider the process P(x; β) = {M(x; β + N(λ)); λ ≥ 0}, where i varies as a random variable N(λ).This process has pmf given by (5).To see this, consider the unconditional pmf: where (β) k = Γ(β+k) Γ(β) .Equation ( 8) is seen as the pmf corresponding to the Cheney-Sharma operator given by ( 5) with t = −λ(1 − x).To arrive at Equation (8), we have made use of Kummer's transformation: and the hypergeometric definition of the generalized Laguerre polynomials: By applying the above stochastic formulation to the Meyer-Konig-Zeller operator (7), the Cheney-Sharma operator is obtained.Remark 1.It is obvious that various generalizations of (6) (and (5)) could be obtained by different choices of the random variable for i.This will then lead to more generalized definitions of the Meyer-Konig-Zeller operator.
The following theorem considers the convergence property of the operator Q n,λ .

Another Probabilistic Representation of the Cheney-Sharma Operator
Let the logarithmic-series (log-series) distribution [18] with a parameter θ be defined by where 0 < θ < 1 and α = −[ln(1 − θ)] −1 .We wish to consider a weighted version of the log-series distribution.
Definition.Let Xbe a random variable with pmf p(k).Suppose that the probability of ascertaining the event {X = k} has a weighting factor w(k).Then, the weighted distribution [19] with the weight w(x) has pmf given by Let w(x) = k + τ, τ ≥ 0 be the weight for log-series distribution.The weighted log-series distribution has pmf given by Suppose that L n (τ; θ) = X 1 + X 2 + X 3 + . . .+ X n , where X i , i = 1, 2, . . .., n have pmf (21), that is, L n (τ; θ) is the convolution of n weighted log-series random variables.
Proof.It is simpler to prove the result by using a probability-generating function (pgf).The pgf of the log-series distribution is given by It follows that the pgf of the weighted log-series distribution is given by The pgf of the n-convolution is g(t; θ, τ) n .The unconditional pgf with n as a Poisson random variable N(λ) is given by By applying the generating function (see [2] (pp.84) and [15]): the pmf (22) is obtained.This is the pmf corresponding to the Cheney-Sharma operator.

Cheney-Sharma Operator as Average of Szász-Mirakyan Operator
Consider the operator given by where g(u; x) is a probability density function (pdf), and S n ( f ; u) is the Szász-Mirakyan operator (see [20] (p.553)) By rewriting (23) as follows: the integral in braces may be thought of as the counting distribution P k (t) of a mixed Poisson process with the mixing distribution g(u; x): (see [21] (pp.35-36)).
Clearly, various generalizations of the Szász-Mirakyan operator could be obtained by appropriate choices of g(u; x).In particular, if is the pdf of the Bessel function distribution of Laha [22], then R n is the Cheney-Sharma operator (4).
Theorem 4. If g(u; a) is given by (25), then the operator R n ( f ; a) is given by Proof.To prove (26), we note from ( 24) that we only need to evaluate the following integral: We thus obtain by using the following result [23]: where Re α 2 + ν 2 > 0, with the following substitution: By applying Kummer's transformation, Equation ( 9), and the definition of the generalized Laguerre polynomial (10), we obtain This is the Cheney-Sharma operator P n given by ( 4), if in Equation ( 26) we set x = 1 1+a , t = − aλ 1+a , and replace k n by k k+n .
Remark 2. (i) The sequence of operators R n ( f ; x) converges uniformly to f (x This follows from Korovkin's theorem and (ii) Adell et al. [24] gave a probabilistic representation of the Cheney-Sharma operator in terms of a suitable multi-indexed stochastic process.This is to facilitate proof of convergence and to show that it preserves monotonicity and global smoothness.
(iii) The pmf in the Cheney-Sharma operator arises from a photon and neural counting model; see [25] and references therein.
The maximum error of approximation for Q n,λ ( f ; y) to the function f (y) over the interval [0, 0.9] for different values of λ and n are tabulated in Table 1.It is apparent from these results that the convergence of the operator Q n,λ ( f ; y) is better when λ/n is smaller.
Next, we examined the approximation to the function f (y) = y − 1  2 gives the maximum error of approximation for Q n,λ ( f ; y) to the function f (y) over the interval [0, 0.99] for different values of λ and n.The smallest maximum error of approximation is obtained by taking λ = 0.25 and n = 60.This combination yields the smallest ratio of λ/n shown in Table 2.The maximum error of approximation for  , (; ) to the function () over the interval [0, 0.9] for different values of  and  are tabulated in Table 1.It is apparent from these results that the convergence of the operator  , (; ) is better when / is smaller.) ( −

Concluding Remarks
In this paper, we have given probabilistic representations of some well-known approximation operators.By extending these probabilistic formulations, generalizations of these approximation operators have been obtained.This probabilistic approach will ensure the positivity of the approximation operators and facilitate the derivation of the moments to prove uniform convergence based on the Korovkin Theorem [14].This approach also establishes the probabilistic connection between different approximation operators; for instance, the Cheney-Sharma operator as a probabilistic average of the Szász-Mirakyan operator.Further extension of the Cheney-Sharma operator using this averaging process can be constructed by using the results in [27].

Table 1 .
Maximum error of approximation by  , (; ) for different values of  and  over the interval [0, 0.9].
Next, we examined the approximation to the function () = ( − 1 2

Table 1 .
Maximum error of approximation by Q n,λ ( f ; y) for different values of λ and n over the interval [0, 0.9].

Table 2 .
Maximum error of approximation by  , (; ) for different values of  and  over the interval [0, 0.99].

Table 2 .
Maximum error of approximation by Q n,λ ( f ; y) for different values of λ and n over the interval [0, 0.99].