Next Article in Journal
Exploring Marshall–Olkin Models Through Bibliometric and Topic Modeling Approaches Using Latent Dirichlet Allocation (1981–2025): A Study Based on Scopus Data
Previous Article in Journal
A Numerical Study of Tunable Multifunctional Metastructures via Solid–Liquid Phase Transition for Simultaneous Control of Sound and Vibration
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A New Family of Szász–Mirakyan-Type Operators Preserving Two Exponential Functions

1
Department of Mathematics, Faculty of Science, Çankırı Karatekin University, Çankırı 18100, Turkey
2
Department of Mathematics, Faculty of Engineering and Natural Sciences, Kırıkkale University, Kırıkkale 71450, Turkey
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(7), 1214; https://doi.org/10.3390/math14071214
Submission received: 18 March 2026 / Revised: 29 March 2026 / Accepted: 2 April 2026 / Published: 4 April 2026
(This article belongs to the Special Issue New Advances in Functional Analysis and PDEs)

Abstract

This paper introduces a new family of Szász–Mirakyan-type operators defined by a convex combination of two Poisson-type constructions. The operators preserve the constant function and provide a continuous transition between different exponential behaviors through a parameter sequence. Basic properties of the operators are studied, including the preservation of exponential test functions and the behavior of the first and second central moments. Voronovskaja-type asymptotic results are obtained, describing the effect of the parameter on the asymptotic structure. Moreover, a necessary condition for faster-than 1 / n approximation is derived. The behavior of the operators is examined through computational evidence, which also confirms the theoretical findings.

1. Introduction

The approximation of functions on unbounded intervals via positive linear operators has been a subject of continuous research for many years. One of the earliest and most important constructions in this direction is the Szász–Mirakyan operator, which provides approximation of functions on the interval [ 0 , ) . Since its introduction, The operator and its extensions have been widely examined in the literature, and different modifications have been proposed in order to improve approximation properties or to preserve certain test functions.
One of the early contributions to approximation by positive linear operators on infinite intervals is due to [1]. Later, quantitative estimates and rates of convergence were studied in [2]. A significant development in the theory of positive linear operators is the idea of preserving special test functions. This approach has led to various modified operators with improved approximation behavior. In the setting of Szász–Mirakyan-type operators, several modifications have been proposed to obtain better approximation properties. For instance, such developments were studied in [3]. Further generalizations and convergence results for positive linear operators can be found in [4].
Another important direction is the construction of operators preserving exponential-type functions. A class of Szász–Mirakyan operators preserving the function e 2 a x was introduced in [5]. Later, Durrmeyer-type modifications preserving exponential functions were considered in [6], and approximation properties of such operators in different settings were investigated in [7]. In a recent study, Ulusoy Ada and Aral [8] examined weighted approximation by Szász–Mirakyan–Durrmeyer operators that reproduce exponential functions. Related recent developments on exponential-type preserving operators can also be found in [9,10,11].
Recent studies have also focused on distribution-based generalizations of Szász-type operators. An example of such an approach can be found in [12]. Other recent contributions involve beta-type, gamma-type, and Appell-type modifications; see, for instance, the works in [13,14,15], where different integral and exponential generalizations were analyzed on unbounded intervals.
Among the exponential-type modifications, a Szász–Mirakyan operator preserving the function e 2 x was introduced in [16], and quantitative approximation results were obtained by using moment-generating functions. Their construction shows that preserving suitable exponential functions leads to improved approximation behavior. Other related results on exponential-type and Kantorovich or bivariate modifications can be found in [17,18,19,20].
Motivated by this approach, we construct a new family of Szász–Mirakyan-type operators. While the above construction preserves a single exponential function e 2 x , the operators proposed here are designed to preserve two exponential functions simultaneously. This leads to a more flexible exponential reproduction structure and provides a continuous transition between different exponential behaviors, a feature not present in earlier exponential-preserving Szász–Mirakyan constructions. Moreover, for special choices of the parameter sequence, the proposed operators reduce to the operator introduced in [16] as well as to the classical Szász-type operators. We study the basic moments of the operators, establish quantitative approximation results, and derive Voronovskaja-type asymptotic formulas. In addition, a saturation-type result is obtained and several numerical examples are presented to illustrate the theoretical findings.

2. Definition of the Operators

In what follows, we work with the space C [ 0 , ) of continuous functions f : [ 0 , ) R for which the limit lim x f ( x ) exists and is finite. This space is equipped with the uniform norm f = sup x 0 | f ( x ) | .
For y 0 and k N 0 , let
p n , k ( y ) = e n y ( n y ) k k !
denote the Poisson-type basis functions.
Let c > 0 be fixed and define
α n , c ( x ) = c x n 1 e c / n , x 0 , n N .
For each f C [ 0 , ) , we formulate the operator S n ( c ) : C [ 0 , ) C [ 0 , ) by
( S n ( c ) f ) ( x ) = k = 0 p n , k α n , c ( x ) f k n , x 0 .
Let ( θ n ) be a sequence with 0 < θ n < 1 for all n N . Based on the operators S n ( 1 ) and S n ( 2 ) , we define a new sequence ( L n ) by
( L n f ) ( x ) = θ n S n ( 1 ) f ( x ) + ( 1 θ n ) S n ( 2 ) f ( x ) , x 0 .
Since both S n ( 1 ) and S n ( 2 ) are positive linear operators, the same properties hold for L n . In addition, the constant function is reproduced. Indeed, for y 0 we have
k = 0 p n , k ( y ) = 1 ,
which implies S n ( c ) ( 1 , x ) = 1 . Consequently,
L n ( 1 , x ) = θ n + ( 1 θ n ) = 1 , x 0 .
The operators ( L n ) can be viewed as a particular example of mixed positive linear operators obtained as a convex combination of two basic operators. In general, the approximation properties of such mixed operators are closely related to the corresponding properties of their constituent operators. In this framework, the present construction provides a concrete example in which the convergence behavior, moment estimates, and asymptotic properties of ( L n ) are derived from those of S n ( 1 ) and S n ( 2 ) , combined through the parameter sequence ( θ n ) .
Remark 1.
The operators S n ( c ) admit a natural probabilistic representation. Indeed, let K be a Poisson random variable with parameter
λ = n α n , c ( x ) .
Then
S n ( c ) ( f , x ) = E f K n .
Consequently, the operators L n can be written as a convex combination of two Poisson-type expectations
L n ( f , x ) = θ n E f K 1 n + ( 1 θ n ) E f K 2 n ,
where K 1 and K 2 are Poisson random variables with parameters n α n , 1 ( x ) and n α n , 2 ( x ) , respectively. This representation clarifies that ( L n ) is a mixed operator obtained as a convex combination of two Poisson-type operators.

3. Exponential Reproduction Properties

For a fixed c > 0 , the operators S n ( c ) reproduce the function e c t , that is,
( S n ( c ) ( e c t ) ) ( x ) = e c x , x 0 .
Indeed, using the definition of S n ( c ) ,
S n ( c ) ( e c t ) ( x ) = k = 0 e n α n , c ( x ) n α n , c ( x ) k k ! e c k / n .
Since e c k / n = ( e c / n ) k , we get
e n α n , c ( x ) k = 0 n α n , c ( x ) e c / n k k ! = exp n α n , c ( x ) 1 e c / n .
Finally, by the definition of α n , c ( x ) , n α n , c ( x ) 1 e c / n = c x .
Proposition 1.
For all x 0 , the operators ( L n ) satisfy
L n ( e t , x ) = θ n e x + ( 1 θ n ) exp n α n , 2 ( x ) 1 e 1 / n ,
and
L n ( e 2 t , x ) = θ n exp n α n , 1 ( x ) 1 e 2 / n + ( 1 θ n ) e 2 x .
Proof. 
The statement follows directly from the definition of L n together with the result obtained above. □
Remark 2.
The sequence ( θ n ) plays the role of a weighting parameter that controls the transition between the two underlying operators S n ( 1 ) and S n ( 2 ) .
In the extreme cases, if θ n 1 , then L n = S n ( 1 ) , while if θ n 0 , then L n = S n ( 2 ) . Thus, the operators reduce to the corresponding single exponential-type operators.
For intermediate values θ n ( 0 , 1 ) , the operators ( L n ) provide a continuous transition between these two cases. In particular, the contribution of each exponential behavior is regulated by θ n , allowing a gradual interpolation between the corresponding exponential behaviors.
This mechanism explains the flexibility of the proposed operators and shows how the parameter sequence ( θ n ) can be used to tune the approximation behavior depending on the structure of the function to be approximated.
This transition mechanism provides additional flexibility in approximation problems involving functions with multiple exponential components. In contrast to classical operators preserving a single exponential function, the operators ( L n ) allow a balanced treatment of different exponential behaviors through the parameter sequence ( θ n ) . This makes the proposed construction more suitable for approximating functions that simultaneously exhibit different exponential decay rates.
Remark 3.
The operators S n ( 1 ) and S n ( 2 ) are closely related to the exponential functions e x and e 2 x , respectively. In particular, these operators are constructed in such a way that they reproduce the corresponding exponential behavior.
However, the combined operators ( L n ) do not reproduce these exponential functions exactly in general. Instead, they approximate them with an error of order 1 / n . More precisely, for x 0 ,
L n ( e x , x ) e x = O 1 n , L n ( e 2 x , x ) e 2 x = O 1 n .
This shows that the operators ( L n ) provide a good approximation for these exponential functions, while allowing a balance between the two exponential behaviors.
Remark 4.
For the operators ( L n ) , the first and second central moments are given by
μ n , 1 L ( x ) : = L n ( t x , x ) , μ n , 2 L ( x ) : = L n ( t x ) 2 , x .
Using the definition L n = θ n S n ( 1 ) + ( 1 θ n ) S n ( 2 ) , we obtain
μ n , 1 L ( x ) = θ n α n , 1 ( x ) x + ( 1 θ n ) α n , 2 ( x ) x ,
and
μ n , 2 L ( x ) = θ n ( α n , 1 ( x ) x ) 2 + α n , 1 ( x ) n + ( 1 θ n ) ( α n , 2 ( x ) x ) 2 + α n , 2 ( x ) n .
In particular, for fixed x 0 , we have
μ n , 1 L ( x ) = O 1 n , μ n , 2 L ( x ) = O 1 n , ( n ) .

4. Main Results

Denote by C [ 0 , ) the Banach space consisting of all real-valued continuous functions on [ 0 , ) that admit a finite limit at infinity, endowed with the supremum norm.
General convergence results for positive linear operators on this space were obtained by Boyanov and Veselinov [1]. Subsequently, Holhoş [2] established the following theorem, which yields a uniform estimate in terms of exponential test functions.
Theorem 1
([2]). Suppose that ( A n ) is a sequence of positive linear operators A n : C [ 0 , ) C [ 0 , ) satisfying the following equalities
A n e 0 1 [ 0 , ) = p n ,
A n ( e t ) e x [ 0 , ) = q n ,
A n ( e 2 t ) e 2 x [ 0 , ) = r n ,
then
A n f f [ 0 , ) p n f [ 0 , ) + ( 2 + p n ) ω f , p n + 2 q n + r n , f C [ 0 , ) .
In Theorem 1, the modulus of continuity is defined by
ω ( f , δ ) : = sup x , t > 0 | e x e t | δ | f ( t ) f ( x ) | .

5. Quantitative Approximation

A uniform estimate for the approximation error of the operators L n in C [ 0 , ) is obtained below in terms of the exponential modulus of continuity.
Theorem 2.
For every f C [ 0 , ) ,
L n f f 2 ω f , 2 b n + c n ,
where
b n : = L n ( e t , · ) e x , c n : = L n ( e 2 t , · ) e 2 x .
Moreover, the quantities b n and c n satisfy
b n 1 θ n n , c n θ n n .
Proof. 
The argument relies on the exponential test function method. We first apply the general inequality for positive linear operators, and then estimate the quantities b n and c n using the explicit formulas of the operators.
Since each L n is positive, linear, and preserves constants, the standard exponential-test-function estimate yields
L n f f 2 ω f , 2 b n + c n .
It remains to bound b n and c n .
From the explicit formula of L n ( e t , x ) obtained above, we write
L n ( e t , x ) e x = ( 1 θ n ) S n ( 2 ) ( e t , x ) e x .
Moreover,
S n ( 2 ) ( e t , x ) = exp n α n , 2 ( x ) ( 1 e 1 / n ) ,
and
n α n , 2 ( x ) ( 1 e 1 / n ) = 2 x 1 + e 1 / n .
Hence
S n ( 2 ) ( e t , x ) = exp 2 x 1 + e 1 / n .
Therefore,
S n ( 2 ) ( e t , x ) e x = e x 1 e δ n x , δ n : = 1 e 1 / n 1 + e 1 / n > 0 .
Using 1 e u u for u 0 and sup x 0 x e x = 1 , we obtain
S n ( 2 ) ( e t , · ) e x δ n 1 e 1 / n 1 n .
Consequently,
b n = L n ( e t , · ) e x ( 1 θ n ) 1 n .
Similarly,
L n ( e 2 t , x ) e 2 x = θ n S n ( 1 ) ( e 2 t , x ) e 2 x .
Using the corresponding explicit formula obtained above, we have
S n ( 1 ) ( e 2 t , x ) = exp n α n , 1 ( x ) ( 1 e 2 / n ) = exp x ( 1 + e 1 / n ) .
Hence
S n ( 1 ) ( e 2 t , x ) e 2 x = e 2 x e ε n x 1 , ε n : = 1 e 1 / n > 0 .
Using e u 1 u e u for u 0 and e ( 2 ε n ) x e x , we get
S n ( 1 ) ( e 2 t , x ) e 2 x ε n x e x .
Taking supremum over x 0 and using sup x 0 x e x = 1 and ε n 1 / n , we obtain
S n ( 1 ) ( e 2 t , · ) e 2 x 1 n ,
and therefore
c n = L n ( e 2 t , · ) e 2 x θ n 1 n .
In conclusion, the bounds for b n and c n inserted into the above estimate yield the desired result. □
Remark 5.
If θ n 0 for all n N , then the operator sequence ( L n ) reduces to
( L n f ) ( x ) = S n ( 2 ) f ( x ) , x 0 .
In this case, the operators coincide with the modified Szász–Mirakyan operators studied by Gupta and Malik [16]. Consequently, the quantitative estimate obtained in the above theorem reduces to the corresponding convergence result established for that operator. This shows that the present operator family genuinely extends that construction.
Remark 6.
If θ n 1 for all n N , then
( L n f ) ( x ) = S n ( 1 ) f ( x ) , x 0 .
In this case, the operator preserves the exponential function e x exactly. The approximation behavior then corresponds to that of a Szász–Mirakyan-type operator associated with the parameter c = 1 (see [21]).
Remark 7.
The parameter sequence ( θ n ) provides a transition between two different exponential regimes. While the choice θ n 0 yields the Gupta–Malik operator preserving e 2 x , and θ n 1 leads to an operator preserving e x , intermediate values of θ n produce a convex combination of these two operators and thus an interpolation between the two exponential behaviors. This flexibility is reflected both in the quantitative estimate of the main theorem and in the explicit bounds
b n 1 θ n n , c n θ n n ,
which show how the convergence rate depends on the choice of ( θ n ) .

6. Voronovskaya-Type Asymptotic Formula

The asymptotic behavior of the operators L n is studied in this part. First, we obtain a first-order Voronovskaya-type limit relation. Then, we refine this result by deriving a second-order asymptotic expansion.
Theorem 3.
Let 0 < θ n < 1 for all n N and assume that θ n θ [ 0 , 1 ] as n . If f , f , f C [ 0 , ) , then for each fixed x 0 we have
lim n n L n ( f , x ) f ( x ) = x 1 θ 2 f ( x ) + x 2 f ( x ) .
Proof. 
Fix x 0 . For t 0 , the Taylor expansion of f around x yields
f ( t ) f ( x ) = f ( x ) ( t x ) + f ( x ) 2 ( t x ) 2 + ρ x ( t ) ,
where
ρ x ( t ) = f ( ξ ) f ( x ) 2 ( t x ) 2
for some ξ lying between x and t.
Applying the operator L n ( · , x ) to the above identity and using its linearity, we obtain
L n ( f , x ) f ( x ) = f ( x ) μ n , 1 L ( x ) + f ( x ) 2 μ n , 2 L ( x ) + L n ( ρ x ( t ) , x ) ,
where
μ n , 1 L ( x ) = L n ( t x , x ) , μ n , 2 L ( x ) = L n ( ( t x ) 2 , x ) .
From the known moment formulas of the Poisson-type kernel, we have
S n ( c ) ( t , x ) = α n , c ( x ) , S n ( c ) ( ( t x ) 2 , x ) = ( α n , c ( x ) x ) 2 + α n , c ( x ) n .
Consequently,
μ n , 1 L ( x ) = θ n ( α n , 1 ( x ) x ) + ( 1 θ n ) ( α n , 2 ( x ) x ) ,
μ n , 2 L ( x ) = θ n ( α n , 1 ( x ) x ) 2 + α n , 1 ( x ) n + ( 1 θ n ) ( α n , 2 ( x ) x ) 2 + α n , 2 ( x ) n .
Using the expansion
α n , c ( x ) = x + c 2 n x + O ( n 2 ) ,
it follows, for fixed x, that
lim n n μ n , 1 L ( x ) = x 1 θ 2 , lim n n μ n , 2 L ( x ) = x .
We now estimate the remainder term. From the definition of ρ x ( t ) and the mean value form of the remainder, we have
| ρ x ( t ) | = | f ( ξ ) f ( x ) | 2 ( t x ) 2 ,
where ξ lies between x and t.
Using the exponential-type modulus of continuity for f , we get
| f ( ξ ) f ( x ) | 1 + ( e ξ e x ) 2 δ 2 ω ( f , δ ) .
Since e s is 1-Lipschitz on [ 0 , ) , it follows that
| e ξ e x | | ξ x | | t x | .
Therefore,
| ρ x ( t ) | 1 2 1 + ( t x ) 2 δ 2 ω ( f , δ ) ( t x ) 2 .
Applying L n ( · , x ) and using positivity, we obtain
n | L n ( ρ x ( t ) , x ) | C ω ( f , δ ) n μ n , 2 L ( x ) + n δ 2 L n ( ( t x ) 4 , x ) ,
for a positive constant C > 0 .
Using the fourth central moment of the Poisson kernel (see, e.g., [22]),
L n ( ( t x ) 4 , x ) = O ( n 2 ) .
Choosing δ = n 1 / 2 gives
lim n n L n ( ρ x ( t ) , x ) = 0 .
Finally, multiplying (1) by n and letting n go to infinity, we get the desired result. □
Remark 8.
The above result can be seen as an extension of the classical Voronovskaya theorem for Szász–Mirakyan operators. In the classical case, the asymptotic formula involves the term
x f ( x ) + x 2 f ( x ) .
In contrast, for the operators ( L n ) , the coefficient of f ( x ) depends on the parameter θ, leading to the term
x 1 θ 2 f ( x ) .
This shows that the asymptotic behavior of ( L n ) is influenced by the parameter sequence ( θ n ) , which allows a continuous transition between different operator structures. Hence, the obtained Voronovskaya-type formula reflects the specific structure of the proposed operators.
Remark 9.
If θ n 0 , then L n = S n ( 2 ) and Theorem 3 reduces to the Voronovskaya-type result corresponding to the modified Szász–Mirakyan operators studied by Gupta and Malik. In this case, the limit formula takes the form
lim n n S n ( 2 ) ( f , x ) f ( x ) = x f ( x ) + x 2 f ( x ) ,
which coincides with the asymptotic behavior obtained in [16].
Remark 10.
If θ n 1 , then L n = S n ( 1 ) and Theorem 3 yields
lim n n S n ( 1 ) ( f , x ) f ( x ) = x 2 f ( x ) + x 2 f ( x ) ,
which corresponds to the Voronovskaya-type asymptotic formula for a Szász–Mirakyan-type operator preserving the exponential function e x .
Remark 11.
For intermediate choices of ( θ n ) with θ n θ ( 0 , 1 ) , Theorem 3 describes a continuous transition between the above two extreme cases. The parameter θ explicitly controls the contribution of the first-order term f ( x ) in the limit formula, while the coefficient of f ( x ) remains unchanged. This highlights the role of the sequence ( θ n ) as a genuine shape parameter in the asymptotic behavior of the operators ( L n ) .
Theorem 4.
Assume that f , f , f , f ( 3 ) , f ( 4 ) C [ 0 , ) and that θ n θ [ 0 , 1 ] with n ( θ n θ ) 0 as n . Then, for every fixed x 0 ,
lim n n n L n ( f , x ) f ( x ) x 1 θ 2 f ( x ) x 2 f ( x ) = A 1 ( x ) f ( x ) + A 2 ( x ) f ( x ) + A 3 ( x ) f ( 3 ) ( x ) + A 4 ( x ) f ( 4 ) ( x ) ,
where
A 1 ( x ) = x ( 4 3 θ ) 12 , A 2 ( x ) = 1 2 x 1 θ 2 + x 2 1 3 θ 4 ,
A 3 ( x ) = 1 6 x + x 2 3 3 θ 2 , A 4 ( x ) = x 2 8 .
Proof. 
Fix x 0 . The Taylor expansion of f at x up to order four gives, for t 0 ,
f ( t ) f ( x ) = f ( x ) ( t x ) + f ( x ) 2 ( t x ) 2 + f ( 3 ) ( x ) 6 ( t x ) 3 + f ( 4 ) ( x ) 24 ( t x ) 4 + ρ x ( t ) ,
where ρ x ( t ) denotes the remainder term. As in the proof of Theorem 3, ρ x ( t ) is given by the mean value form of the remainder.
Applying the operator L n ( · , x ) to the above expansion and using linearity, we arrive at
L n ( f , x ) f ( x ) = f ( x ) μ n , 1 L ( x ) + f ( x ) 2 μ n , 2 L ( x ) + f ( 3 ) ( x ) 6 μ n , 3 L ( x ) + f ( 4 ) ( x ) 24 μ n , 4 L ( x ) + L n ( ρ x ( t ) , x ) ,
where μ n , r L ( x ) : = L n ( ( t x ) r , x ) .
For c > 0 , recall that
α n , c ( x ) = c x n ( 1 e c / n ) = x · u 1 e u , u = c n .
Since
e u = 1 u + u 2 2 u 3 6 + O ( u 4 ) ( u 0 ) ,
we obtain
u 1 e u = 1 + u 2 + u 2 12 + O ( u 3 ) ,
and therefore
α n , c ( x ) = x + c 2 n x + c 2 12 n 2 x + O ( n 3 ) .
By using the central moments of the Poisson-type kernel up to order four (see, e.g., [22]) together with (3), a straightforward computation gives
n S n ( c ) ( t x , x ) = c 2 x + c 2 12 n x + O ( n 2 ) ,
n S n ( c ) ( ( t x ) 2 , x ) = x + 1 n c 2 x + c 2 4 x 2 + O ( n 2 ) ,
lim n n 2 S n ( c ) ( ( t x ) 3 , x ) = x + 3 c 2 x 2 ,
lim n n 2 S n ( c ) ( ( t x ) 4 , x ) = 3 x 2 .
Passing to the operators L n = θ n S n ( 1 ) + ( 1 θ n ) S n ( 2 ) and using the assumptions θ n θ and n ( θ n θ ) 0 , we obtain
n μ n , 1 L ( x ) = x 1 θ 2 + 1 n x ( 4 3 θ ) 12 + o 1 n ,
n μ n , 2 L ( x ) = x + 1 n x 1 θ 2 + x 2 1 3 θ 4 + o 1 n ,
lim n n 2 μ n , 3 L ( x ) = x + x 2 3 3 θ 2 , lim n n 2 μ n , 4 L ( x ) = 3 x 2 .
We next control the remainder term. Since
ρ x ( t ) = f ( 4 ) ( ξ ) f ( 4 ) ( x ) 24 ( t x ) 4 ( ξ between x and t ) ,
by positivity of L n we have
| L n ( ρ x ( t ) , x ) | 1 24 L n | f ( 4 ) ( ξ ) f ( 4 ) ( x ) | ( t x ) 4 , x .
Using the exponential modulus inequality for f ( 4 ) , for any δ > 0 ,
| f ( 4 ) ( ξ ) f ( 4 ) ( x ) | ω ( f ( 4 ) , δ ) 1 + | e ξ e x | δ .
Moreover, the map s e s is 1-Lipschitz on [ 0 , ) , hence | e ξ e x | | ξ x | | t x | . Therefore,
| L n ( ρ x ( t ) , x ) | 1 24 ω ( f ( 4 ) , δ ) L n 1 + | t x | δ ( t x ) 4 , x 1 24 ω ( f ( 4 ) , δ ) μ n , 4 L ( x ) + 1 δ 2 L n ( ( t x ) 6 , x ) .
Multiplying by n 2 yields
n 2 | L n ( ρ x ( t ) , x ) | 1 24 ω ( f ( 4 ) , δ ) n 2 μ n , 4 L ( x ) + n 2 δ 2 L n ( ( t x ) 6 , x ) .
From the sixth central moment of the Poisson-type kernel (see, e.g., [22]), it follows that
L n ( ( t x ) 6 , x ) = O ( n 3 ) .
Choosing δ = n 1 / 2 yields
lim n n 2 L n ( ρ x ( t ) , x ) = 0 .
Multiplying (2) by n, subtracting x ( 1 θ / 2 ) f ( x ) + x 2 f ( x ) , and multiplying once more by n, we obtain the required limit. □
Theorem 4 gives a refined pointwise asymptotic description of the operators ( L n ) under stronger smoothness assumptions on the function f. In particular, when higher derivatives of f exist, the theorem identifies the next term after the first-order 1 / n behavior in the asymptotic expansion. This shows that a more precise pointwise rate of convergence can be obtained beyond the first Voronovskaya-type formula. An important feature here is that this refinement is derived by using polynomial central moments of the operators. In particular, the control of the remainder term is reduced to the estimate of the fourth central moment, which is sufficient for the proof.

7. A Saturation-Type Result

The next result characterizes the saturation class of the operators L n by determining all functions for which the approximation error is of order o ( 1 / n ) .
Theorem 5.
Let θ n θ [ 0 , 1 ] and assume that n ( θ n θ ) 0 . If f , f , f C [ 0 , ) and
L n f f = o 1 n ( n ) ,
then f must be of the form
f ( x ) = A + B e ( 2 θ ) x , x 0 ,
for some constants A , B R .
Proof. 
Fix x 0 . The assumption
L n f f = o 1 n
implies that
n L n ( f , x ) f ( x ) 0 ( n ) .
Conversely, by Theorem 3,
lim n n L n ( f , x ) f ( x ) = x 1 θ 2 f ( x ) + x 2 f ( x ) .
Combining these relations, we obtain
x 1 θ 2 f ( x ) + x 2 f ( x ) = 0 , x 0 .
For x > 0 , this reduces to
f ( x ) + ( 2 θ ) f ( x ) = 0 .
Denote g ( x ) = f ( x ) . Then g satisfies
g ( x ) + ( 2 θ ) g ( x ) = 0 , x > 0 ,
whose solution is
g ( x ) = C e ( 2 θ ) x
for some constant C R . By integrating, we arrive at
f ( x ) = A + B e ( 2 θ ) x , x > 0 ,
with suitable constants A , B R . Continuity at x = 0 extends this representation to the whole interval [ 0 , ) . □
Remark 12.
The above result shows that a convergence rate faster than 1 / n can only be achieved for a very restricted class of functions. In fact, the condition
L n f f = o 1 n
implies that f must be of the form
f ( x ) = A + B e ( 2 θ ) x .
Thus, this condition is highly restrictive and holds only for functions with a very specific structure. In particular, for general functions, the rate of approximation cannot be improved beyond order 1 / n .
This result reflects a saturation phenomenon for the operators ( L n ) , showing that 1 / n is the optimal rate of convergence in this setting.

8. Numerical Results and Applications

Here, we present numerical examples that show the approximation behavior of the operators ( L n ) defined in Section 2.
The aim of these examples is not to provide a numerical proof of the theoretical results, but rather to visualize the convergence properties and the influence of the parameters involved.
As a test function, we consider
f ( x ) = x 2 + e x e 2 x , x 0 .
This choice is motivated by the fact that it combines a polynomial term, which reveals the typical behavior of Szász–Mirakyan-type operators, together with exponential terms that are closely related to the reproduction properties discussed in Section 3.
We first fix the parameter θ = 0.5 and compare the graphs of f and L n ( f , · ) for different values of n. Figure 1 shows that, for moderate values of n, the operators L n provide a good approximation to f, and the quality of approximation improves as n increases. The separation of the curves for smaller values of n clearly illustrates the convergence process.
In order to further emphasize the convergence behavior, we plot in Figure 2 the absolute approximation error
| L n ( f , x ) f ( x ) | ,
for the same values of θ and n. The error is observed to decrease as n increases, in accordance with the theoretical approximation results derived in the previous sections.
This behavior is consistent with the theoretical rate of convergence and confirms that the operators ( L n ) provide stable and reliable approximation. Moreover, the graphical results illustrate how the approximation error is distributed over the interval, showing that the operators perform particularly well on regions where the function exhibits exponential behavior.
To complement the graphical illustrations, we present pointwise absolute errors at selected nodes in Table 1. The numerical values clearly show that the approximation error decreases as n increases, which is consistent with the theoretical convergence results.
In order to further demonstrate the usefulness of the proposed operators, we briefly compare their approximation behavior with that of the classical Szász–Mirakyan operators.
It is well known that the classical Szász operators do not reproduce exponential functions exactly. In contrast, the operators ( L n ) are constructed to incorporate exponential behavior through the parameters θ n and the underlying structure of the operators S n ( 1 ) and S n ( 2 ) .
For test functions containing exponential terms, such as
f ( x ) = x 2 + e x e 2 x ,
the proposed operators provide a flexible approximation framework that incorporates different exponential behaviors through the parameter sequence ( θ n ) . In this sense, the numerical results and graphical illustrations show that the operators ( L n ) offer a competitive alternative to the classical Szász operators.
This comparison highlights the advantage of the exponential-preserving framework and confirms that the proposed operators are more suitable for approximating functions with mixed polynomial and exponential components.
The proposed operators may also be useful in applications involving functions with exponential decay or growth, which frequently arise in probability theory, physics, and engineering. For example, in signal processing, exponentially decaying signals appear in various contexts such as damping and transient responses. In many such cases, combinations of exponential terms with different decay rates are involved. The flexibility of the operators ( L n ) , provided by the parameter sequence ( θ n ) , allows a more effective approximation of such functions compared to classical operators designed to preserve only a single exponential behavior.

9. Conclusions

A new family of Szász–Mirakyan-type operators based on a convex combination structure is introduced. The proposed operators are designed to reproduce two exponential functions and provide a continuous transition between different exponential behaviors. Basic moments, quantitative approximation results, and Voronovskaja-type asymptotic formulas were obtained. It was also shown that, for suitable choices of the parameter sequence, the operators reduce to the Gupta–Malik operator and to classical Szász-type constructions.
In this paper, we analyzed the role of the parameter sequence ( θ n ) in controlling the transition between different exponential behaviors. The numerical results support the theoretical findings and illustrate the convergence behavior of the operators and reflect the role of the parameter sequnece θ n . The proposed construction provides a flexible framework for approximating functions involving multiple exponential components.
The present work also suggests several directions for future research. One possible extension is to consider convex combinations of more than two operators in order to preserve a richer class of exponential functions. Another natural direction is to investigate Kantorovich, Durrmeyer, or Baskakov-type variants of the proposed operators, which may be useful in approximation problems on different function spaces. These directions may lead to further developments of the proposed framework.

Author Contributions

Conceptualization, G.U.A. and A.A.; Methodology, G.U.A. and A.A.; Formal analysis, G.U.A. and A.A.; Investigation, G.U.A. and A.A.; Writing—original draft, G.U.A. and A.A.; Writing—review and editing, G.U.A. and A.A.; Visualization, G.U.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Boyanov, B.D.; Veselinov, V.M. A note on the approximation of functions in an infinite interval by linear positive operators. Bull. Math. Soc. Sci. Math. Roum. 1970, 14, 9–13. [Google Scholar]
  2. Holhoş, A. The rate of approximation of functions in an infinite interval by positive linear operators. Stud. Univ. Babeş-Bolyai Math. 2010, 55, 133–142. [Google Scholar]
  3. Finta, Z.; Govil, N.K.; Gupta, V. Some results on modified Szász–Mirakyan operators. J. Math. Anal. Appl. 2007, 327, 1284–1296. [Google Scholar] [CrossRef][Green Version]
  4. Gupta, V.; Agarwal, R.P. Convergence Estimates in Approximation Theory; Springer: Cham, Switzerland, 2014. [Google Scholar] [CrossRef]
  5. Acar, T.; Aral, A.; Gonska, H. On Szász–Mirakyan operators preserving e2ax. Mediterr. J. Math. 2017, 14, 1–14. [Google Scholar] [CrossRef]
  6. Deniz, E.; Aral, A.; Gupta, V. Note on Szász–Mirakyan–Durrmeyer operators preserving e2ax. Numer. Funct. Anal. Optim. 2018, 39, 201–207. [Google Scholar] [CrossRef]
  7. Aral, A.; Inoan, D.; Raşa, I. Approximation properties of Szász–Mirakyan operators preserving exponential functions. Positivity 2019, 23, 233–246. [Google Scholar] [CrossRef]
  8. Ulusoy Ada, G.; Aral, A. Weighted approximation by Szász–Mirakyan–Durrmeyer operators reproducing exponential functions. Mathematics 2026, 14, 59. [Google Scholar] [CrossRef]
  9. Goyal, M. Reconstruction of Szász–Mirakyan operators preserving exponential type functions. Filomat 2023, 37, 427–434. [Google Scholar] [CrossRef]
  10. Bodur, M. Approximation by bivariate Szász–Mirakyan operators preserving e-2(p1+p2). Filomat 2025, 39, 6281–6293. [Google Scholar] [CrossRef]
  11. Herdem, S. Ibragimov–Gadjiev operators preserving exponential functions. J. Inequal. Appl. 2024, 2024, 72. [Google Scholar] [CrossRef]
  12. Kajla, A.; Acu, A.M.; Agrawal, P.N. Baskakov–Szász type operators based on inverse Pólya–Eggenberger distribution. Ann. Funct. Anal. 2017, 8, 106–123. [Google Scholar] [CrossRef]
  13. Rao, N.; Raiz, M.; Mursaleen, M.A.; Mishra, V.N. Approximation properties of extended beta-type Szász–Mirakyan operators. Iran. J. Sci. 2023, 47, 1771–1781. [Google Scholar] [CrossRef]
  14. Ayman-Mursaleen, M.; Nasiruzzaman, M.; Rao, N. On the approximation of Szász–Jakimovski–Leviatan beta-type integral operators enhanced by Appell polynomials. Iran. J. Sci. 2025, 49, 1013–1022. [Google Scholar] [CrossRef]
  15. Nasiruzzaman, M.; Rao, N.; Mursaleen, M.; Albalawi, A.S.; Yadav, A.K. Approximation by a new sequence of generalized α–Szász–Gamma operators. Filomat 2025, 39, 6771–6782. [Google Scholar] [CrossRef]
  16. Gupta, V.; Malik, N. Approximation with certain Szász–Mirakyan operators. Khayyam J. Math. 2017, 3, 90–97. [Google Scholar] [CrossRef]
  17. Aral, A.; Limmam, M.L.; Ozsarac, F. Approximation properties of Szász–Mirakyan–Kantorovich type operators. Math. Methods Appl. Sci. 2019, 42, 5233–5240. [Google Scholar] [CrossRef]
  18. Ozsarac, F.; Gupta, V.; Aral, A. Approximation by some Baskakov–Kantorovich exponential-type operators. Bull. Iran. Math. Soc. 2022, 48, 227–241. [Google Scholar] [CrossRef]
  19. Bozkurt, K.; Ozsarac, F.; Aral, A. Bivariate Bernstein polynomials that reproduce exponential functions. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2021, 70, 541–554. [Google Scholar] [CrossRef]
  20. Gupta, V.; Gupta, R. Convergence estimates for some composition operators. Construct. Math. Anal. 2024, 7, 69–76. [Google Scholar] [CrossRef]
  21. Szász, O. Generalization of S. Bernstein’s polynomials to the infinite interval. J. Res. Natl. Bur. Stand. 1950, 45, 239–245. [Google Scholar] [CrossRef]
  22. Johnson, N.L.; Kemp, A.W.; Kotz, S. Univariate Discrete Distributions, 3rd ed.; Wiley: New York, NY, USA, 2005. [Google Scholar] [CrossRef]
Figure 1. Comparison of f ( x ) = x 2 + e x e 2 x and L n ( f , x ) for θ = 0.5 and n { 5 , 10 , 20 , 50 } on [ 0 , 10 ] .
Figure 1. Comparison of f ( x ) = x 2 + e x e 2 x and L n ( f , x ) for θ = 0.5 and n { 5 , 10 , 20 , 50 } on [ 0 , 10 ] .
Mathematics 14 01214 g001
Figure 2. Absolute approximation error | L n ( f , x ) f ( x ) | for f ( x ) = x 2 + e x e 2 x , θ = 0.5 , and n { 5 , 10 , 20 , 50 } on [ 0 , 10 ] .
Figure 2. Absolute approximation error | L n ( f , x ) f ( x ) | for f ( x ) = x 2 + e x e 2 x , θ = 0.5 , and n { 5 , 10 , 20 , 50 } on [ 0 , 10 ] .
Mathematics 14 01214 g002
Table 1. Pointwise absolute errors of L n ( f , x ) for f ( x ) = x 2 + e x e 2 x , θ = 0.5 , and selected values of x and n.
Table 1. Pointwise absolute errors of L n ( f , x ) for f ( x ) = x 2 + e x e 2 x , θ = 0.5 , and selected values of x and n.
x n 5102050
10.54550.25280.12160.0475
21.82600.85020.41020.1606
33.79011.76640.85260.3339
46.43893.00181.44910.5675
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ada, G.U.; Aral, A. A New Family of Szász–Mirakyan-Type Operators Preserving Two Exponential Functions. Mathematics 2026, 14, 1214. https://doi.org/10.3390/math14071214

AMA Style

Ada GU, Aral A. A New Family of Szász–Mirakyan-Type Operators Preserving Two Exponential Functions. Mathematics. 2026; 14(7):1214. https://doi.org/10.3390/math14071214

Chicago/Turabian Style

Ada, Gülsüm Ulusoy, and Ali Aral. 2026. "A New Family of Szász–Mirakyan-Type Operators Preserving Two Exponential Functions" Mathematics 14, no. 7: 1214. https://doi.org/10.3390/math14071214

APA Style

Ada, G. U., & Aral, A. (2026). A New Family of Szász–Mirakyan-Type Operators Preserving Two Exponential Functions. Mathematics, 14(7), 1214. https://doi.org/10.3390/math14071214

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