Next Article in Journal
Distance Antimagic Product Graphs
Previous Article in Journal
Hopf Bifurcation and Control of a Fractional-Order Delay Stage Structure Prey-Predator Model with Two Fear Effects and Prey Refuge
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Generalization of Szasz Operators by Using the Appell Polynomials of Class A(2)

Department of Mathematics, Faculty of Science, Ankara University, Ankara TR-06100, Turkey
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(7), 1410; https://doi.org/10.3390/sym14071410
Submission received: 6 June 2022 / Revised: 28 June 2022 / Accepted: 7 July 2022 / Published: 9 July 2022

Abstract

:
In this paper, as a generalization of Szasz operators, a brand-new sequence of operators including the Appell polynomials of class A 2 is introduced. First, the convergence of this new sequence of operators is obtained, and then, some approximation results are presented by using the tools of approximation theory. In addition, an explicit example for this kind of sequence of operators containing Gould–Hopper polynomials is introduced. The error of the approximation of this new sequence of operators to a function is established.

1. Introduction

Szasz operators [1] are extensions of Bernstein operators to infinite intervals, and these operators play a very important role in the field of approximation theory. The generalizations of Szasz operators by using polynomials, especially defined via generating functions, have been frequently studied lately. These kinds of generalizations provide a range of new sequences of operators to approximation theory. Jakimovski and Leviatan [2] presented a generalization of Szasz operators via Appell polynomials. Let g z = k = 0 a k z k a 0 0 be an analytic function in the disc z < R R > 1 and g 1 0 . The Appell polynomials p k x have generating functions of the following form:
g u e u x = k = 0 p k x u k .
Under the restriction p k x 0 for x 0 , , Jakimovski and Leviatan constructed the linear positive operators P n f ; x by
P n f ; x : = e n x g 1 k = 0 p k n x f k n , for n N
and obtained the approximation properties of this sequence of operators. Then, Ismail [3] defined another generalization of Szasz operators and also Jakimovski and Leviatan operators through the instrument of Sheffer polynomials. Let A z = k = 0 a k z k a 0 0 and H z = k = 1 h k z k h 1 0 be analytic functions in the disc z < R R > 1 , where a k and h k are real. The Sheffer polynomials p k x have generating functions of the type
A t e x H t = k = 0 p k x t k , t < R .
With the help of following restrictions
i for x 0 , , p k x 0 , i i A 1 0 and H 1 = 1 ,
Ismail investigated the convergence properties of linear positive operators given by
L n f ; x : = e n x H 1 A 1 k = 0 p k n x f k n , for n N .
One can find more generalizations of Szasz operators using similar methods in the literature [4,5,6,7,8,9,10,11,12].
In this contribution, we introduce a brand-new generalization of Szasz operators with the help of the Appell polynomials of class A 2 defined by Kazmin [13]. The Appell polynomials p k x of class A 2 are given by the following generating function:
A t e x t + B t e x t = k = 0 p k x t k
where
A t = k = 0 a k k ! t k and B t = k = 0 b k k ! t k
are formal power series defined at the disc z < R R > 1 with a 0 2 b 0 2 0 . Hermite polynomials, Bernoulli polynomials and Euler polynomials are examples of these types of polynomials. By using Appell polynomials of class A 2 given by (1), we define the sequence of operators for x 0 ,
T n f ; x = 1 A 1 e n x + B 1 e n x k = 0 p k n x f k n
with the restrictions A 1 > 0 , B 1 0 and p k x > 0 for all k = 0 , 1 , . These restrictions assure us of the positivity of the sequence of operators in (2). Note that for the special case A t = 1 and B t = 0 , we discover the well-known Szasz operators again.
Some numerical examples involving special kinds of orthogonal polynomials such as Gould–Hopper polynomials can be constructed by using the sequence of operators in (2). Moreover, one can derive other sequences of operators by choosing A t and B t from (1) in view of the restrictions A 1 > 0 , B 1 0 and p k x > 0 for all k = 0 , 1 , . These operators can be used in applications of computer simulations, in data science, in speech analysis problems and also in image processing. In this paper, first, the convergence properties of the sequence of operators in (2) are studied. Then, some estimations for approximation results are obtained by using the modulus of continuity, Lipschitz class functions and the second-order modulus of continuity. Finally, a numerical example is presented.

2. Convergence of the Operators and Some Approximation Results

Let us first obtain some equalities. We will use these equalities further.
Lemma 1.
T n 1 ; x = 1 , T n ξ ; x = A 1 e n x B 1 e n x A 1 e n x + B 1 e n x x + A 1 e n x + B 1 e n x n A 1 e n x + B 1 e n x , T n ξ 2 ; x = x 2 + x n 2 A 1 + A 1 e n x 2 B 1 + B 1 e n x A 1 e n x + B 1 e n x + A 1 + A 1 e n x + B 1 + B 1 e n x n 2 A 1 e n x + B 1 e n x .
Proof. 
By taking t = 1 and n x instead of x in (1), we obtain
A 1 e n x + B 1 e n x = k = 0 p k n x .
This provides us with the following:
T n 1 ; x = 1 A 1 e n x + B 1 e n x k = 0 p k n x = 1 .
First taking the derivative of both sides of (1) with respect to t and then using above approach, t = 1 and n x instead of x, leads to
k = 0 k p k n x = n x A 1 e n x B 1 e n x + A 1 e n x + B 1 e n x .
Thus, we have
T n ξ ; x = 1 n A 1 e n x + B 1 e n x k = 0 k p k n x = A 1 e n x B 1 e n x A 1 e n x + B 1 e n x x + A 1 e n x + B 1 e n x n A 1 e n x + B 1 e n x .
Applying the second derivative to (1) with respect to t gives
k = 0 k 2 k p k x t k 2 = A t + x A t e x t + A t + x A t x e x t + B t x B t e x t + B t x B t x e x t .
We conclude the following equality in view of t = 1 , n x instead of x and (3):
k = 0 k 2 p k n x = n 2 x 2 A 1 e n x + B 1 e n x + n x 2 A 1 + A 1 e n x 2 B 1 + B 1 e n x + A 1 + A 1 e n x + B 1 + B 1 e n x .
Hence, we obtain
T n ξ 2 ; x = 1 n 2 A 1 e n x + B 1 e n x k = 0 k 2 p k n x = x 2 + x n 2 A 1 + A 1 e n x 2 B 1 + B 1 e n x A 1 e n x + B 1 e n x + A 1 + A 1 e n x + B 1 + B 1 e n x n 2 A 1 e n x + B 1 e n x .
Lemma 2.
T n ξ x ; x = 2 B 1 e n x A 1 e n x + B 1 e n x x + A 1 e n x + B 1 e n x n A 1 e n x + B 1 e n x , T n ξ x 2 ; x = x 2 4 B 1 e n x A 1 e n x + B 1 e n x + x n A 1 e n x 4 B 1 + B 1 e n x A 1 e n x + B 1 e n x + A 1 + A 1 e n x + B 1 + B 1 e n x n 2 A 1 e n x + B 1 e n x .
Proof. 
The above identities can easily be found from the following equalities:
T n ξ x ; x = T n ξ ; x x T n 1 ; x ,
T n ξ x 2 ; x = T n ξ 2 ; x 2 x T n ξ ; x + x 2 T n 1 ; x .
Now, we are able to prove our main theorem.
Theorem 1.
Let f be continuous on 0 , and belong to the class
E = f : f x 1 + x 2 is convergent when x .
Then, the sequence of operators in (2) converges uniformly on the compact subsets of the interval 0 , , i.e.,
lim n T n f ; x = f x .
Proof. 
By using Lemma 1, we obtain
lim n T n ξ i ; x = x i , i = 0 , 1 , 2 .
These convergences are satisfied uniformly on the compact subsets of the interval 0 , . Hence, the proof is provided by the universal Korovkin theorem [14]. □
From now on, we represent the approximation results.
Theorem 2.
T n f ; x f x 2 ω f ; T n ξ x 2 ; x ,
where ω is the modulus of continuity of the function f [15] defined by
ω f ; δ : = sup x , y 0 , x y δ f x f y
and f is uniform continuous on the interval 0 , .
Proof. 
Using the well-known property of ω f ; δ and the triangle inequality gives us
T n f ; x f x = 1 A 1 e n x + B 1 e n x k = 0 p k n x f k n f x 1 A 1 e n x + B 1 e n x k = 0 p k n x f k n f x 1 A 1 e n x + B 1 e n x k = 0 p k n x 1 + 1 δ k n x ω f ; δ = 1 + 1 δ 1 A 1 e n x + B 1 e n x k = 0 p k n x k n x ω f ; δ .
Considering the Cauchy–Schwarz inequality leads us to
k = 0 p k n x k n x = k = 0 p k n x p k n x k n x k = 0 p k n x 1 / 2 k = 0 p k n x k n x 2 1 / 2 = A 1 e n x + B 1 e n x T n ξ x 2 ; x 1 / 2 .
If we substitute the last inequality into (4), we have
T n f ; x f x 1 + 1 δ T n ξ x 2 ; x 1 / 2 ω f ; δ .
Here, by choosing
δ = T n ξ x 2 ; x 1 / 2 ,
we obtain the desired result. □
Now, for 0 < γ 1 and ξ 1 , ξ 2 0 , , let us introduce the following class of functions:
L i p M γ = φ : φ ξ 1 φ ξ 2 M ξ 1 ξ 2 γ .
Theorem 3.
Assume that φ L i p M γ . Then,
T n φ ; x φ x M T n ξ x 2 ; x γ 2 .
Proof. 
Since φ L i p M γ , we obtain
T n φ ; x φ x = T n φ ξ φ x ; x T n φ ξ φ x ; x M T n ξ x γ ; x .
If we use the Hölder inequality at the right-hand side of the inequality in (5), we obtain
T n ξ x γ ; x = 1 A 1 e n x + B 1 e n x k = 0 p k n x k n x γ = 1 A 1 e n x + B 1 e n x k = 0 p k n x 2 γ 2 p k n x γ 2 k n x γ 1 A 1 e n x + B 1 e n x × A 1 e n x + B 1 e n x 2 γ 2 1 A 1 e n x + B 1 e n x k = 0 p k n x 2 γ 2 × A 1 e n x + B 1 e n x γ 2 1 A 1 e n x + B 1 e n x k = 0 p k n x k n x 2 γ 2 = T n 1 ; x 2 γ 2 T n ξ x 2 ; x γ 2 .
Thus, we prove the desired result. □
Let us first introduce Rasa’s result and the second-order Steklov function, which are used in the following theorem.
Let z C 2 0 , a and L n n 0 be a sequence of linear positive operators with the property L n e 0 ; x = e 0 x , e i ξ = ξ i , i 0 , 1 , 2 . Then, Rasa’s result [16] is known as
L n z ; x z x z L n ξ x 2 ; x + 1 2 z L n ξ x 2 ; x .
For f C a , b , the second-order Steklov function of f [17] is defined by
f h x : = 1 h h h 1 t h f h ; x + t d t , x a , b ,
where f h ; . : a h , b + h R , h > 0 by
f h ; x = P x ; a h x a f x ; a x b P + x ; b < x b + h
and P , P + are the linear best approximations to f on the indicated intervals.
Theorem 4.
Suppose that φ is a continuous function on 0 , . Then, we have
T n φ ; x φ x 3 2 1 + a 2 + h 2 2 ω 2 φ ; h + 2 h 2 a φ .
Here, ω 2 is the second-order modulus of continuity of the function φ [15] defined by
ω 2 φ ; δ : = sup 0 < t δ φ . + 2 t 2 φ . + t + φ . .
Proof. 
By using some simple computations, it becomes
T n φ ; x φ x T n φ φ h ; x + T n φ h ; x φ h x + φ h x φ x 2 φ φ h + T n φ h ; x φ h x ,
where φ h is the second-order Steklov function of φ . In view of the fact that φ h C 2 0 , a , Rasa’s result given above and the Landau inequality, we derive
T n φ h ; x φ h x φ h T n ξ x 2 ; x + 1 2 φ h T n ξ x 2 ; x 2 a φ h + a 2 φ h T n ξ x 2 ; x + 1 2 φ h T n ξ x 2 ; x 2 a φ + 3 a 4 h 2 ω 2 φ ; h T n ξ x 2 ; x + 3 4 h 2 ω 2 φ ; h T n ξ x 2 ; x .
The following relation between the second-order Steklov function and ω 2 φ ; h was given by Zhuk [17]
φ φ h 3 4 ω 2 φ ; h .
If we substitute this inequality and (7) into (6), we obtain
T n φ ; x φ x 3 2 ω 2 φ ; h + 2 a φ + 3 a 4 h 2 ω 2 φ ; h T n ξ x 2 ; x + 3 4 h 2 ω 2 φ ; h T n ξ x 2 ; x .
Thus, we obtain the desired result by choosing h = T n ξ x 2 ; x 4 . □

3. Numerical Example

Gould–Hopper polynomials [18] have generating functions of the form
e h t d + 1 exp x t = k = 0 g k d + 1 x , h t k k !
and the explicit representations can be given by
g k d + 1 x , h = s = 0 k d + 1 k ! s ! k d + 1 s ! h s x k d + 1 s .
Gould–Hopper polynomials g k d + 1 x , h are d-orthogonal polynomial sets of Hermite type [19]. Van Iseghem [20] and Maroni [21] discovered the notion of d-orthogonality. Gould–Hopper polynomials are the Appell polynomials of class A 2 by choosing
A t = e h t d + 1 , B t = 0 .
Under the assumption h 0 , the restrictions A 1 > 0 , B 1 0 and p k x > 0 for all k = 0 , 1 , are satisfied. With the help of the generating functions in (8), we obtain the explicit form of the sequence of operators involving Gould–Hopper polynomials T n * by
T n * f ; x = e n x h k = 0 g k d + 1 n x , h k ! f k n
where x 0 , . The error of the approximation of the function f x = x 2 1 + x 2 by using the sequence of operators involving Gould–Hopper polynomials T n * is presented in Table 1. Each of the estimates depending on the parameter h and the special case d = 3 is listed in the following table as follows:

4. Concluding Remarks

In this contribution, we present a generalization of Szasz operators by using the Appell polynomials of class A 2 . The convergence properties and approximation results of the sequence of operators in (2) are obtained. In addition, a numerical example is given by using Gould–Hopper polynomials.
In further studies, a new sequence of operators which is a generalization of the sequence of operators in (2) can be investigated. For example, one can construct a Kantorovich generalization of the sequence of operators in (2) for the approximation of integrable functions. In addition, this type of sequence of operators can impact various scientific fields.

Author Contributions

Investigation, S.V. and S.S.; writing—review and editing, S.V. and S.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Szasz, O. Generalization of S. Bernstein’s polynomials to the infinite interval. J. Res. Nat. Bur. Stand. 1950, 45, 239–245. [Google Scholar] [CrossRef]
  2. Jakimovski, A.; Leviatan, D. Generalized Szasz operators for the approximation in the infinite interval. Mathematica 1969, 11, 97–103. [Google Scholar]
  3. Ismail, M.E.H. On a generalization of Szász operators. Mathematica 1974, 39, 259–267. [Google Scholar]
  4. Aktaş, R.; Çekim, B.; Taşdelen, F. A Dunkl analogue of operators including two-variable Hermite polynomials. Bull. Malaysian Math. Sci. Soc. 2019, 42, 2795–2805. [Google Scholar] [CrossRef] [Green Version]
  5. Cai, Q.B.; Çekim, B.; İçöz, G. Gamma generalization operators involving analytic functions. Mathematics 2021, 9, 1547. [Google Scholar] [CrossRef]
  6. Çekim, B.; Aktaş, R.; Taşdelen, F. A Dunkl-Gamma type operator in terms of generalization of two-variable Hermite polynomials. Indian J. Pure Appl. Math. 2021, 1–9. [Google Scholar] [CrossRef]
  7. İçöz, G.; Varma, S.; Sucu, S. Approximation by operators including generalized Appell polynomials. Filomat 2016, 30, 429–440. [Google Scholar] [CrossRef]
  8. Gupta, P.; Acu, A.M.; Agrawal, P.N. Jakimovski–Leviatan operators of Kantorovich type involving multiple Appell polynomials. Georgian Math. J. 2021, 28, 73–82. [Google Scholar] [CrossRef]
  9. Mursaleen, M.; Rahman, S.; Ansari, K.J. Approximation by Jakimovski-Leviatan-Stancu-Durrmeyer type operators. Filomat 2019, 33, 1517–1530. [Google Scholar] [CrossRef] [Green Version]
  10. Srivastava, H.M.; Içöz, G.; Çekim, B. Approximation properties of an extended family of the Szász–Mirakjan beta-type operators. Axioms 2019, 8, 111. [Google Scholar] [CrossRef] [Green Version]
  11. Sucu, S.; İçöz, G.; Varma, S. On some extensions of Szasz operators including Boas-Buck-type polynomials. Abstr. Appl. Anal. 2012, 15, 680340. [Google Scholar] [CrossRef] [Green Version]
  12. Varma, S.; Sucu, S.; İçöz, G. Generalization of Szasz operators involving Brenke type polynomials. Comput. Math. Appl. 2012, 64, 121–127. [Google Scholar] [CrossRef] [Green Version]
  13. Kazmin, Y.A. On Appell polynomials. Mat. Zametki 1969, 6, 161–172, English translation in Math. Notes 1969, 5, 556–562. [Google Scholar] [CrossRef]
  14. Altomare, F.; Campiti, M. Korovkin-type approximation theory and its applications. In Appendix A by Michael Pannenberg and Appendix B by Ferdinand Beckhoff, de Gruyter Studies in Mathematics; Walter de Gruyter & Co.: Berlin, Germany, 1994. [Google Scholar]
  15. Devore, R.A.; Lorentz, G.G. Constructive Approximation; Springer: Berlin/Heidelberg, Germany, 1993. [Google Scholar]
  16. Gavrea, I.; Rasa, I. Remarks on some quantitative Korovkin-type results. Rev. Anal. Numér. Théor. Approx. 1993, 22, 173–176. [Google Scholar]
  17. Zhuk, V.V. Functions of the Lip1 class and S. N. Bernstein’s polynomials (Russian), Vestnik Leningrad. Univ. Mat. Mekh. Astronom. 1989, 1, 25–30. [Google Scholar]
  18. Gould, H.W.; Hopper, A.T. Operational formulas connected with two generalizations of Hermite polynomials. Duke Math. J. 1962, 29, 51–63. [Google Scholar] [CrossRef]
  19. Douak, K. The relation of the d-orthogonal polynomials to the Appell polynomials. J. Comput. Appl. Math. 1996, 70, 279–295. [Google Scholar] [CrossRef] [Green Version]
  20. Iseghem, J.V. Vector orthogonal relations. Vector QD-algorithm. J. Comput. Appl. Math. 1987, 19, 141–150. [Google Scholar] [CrossRef] [Green Version]
  21. Maroni, P. L’orthogonalitè et les recurrences de polynômes d’ordre superieur à deux. Ann. Fac. Sci. Toulouse Math. 1989, 10, 105–139. [Google Scholar] [CrossRef]
Table 1. The error estimation of function f by using modulus of continuity.
Table 1. The error estimation of function f by using modulus of continuity.
nEstimation for h = 0.00001 Estimation for h = 1 Estimation for h = 1.8
100.64232504281.18055699401.4096205150
10 2 0.21007721200.24094684840.2812002468
10 3 0.06689667000.06795544840.0695336528
10 4 0.02119525920.02122911480.0212804728
10 5 0.00670642840.00670750120.0067091310
10 6 0.00212114320.00212117720.0021212294
10 7 0.00067080280.00067080420.0006708056
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Varma, S.; Sucu, S. A Generalization of Szasz Operators by Using the Appell Polynomials of Class A(2). Symmetry 2022, 14, 1410. https://doi.org/10.3390/sym14071410

AMA Style

Varma S, Sucu S. A Generalization of Szasz Operators by Using the Appell Polynomials of Class A(2). Symmetry. 2022; 14(7):1410. https://doi.org/10.3390/sym14071410

Chicago/Turabian Style

Varma, Serhan, and Sezgin Sucu. 2022. "A Generalization of Szasz Operators by Using the Appell Polynomials of Class A(2)" Symmetry 14, no. 7: 1410. https://doi.org/10.3390/sym14071410

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop