Next Article in Journal
Numbers Whose Powers Are Arbitrarily Close to Integers
Next Article in Special Issue
Diversity and Semiconvergents in Pythagorean Tuning
Previous Article in Journal
Borel Summation in a Martingale-Type Collar
Previous Article in Special Issue
The Derivation of a Multiquadric Variant Solver for the Three-Dimensional Heston-Hull-White PDE
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials

1
Department of Mathematics, University Center for Research and Development, Chandigarh University, Mohali 140413, Punjab, India
2
Department of Mathematics, College of Science, Qassim University, Saudi Arabia
3
Department of Mathematics, University Institute of Sciences, Chandigarh University, Mohali 140413, Punjab, India
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(6), 418; https://doi.org/10.3390/axioms14060418
Submission received: 26 April 2025 / Revised: 24 May 2025 / Accepted: 25 May 2025 / Published: 29 May 2025
(This article belongs to the Special Issue Applied Mathematics and Numerical Analysis: Theory and Applications)

Abstract

:
This manuscript associates with a study of Frobenius–Euler–Simsek-type Polynomials. In this research work, we construct a new sequence of Szász–Beta type operators via Frobenius–Euler–Simsek-type Polynomials to discuss approximation properties for the Lebesgue integrable functions, i.e., L p [ 0 , ) , 1 p < . Furthermore, estimates in view of test functions and central moments are studied. Next, rate of convergence is discussed with the aid of the Korovkin theorem and the Voronovskaja type theorem. Moreover, direct approximation results in terms of modulus of continuity of first- and second-order, Peetre’s K-functional, Lipschitz type space, and the r t h -order Lipschitz type maximal functions are investigated. In the subsequent section, we present weighted approximation results, and statistical approximation theorems are discussed. To demonstrate the effectiveness and applicability of the proposed operators, we present several illustrative examples and visualize the results graphically.

1. Introduction

The systematic development of operator theory began in the late 19th century. An important aspect of approximation in operator theory is to find simple, computationally tractable approximations that capture the essential properties of more complex functions. These approximations can then be used for analysis, simulation, or computation in various applications, such as quantum mechanics, signal processing, and control theory. It provides powerful tools for solving problems and analyzing systems involving operators. In the last decade, there has been continued research and development in approximation theory in operator theory, with a focus on more advanced techniques having applications in data science and machine learning. In approximation theory, Weierstrass (1885) [1] formulated an elegant result known as the Weierstrass approximation theorem. Proving this theorem in a more straightforward and comprehensible manner has been the focus of several prominent mathematicians.
Bernstein (1912) [2] developed a sequence of polynomials called Bernstein polynomials to give a concise demonstration of Weierstrass approximation theorem using binomial distribution as:
B s ( Φ ; v ) = ϑ = 0 s Φ ϑ s s ϑ v ϑ ( 1 v ) s ϑ , v [ 0 , 1 ] ,
where Φ is a continuous and bounded function on [ 0 , 1 ] . The operators in (1) restrict the approximation for continuous functions on bounded interval [ 0 , 1 ] . In order to discuss approximation properties on unbounded interval [ 0 , ) , Szász [3] provided the modification to the operators in (1), which has played a significant role in the evolution of operator theory, as follows:
S s ( Φ ; v ) = e s v ϑ = 0 ( s v ) ϑ ϑ ! Φ ϑ s , s N ,
where real valued function Φ C [ 0 , ) . As given in (2), the linear positive operators are solely limited to continuous functional space. Many integral variants of these sequences of operators are obtained in order to approximate the longer class of functions, i.e., Lebesgue measurable functional space, Szász–Durremeyer and Szász–Kantorovich type operators, etc. ([4,5]). Many researchers, e.g., Acu et al. ([6,7]), Mohiuddine et al. ([8,9]), Mursaleen et al. ([10,11]), Khan et al. [12], Nasiruzzaman [13], and Rao et al. ([14,15,16,17]), have provided a number of generalizations for these kinds of sequences to investigate flexibility in approximation properties across several functional spaces.
In 2021, Simsek defined Frobenius–Euler–Simsek-type polynomials and numbers. He investigated the relations and identities between these special polynomials and numbers, such as Fubini polynomials and numbers and Bernoulli polynomials and numbers [18]. The Frobenius–Euler–Simsek-type polynomial t ϑ ( v ; p ) has a generating function given as:
F t ( v ; w , p ) = w p l = 0 p 1 ( e w l ) e w v = ϑ = 0 t ϑ ( v ; p ) w ϑ ϑ ! .
Taking p = 2, we have
F t ( v ; w , 2 ) = w 2 e w ( e w 1 ) e w v = ϑ = 0 t ϑ ( v ; 2 ) w ϑ ϑ ! .
For more information on Euler-type polynomials and their applications, see also [19,20].

2. Construction of Operators

By the motivation from the definition of Frobenius–Euler–Simsek-type polynomials in Equation (3) with w = 1 , we present a sequence of positive and linear Szász–Beta operators to provide approximations in larger functional space, i.e., Lebesgue measurable functional space L p [ 0 , ) , for v R 0 + and Φ L p [ 0 , ) as:
F s ( Φ ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! 0 Q s ϑ ( u ) Φ ( u ) d u ,
where Q s ϑ ( u ) = 1 β ( ϑ + 1 , s ) u ϑ ( 1 + u ) ϑ + 1 + s , Beta function, β ( ϑ + 1 , s ) = 0 u ϑ ( 1 + u ) ϑ + 1 + s d u .
The operators in Equation (4) are positive and linear. Basic information about linear positive operators, along with their applications and generalizations, can be found in [21].
Lemma 1.
The sequence of operators F s ( , ; , ) is linear.
Proof.  
Let λ 1 , λ 2 R and Φ 1 , Φ 2 L p [ 0 , ) . Then, in view of Equation (4), we have
F s ( λ 1 Φ 1 + λ 2 Φ 2 ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! 0 Q s ϑ ( u ) ( λ 1 Φ 1 + λ 2 Φ 2 ) ( u ) d u = λ 1 ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! 0 Q s ϑ ( u ) Φ 1 ( u ) d u + λ 2 ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! 0 Q s ϑ ( u ) Φ 2 ( u ) d u = λ 1 F s ( Φ 1 ; v ) + λ 2 F s ( Φ 2 ; v ) .
Lemma 2.
Let Φ j ( u ) = u j , j { 0 , 1 , 2 } be the test functions. Then, we have
F s ( Φ j ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ( ϑ + j ) ! ( s 1 j ) ! ϑ ! ( s 1 ) ! .
Proof.  
We know that
0 Q s ϑ ( u ) Φ j ( u ) d u = 1 β ( ϑ + 1 , s ) 0 u ϑ + j ( 1 + u ) ϑ + 1 + s d u = 1 β ( ϑ + 1 , s ) β ( ϑ + s + 1 , s j ) = ( ϑ + j ) ! ( s 1 j ) ! ϑ ! ( s 1 ) ! .
From (4), we have
F s ( Φ j ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ( ϑ + j ) ! ( s 1 j ) ! ϑ ! ( s 1 ) ! .
Lemma 3.
In view of Equation (3), we have the following equalities:
d d w F t ( v ; w , 2 ) = w e w ( v 1 ) ( v w + e w ( w v 2 w + 2 ) + w 2 ) ( e w 1 ) 2 ; d 2 d w 2 F t ( v ; w , 2 ) = e w ( v 1 ) ( e w 1 ) 3 [ w 2 ( v 1 ) 2 + w e 2 ( w 2 ( v 2 ) 2 + 4 w ( v 2 ) + 2 ) + 4 w ( v 1 ) + 2 e w ( w 2 ( 2 v 2 6 v + 3 ) + 4 w ( 2 v 3 ) + 4 ) ] .
Lemma 4.
For the generating function given in Equation (3), we have
ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! = e s v ( e 2 e ) ; ϑ = 0 ϑ t ϑ ( s v ; 2 ) ϑ ! = e s v ( e 2 e ) s v 1 e 1 ; ϑ = 0 ϑ 2 t ϑ ( s v ; 2 ) ϑ ! = e s v ( e 2 e ) s 2 v 2 2 s v e 1 2 e 2 5 e + 1 ( e 1 ) 2 .
Proof.  
Employing Lemma 3 and Equation (3), for w = 1, we can easily prove the above equalities. □
Lemma 5.
For operator F s ( , ; , ) , defined in Equation (4), we have
F s ( Φ 0 ( u ) ; v ) = 1 ; F s ( Φ 1 ( u ) ; v ) = v + 1 s 1 e 2 e 1 + v ; s > 1 , F s ( Φ 2 ( u ) ; v ) = v 2 + 1 ( s 1 ) ( s 2 ) ( 3 s 2 ) v 2 + s ( 3 e 5 ) e 1 v + 4 2 e ( e 1 ) 2 ; s > 2 ,
for every  v R 0 + .
Proof.  
In the direction of (4), we have
F s ( Φ j ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! 0 Q s ϑ ( u ) Φ j ( u ) d u F s ( Φ j ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ( ϑ + j ) ! ( s 1 j ) ! ϑ ! ( s 1 ) ! .
Now, for j = 0, by Lemma 4,
F s ( Φ 0 ( u ) ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ϑ ! ( s 1 ) ! ϑ ! ( s 1 ) ! = 1 .
For j = 1,
F s ( Φ 1 ( u ) ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ( ϑ + 1 ) ! ( s 2 ) ! ϑ ! ( s 1 ) ! = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ϑ + 1 s 1 = ( e 2 e ) e s v ( s 1 ) ϑ = 0 ϑ t ϑ ( s v ; 2 ) ϑ ! + ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! = 1 s 1 s v + 1 1 e 1 = v + 1 s 1 e 2 e 1 + v .
For j = 2,
F s ( Φ 2 ( u ) ; v ) = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ( ϑ + 2 ) ! ( s 3 ) ! ϑ ! ( s 1 ) ! = ( e 2 e ) e s v ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! ( ϑ + 2 ) ( ϑ + 1 ) ( s 1 ) ( s 2 ) = ( e 2 e ) e s v ( s 2 ) ( s 1 ) ϑ = 0 ϑ 2 t ϑ ( s v ; 2 ) ϑ ! + 3 ϑ = 0 ϑ t ϑ ( s v ; 2 ) ϑ ! + 2 ϑ = 0 t ϑ ( s v ; 2 ) ϑ ! = 1 ( s 2 ) ( s 1 ) s 2 v 2 + s v ( 3 e 5 ) e 1 + 4 2 e ( e 1 ) 2 = v 2 + 1 ( s 2 ) ( s 1 ) ( 3 s 2 ) v 2 + s ( 3 e 5 ) e 1 v + 4 2 e ( e 1 ) 2 .
Hence, we complete proof of Lemma 5. □
Lemma 6.
Let α j ( u ) = ( u v ) j , j = 0, 1, 2. Then, for operators in (4), we acquire central moments F s ( α j ( u ) ; v ) as:
F s ( α 0 ( u ) ; v ) = 1 ; F s ( α 1 ( u ) ; v ) = 1 s 1 v + e 2 e 1 ; s > 1 , F s ( α 2 ( u ) ; v ) = 1 ( s 1 ) ( s 2 ) ( s + 2 ) v 2 + 4 ( e 2 ) e 1 + s v + 4 2 e ( e 1 ) 2 ; s > 2 , F s ( α 4 ( u ) ; v ) = o 1 s 2 ;
for every v R 0 + .
Proof.  
With the aid of Lemma 5 and linearity property, one can easily obtain Lemma 6. □
Further, we examine the convergence rate of operators and their approximation order. Specifically, we discuss direct local and global results across several spaces. In the final section, we explore some results of A-Statistical approximation in various functional spaces.

3. Convergence Rate and Approximation Order

Definition 1
([22]). The modulus of smoothness for Φ L p [ 0 , ) is given by
ω ( Φ ; δ ) = sup | v 1 v 2 | δ | Φ ( v 1 ) Φ ( v 2 ) | , v 1 , v 2 [ 0 , ) .
and
| Φ ( v 1 ) Φ ( v 2 ) | 1 + | v 1 v 2 | δ ω ( Φ ; δ ) .
Theorem 1.
Let F s ( . ; . ) be operators described in Equation (4). Then, on every bounded and closed subset of [ 0 , ) , F s ( Φ ; . ) Φ , for all Φ L p [ 0 , ) , where ⇉ denotes uniform convergence.
Proof.  
Considering the classical Korovkin-type theorem [23], which characterizes the sequence of positive and linear operators for uniform convergence, it is sufficient to see that
lim s F s ( Φ j ; v ) = v j , j = 0 , 1 , 2 ,
uniformly on all bounded and closed subsets of [ 0 , ) . We can easily establish this result with the help of Lemma 5. □
Now, we show the Voronovskaja-type asymptotic approximation theorem for the F s ( . ; . ) given in (4).
Let C B [ 0 , ) : Denotes a real valued functional space having bounded and continuous functions and C B 2 [ 0 , ) = { Ψ C B [ 0 , ) : Ψ , Ψ C B [ 0 , ) } .
Theorem 2.
For Φ C B 2 [ 0 , ) and Φ , Φ existing at a point v [ 0 , ) , we get
lim s s F s ( Φ ; v ) Φ ( v ) = Φ ( v ) v + e 2 e 1 + 1 2 ( v 2 + v ) Φ ( v ) .
Proof.  
In accordance with Taylor’s formula for the function Φ , we have
Φ ( u ) = Φ ( v ) + ( u v ) Φ ( v ) + 1 2 ( u v ) 2 Φ ( v ) + l ( u , v ) ( u v ) 2 ,
where l ( u , v ) is the Peano remainder and
lim u v l ( u , v ) = 0 .
Applying operators on both sides in (6), we yield
( F s ( Φ ; v ) Φ ( v ) ) = Φ ( v ) F s ( ( u v ) ; v ) + 1 2 Φ ( v ) F s ( ( u v ) 2 ; v ) + F s ( l ( u , v ) ( u v ) 2 ; v ) .
In view of Lemma 6,
s ( F s ( Φ ; v ) Φ ( v ) ) = s Φ ( v ) s 1 e 2 e 1 + v + 1 2 s Φ ( v ) ( s 2 ) ( s 1 ) [ ( s + 2 ) v 2 + s + 4 ( e 2 ) e 1 v + 4 2 e ( e 1 ) 2 ] + s F s ( l ( u , v ) ( u v ) 2 ; v ) .
Operating the limits on both sides of the above expression, we get
lim s s ( F s ( Φ ; v ) Φ ( v ) ) = Φ ( v ) e 2 e 1 + v + 1 2 ( v 2 + v ) Φ ( v ) + lim s s F s ( l ( u , v ) ( u v ) 2 ; v ) .
Now, we need to show that
lim s s F s ( l ( u , v ) ( u v ) 2 ; v ) = 0 .
Using Cauchy–Schwarz inequality, we calculate the last term of the above expression as:
s F s ( l ( u , v ) ( u v ) 2 ; v ) F s ( l 2 ( u , v ) ; v ) s 2 F s ( ( u v ) 4 ; v ) .
In view of Lemma 6, F s ( ( u v ) 4 ; v ) = o 1 s 2 , and we see that l 2 ( v , v ) = 0 and l 2 ( u , v ) C B [ 0 , ) . Thus, we have
lim s F s ( l 2 ( u , v ) ; v ) = l 2 ( v , v ) = 0 .
From (7) and (8), it follows that
lim s s F s ( l ( u , v ) ( u v ) 2 ; v ) = 0 .
Hence, the proof is completed. □
In accordance with Shisha et al. [24], the order of the convergence relative to the Ditzian–Totik modulus of continuity can easily be proven.
Theorem 3.
Consider Φ L p [ 0 , ) , and for the operators F s ( . ; . ) presented in Equation (4), we acquire
| F s ( Φ ; v ) Φ ( v ) | 2 ω ( Φ ; δ ) ,
where δ = F s ( α 2 ( u ) ; v ) .
Proof.  
In accordance with Lemmas 5 and 6, Equation (5), and Cauchy–Schwarz inequality, we have
| F s ( Φ ; v ) Φ ( v ) | F s | ( Φ ( u ) Φ ( v ) | ; v ) F s ( | u v | δ + 1 ω ( Φ , δ ) ; v ) ω ( Φ , δ ) 1 δ F s ( | u v | ; v ) + 1 ω ( Φ , δ ) 1 δ F s ( α 2 ( u ) ; v ) + 1
By selecting δ = F s ( α 2 ( u ) ; v ) , we obtained the desired result. □

Locally Approximation Results

We recall a few functional spaces and functional relations in this part, such as Peetre’s K-functional [22], defined as
K 2 ( Φ , δ ) = inf Ψ C B 2 [ 0 , ) Φ Ψ C B [ 0 , ) + δ Ψ C B 2 [ 0 , ) ,
where C B 2 [ 0 , ) = { Ψ C B [ 0 , ) : Ψ , Ψ C B [ 0 , ) } associated with the norm Φ = sup 0 u < | Φ ( u ) | , and second-order Ditzian–Totik modulus of smoothness is presented by
ω 2 ( Φ ; δ ) = sup 0 < m δ sup u [ 0 , ) | Φ ( u + 2 m ) 2 Φ ( u + m ) + Φ ( u ) | .
We revisit a result from DeVore and Lorentz ([22], page no. 177, Theorem 2.4) as:
K 2 ( Φ ; δ ) C ω 2 ( Φ ; δ ) ,
where C is an absolute constant. To establish the next result, we consider the auxiliary operator defined as:
F ^ s ( Φ ; v ) = F s ( Φ ; v ) + Φ ( v ) Φ 1 s 1 1 1 e 1 + s v .
where Φ C B [ 0 , ) , v 0 , and s > 1 . From Equation (10), one can yield
F ^ s ( 1 ; v ) = 1 , F ^ s ( α 1 ( u ) ; v ) = 0   and   | F ^ s ( Φ ; v ) | 3 Φ .
Lemma 7.
If s > 2 and v 0 , we have
| F ^ s ( Φ ; v ) Φ ( v ) | θ ( v ) Φ ,
where Φ C B 2 [ 0 , ) and θ ( v ) = F ^ s ( α 1 ( u ) ; v ) + F s ( α 1 ( u ) ; v ) 2 .
Proof.  
For Φ C B 2 [ 0 , ) and by Taylor expansion, we get
Φ ( u ) = Φ ( v ) + ( u v ) Φ ( v ) + v u ( u q ) Φ ( q ) d q .
Implementing the auxiliary operators F ^ s ( . ; . ) introduced in Equation (10) to both sides of Equation (12), we obtain
F ^ s ( Φ ; v ) Φ ( v ) = Φ ( v ) F ^ s ( α 1 ( u ) ; v ) + F ^ s v u ( u q ) Φ ( q ) d q ; v .
Using Equations (11) and (12), one can yield
F ^ s ( Φ ; v ) Φ ( v ) = F ^ s v u ( u q ) Φ ( q ) d q ; v = F s v u ( u q ) Φ ( q ) d q ; v v s v + 1 1 e 1 s 1 s v + 1 1 e 1 s 1 q Φ ( q ) d q ,
| F ^ s ( Φ ; v ) Φ ( v ) | | F s v u ( u q ) Φ ( q ) d q ; v | + | v s v + 1 1 e 1 s 1 s v + 1 1 e 1 s 1 q Φ ( q ) d q | .
Since,
| v u ( u q ) Φ ( q ) d q | ( u v ) 2 Φ ,
then
| v s v + 1 1 e 1 s 1 s v + 1 1 e 1 s 1 q Φ ( q ) d q | s v + 1 1 e 1 s 1 v 2 Φ .
In accordance with (13)–(15), we accqire
| F ^ s ( Φ ; v ) Φ ( v ) | F ^ s ( α 1 ( u ) ; v ) + s v + 1 1 e 1 s 1 v 2 Φ = θ ( v ) Φ .
which concludes the desired result. □
Theorem 4.
For Φ C B [ 0 , ) , there exists non-negative constant C ˜ > 0 with
F s ( Φ ; v ) Φ ( v ) C ˜ ω 2 Φ ; θ ( v ) + ω ( F s ( α 1 ( u ) ; v ) ,
where θ ( v ) is given by Lemma 7.
Proof.  
For Ψ C B 2 [ 0 , ) and Φ C B [ 0 , ) and with the definition of F ^ s ( . ; . ) given in (10), we get
| F s ( Φ ; v ) Φ ( v ) | | F ^ s ( Φ Ψ ; v ) | + | ( Φ Ψ ) ( v ) | + | F ^ s ( Φ ; v ) Φ ( v ) | + | Φ 1 s 1 s v + 1 1 e 1 Φ ( v ) | .
In accordance with Lemma 7 and the inequalities mentioned in Equation (11), we acquire
| F s ( Φ ; v ) Φ ( v ) | 4 Φ Ψ + | F ^ s ( Φ ; v ) Φ ( v ) | + | Φ 1 s 1 s v + 1 1 e 1 Φ ( v ) | 4 Φ Ψ + θ ( v ) Ψ + ω F s ( u v ) ; v ) .
By employing Equation (9), we established the desired result. □
Now, we address the result in Lipschitz-type space presented by [25] as:
L i p K ˜ η 1 , η 2 ( ζ ) : = Φ L p [ 0 , ) : | Φ ( u ) Φ ( v ) | K ˜ | u v | ζ ( u + η 1 v + η 2 v 2 ) ζ 2 : v , u ( 0 , ) ,
where K ˜ > 0 , 0 < ζ 1 and η 1 , η 2 > 0 .
Theorem 5.
Consider linear positive operators in (4) and Φ L i p K ˜ η 1 , η 2 ( ζ ) , one can obtain
| F s ( Φ ; v ) Φ ( v ) | K ˜ λ ( v ) η 1 v + η 2 v 2 ζ 2 ,
where 0 < ζ 1 , η 1 , η 2 ( 0 , ) and λ ( v ) = F s ( α 2 ( u ) ; v ) .
Proof.  
For ζ = 1 and v 0 , we get
| F s ( Φ ; v ) Φ ( v ) | F s ( | Φ ( u ) Φ ( v ) | ; v ) K ˜ F s | u v | ( u + η 1 v + η 2 v 2 ) 1 2 ; v .
Since 1 u + η 1 v + η 2 v 2 < 1 η 1 v + η 2 v 2 , for each u , v ( 0 , ) , we acquire
| F s ( Φ ; v ) Φ ( v ) | K ˜ ( η 1 v + η 2 v 2 ) 1 2 ( F s ( α 2 ( u ) ; v ) 1 2 K ˜ λ ( v ) η 1 v + η 2 v 2 1 2 ,
which indicates that Theorem 5 is valid for ζ = 1 . Next, we examine the case where ζ ( 0 , 1 ) , and in accordance with Hölder’s inequality, by selecting p = 2 ζ and q = 2 2 ζ , we obtain
| F s ( Φ ; v ) Φ ( v ) | | F s ( | Φ ( u ) Φ ( v ) | 2 ζ ; v ) ζ 2 K ˜ F s | u v | 2 ( u + η 1 v + η 2 v 2 ) ; v ζ 2 .
Since 1 ( u + η 1 v + η 2 v 2 ) < 1 ( η 1 v + η 2 v 2 ) , for all v ( 0 , ) , one gets
| F s ( Φ ; v ) Φ ( v ) | K ˜ | F s ( Φ ; v ) Φ ( v ) | ( | u v | 2 ; v ) η 1 v + η 2 v 2 ζ 2 K ˜ λ ( v ) η 1 v + η 2 v 2 ζ 2 .
Thus, we conclude the desired result. □
Next, we address the local approximation in terms of the rth-order modulus of smoothness, followed by the Lipschitz-type maximal function introduced by Lenze [25] as:
ω ˜ r ( Φ ; v ) = sup u v , u ( 0 , ) | Φ ( u ) Φ ( v ) | | u v | r ,   v [ 0 , ) and r ( 0 , 1 ] .
Theorem 6.
Assume Φ L p [ 0 , ) and r ( 0 , 1 ] . Then, for every v [ 0 , ) , we get
| F s ( Φ ; v ) Φ ( v ) | ω ˜ r ( Φ ; v ) λ ( v ) r 2 .
Proof.  
It can be observed that
| F s ( Φ ; v ) Φ ( v ) | F s | Φ ( u ) Φ ( v ) | ; v ) .
By Equation (17), one gets
| F s ( Φ ; v ) Φ ( v ) | ω ˜ r ( Φ ; v ) F s ( | u v | r ; v ) .
Then, by employing Hölder’s inequality with p = 2 r and q = 2 2 r , we obtain
| F s ( Φ ; v ) Φ ( v ) | ω ˜ r ( Φ ; v ) F s ( | u v | 2 ; v ) r 2 .
Thus, we conclude the proof. □

4. Results of Global Approximation

Consider μ ( v ) = 1 + v 2 , 0 v < as the weight function. Then, B μ [ 0 , ) = { Φ ( v ) : | Φ ( v ) | K ˜ Φ ( 1 + v 2 ) , where the constant K ˜ Φ depends on Φ and C μ [ 0 , ) represents the continuous functional space in B μ [ 0 , ) along with the norm Φ μ = sup v [ 0 , ) | Φ ( v ) | μ ( v ) and C μ m ˜ [ 0 , ) = { Φ C μ [ 0 , ) : lim v Φ ( v ) μ ( v ) = m ˜ , where constant m ˜ depends on Φ .
If Φ is a function on closed interval [ 0 , b ] where b > 0 , then the Ditzian–Totik modulus of continuity is given as
ω b ( Φ , δ ) = sup | u v | δ sup v , u [ 0 , b ] | Φ ( u ) Φ ( v ) | .
It is straightforward to observe that, for any Φ C μ [ 0 , ) , the modulus of smoothness defined in Equation (18) tends to zero.
Theorem 7.
Let Φ C μ [ 0 , ) and ω b + 1 ( Φ ; δ ) denotes the modulus of smoothness defined on [ 0 , b + 1 ] [ 0 , ) . Then, for any u [ 0 , b ] , we obtain
F s ( . ; . ) Φ C [ 0 , b ] 4 K ˜ Φ ( 1 + b 2 ) δ s ( b ) + 2 ω b + 1 ( Φ ; δ s ( b ) ) ,
where δ s ( b ) = max v [ 0 , b ] F s ( α 2 ; v ) .
Proof. 
For any v [ 0 , b ] and u [ 0 , ) , one has
| Φ ( u ) Φ ( v ) | 4 K ˜ Φ ( 1 + b 2 ) ( u v ) 2 + 1 + | u v | δ ω b + 1 ( Φ ; δ ) .
Implementing operator F s ( . ; . ) on both sides, we acquire
| F s ( Φ ; v ) Φ ( v ) | 4 K ˜ Φ ( 1 + b 2 ) F s ( α 2 ; v ) + 1 + F s ( | u v | ; v ) δ ω b + 1 ( Φ ; δ ) .
Now, in accordance with Lemma 6 and v [ 0 , b ] , one has
| F s ( . ; . ) Φ | 4 K ˜ Φ ( 1 + b 2 ) δ s ( b ) + 1 + δ s ( b ) δ ω b + 1 ( Φ ; δ ) .
Selecting δ = δ s ( b ) , the desired result can be easily obtained. □
Remark 1.
We employ the test function defined by g ˜ j ( u ) = u j , j { 0 , 1 , 2 } .
Theorem 8
([21,26]). Assume that the sequence of linear positive operators ( P s ) s 1 mapping from C μ [ 0 , ) to B μ [ 0 , ) meets the conditions
lim s | | P s ( g ˜ j ; . ) g ˜ j | | μ = 0 , w h e r e j = 0 , 1 , 2 ;
thus, for g ˜ C μ m ˜ [ 0 , ) , we get
lim s | | P s ( g ˜ ; . ) g ˜ | | μ = 0 .
Theorem 9.
Let Φ C μ m ˜ [ 0 , ) . Then, we obtain
lim s F s ( Φ ; . ) Φ μ = 0 .
Proof. 
First verify that
lim s F s ( Φ j ; . ) Φ j μ = 0 ,   f o r   j = 0 , 1 , 2 .
Considering Lemma 5, one can see that F s ( Φ 0 ; . ) 1 μ = 0 , where s and s > 2 ; also
F s ( Φ 1 ; . ) g ˜ 1 μ ( v ) = sup v [ 0 , ) 1 μ ( v ) v + 1 s 1 v + e 2 e 1 v = 1 s 1 sup v [ 0 , ) v 1 + v 2 + 1 s 1 e 2 e 1 sup v [ 0 , ) 1 1 + v 2 .
For a large value of s , one gets F s ( Φ 1 ; . ) Φ 1 μ 0 .
Also,
F s ( Φ 2 ; . ) g ˜ 2 μ 3 s 2 ( s 1 ) ( s 2 ) sup v [ 0 , ) v 2 1 + v 2 + s ( 3 e 5 ) ( s 1 ) ( s 2 ) ( e 1 ) sup v [ 0 , ) v 1 + v 2 + 4 2 e ( s 1 ) ( s 2 ) ( e 1 ) 2 sup v [ 0 , ) 1 1 + v 2 ,
which implies that F s ( Φ 2 ; . ) Φ 2 μ 0 as s . Thus, we conclude the proof of Theorem 9 □
Theorem 10.
Let Φ C μ m ˜ [ 0 , ) and η > 0 . Then,
lim s sup v [ 0 , ) F s ( Φ ; v ) Φ ( v ) ( 1 + v 2 ) 1 + η = 0 .
Proof. 
Since | Φ ( v ) | Φ μ ( 1 + v 2 ) , for any real fixed number v 0 > 0 , we get
sup v [ 0 , ) F s ( Φ ; v ) Φ ( v ) ( 1 + v 2 ) 1 + η sup v v 0 F s ( Φ ; v ) Φ ( v ) ( 1 + v 2 ) 1 + η + sup v v 0 F s ( Φ ; v ) Φ ( v ) ( 1 + v 2 ) 1 + η F s ( Φ ; v ) Φ ( v ) | C [ 0 , v 0 ] + Φ μ sup v v 0 F s ( 1 + u 2 ; v ) ( 1 + v 2 ) 1 + η + sup v v 0 | Φ ( v ) | ( 1 + v 2 ) 1 + η = G 1 ˜ + G 2 ˜ + G 3 ˜ , s a y .
Now,
G 3 ˜ = sup v v 0 | Φ ( v ) | ( 1 + v 2 ) 1 + η sup v v 0 Φ μ ( 1 + v 2 ) ( 1 + v 2 ) 1 + η Φ μ ( 1 + v 0 2 ) η .
In view of Lemma 5, it gives
lim s sup v [ v 0 , ) F s ( 1 + u 2 ; v ) 1 + v 2 = 1 .
For any arbitrary ϵ > 0 , there exists s 1 N with
sup v [ v 0 , ) F s ( 1 + u 2 ; v ) 1 + v 2 ( 1 + v 0 2 ) η Φ μ ϵ 3 + 1 ,   for all s s 1 .
Therefore
G 2 ˜ = | | Φ | | μ sup v [ v 0 , ) F s ( 1 + u 2 ; v ) ( 1 + v 2 ) 1 + η | | Φ | | μ ( 1 + v 0 2 ) η + ϵ 3 ,   for all s s 1 .
Hence, we get
G 2 ˜ + G 3 ˜ < 2 Φ μ ( 1 + v 2 ) η + ϵ 3 .
If we take v 0 to be so large that Φ μ ( 1 + v 2 ) η < ϵ 6 , then we have
G 2 ˜ + G 3 ˜ < 2 ϵ 3   for all s s 1 .
Now, from Theorem 7, there corresponds s 2 > s with
G 1 ˜ = F s ( Φ ; · ) Φ C [ 0 , v 0 ] < ϵ 3   for all s 2 s .
Let s 3 = max ( s 1 , s 2 ) . Then, using Equations (19), (21), and (22), we get
sup v [ 0 , ) | F s ( Φ ; v ) Φ ( v ) | ( 1 + v 2 ) 1 + η < ϵ ,
which completes the proof. □

5. Properties of A-Statistical Approximation

We revisit some notations from [27]. Suppose that D = ( d s ν ) is an infinite, non-negative suitability matrix. Sequence v : = ( v ν ) is A-statistically convergent to L, denoted as s t D lim v = L , if for each ϵ > 0
lim s ν : | v ν L | ϵ d s ν = 0 .
Let b = ( b s ) be a sequence such that the following assertions are true:
s t D lim s b s = 1 and s t D lim s b s s = d , 0 d < 1 .
Theorem 11.
Consider D = ( d s ν ) to be a non-negative regular suitability matrix. Let sequence b = ( b s ) satisfy the condition (23), b s ( 0 , 1 ) , s N . Then, for every Φ C μ 0 [ 0 , ) , s t D lim s F s ( Φ ; . ) Φ μ = 0 .
Proof. 
In accordance with Lemma 5, one has s t D lim s F s ( Φ 0 ; . ) Φ 0 μ = 0 . and
F s ( Φ 1 ; . ) Φ 1 μ = sup v [ 0 , ) 1 1 + v 2 v + 1 s 1 v + e 2 e 1 v = 1 s 1 sup v [ 0 , ) v 1 + v 2 + 1 s 1 e 2 e 1 sup v [ 0 , ) 1 1 + v 2 .
Now,
S 1 ˜ : = s : F s ( Φ 1 ; . ) Φ 1 ϵ , S 2 ˜ : = s : 1 s 1 ϵ 2 , S 3 ˜ : = s : 1 s 1 e 2 e 1 ϵ 2 .
Here, S 1 ˜ S 2 ˜ S 3 ˜ ; this shows that ν S 1 ˜ d s ν ν S 2 ˜ d s ν + ν S 3 ˜ d s ν . Therefore, we get
s t D lim s F s ( Φ 1 ; . ) Φ 1 μ = 0 .
Now, by using Lemma 5, we have
F s ( Φ 2 ; . ) Φ 2 μ sup v [ 0 , ) 1 1 + v 2 | 3 s 2 ( s 2 ) ( s 1 ) v 2 + s ( 3 e 5 ) ( s 2 ) ( s 1 ) ( e 1 ) v + 4 2 e ( s 2 ) ( s 1 ) ( e 1 ) 2 | .
For a given ε > 0 , one has
H 1 : = s : F s ( Φ 2 ; . ) Φ 2 μ ϵ , H 2 : = s : 3 s 2 ( s 2 ) ( s 1 ) ϵ 3 , H 3 : = s : s ( 3 e 5 ) ( s 2 ) ( s 1 ) ( e 1 ) ϵ 3 , H 4 : = s : 4 2 e ( s 2 ) ( s 1 ) ( e 1 ) 2 ϵ 3 .
It can be observed that H 1 H 2 H 3 H 4 . Therefore, we acquire
ν H 1 d s ν ν H 2 d s ν + ν H 3 d s ν + ν H 4 d s ν .
As s , we have
s t D lim s F s ( Φ 2 ; . ) Φ 2 μ = 0 .
Thus, we conclude the proof of Theorem 11. □
Next, we will examine the convergence rate of A-Statistical approximation with respect to Peetre’s K-functional for the operators F s ( . ; . ) .
Theorem 12.
Let Φ C B 2 [ 0 , ) . Then,
s t D lim s F s ( Φ ; · ) Φ C B [ 0 , ) = 0 .
Proof. 
Considering Taylor’s result, one has
Φ ( u ) = Φ ( v ) + Φ ( v ) ( u v ) + 1 2 Φ ( ζ ) ( u v ) 2 ,
where u ζ v . Operating F s ( . ; . ) , on both sides, we acquire
F s ( Φ ; v ) Φ ( v ) = Φ ( v ) F s ( ζ 1 ; v ) + 1 2 Φ ( ζ ) F s ( ζ 2 ; v ) ,
which yields
F s ( Φ ; · ) Φ C B [ 0 , ) Φ C B [ 0 , ) F s ( Φ 1 , . ) C B [ 0 , ) + Φ C B [ 0 , ) F s ( Φ 1 , . ) 2 C B [ 0 , ) = Q ˜ 1 + Q ˜ 2 , s a y .
By (24) and (25), it follows that
lim s ν N : Q 1 ˜ ϵ 2 d s ν = 0 , lim s ν N : Q 2 ˜ ϵ 2 d s ν = 0 .
From (26), one gets
lim s ν N : F s ( Φ ; · ) Φ C B [ 0 , ) ϵ d s ν lim s ν N : Q 1 ˜ ϵ 2 d s ν + lim s ν N : Q 2 ˜ ϵ 2 d s ν .
Thus, s t D lim s F s ( Φ ; · ) Φ C B [ 0 , ) 0 as s .
Hence, we acquire the desired proof. □
Theorem 13.
Let Φ C B 2 [ 0 , ) . Then,
F s ( Φ ; · ) Φ C B [ 0 , ) K ˜ ω 2 ( Φ ; δ ) ,
where δ = F s ( Φ 1 · ; · ) C B [ 0 , ) + F s ( Φ 1 · ) 2 ; · ) C B [ 0 , ) , and Φ C B 2 [ 0 , ) = Φ C B [ 0 , ) + Φ C B [ 0 , ) + Φ C B [ 0 , ) .
Proof. 
Let Ψ C B 2 [ 0 , ) . By applying Equation (26), one obtains
F s ( Ψ ) Ψ C B [ 0 , ) Ψ C B [ 0 , ) F s ( Φ 1 · ) ; · ) C B [ 0 , ) + 1 2 Ψ C B [ 0 , ) F s ( Φ 1 · ) 2 ; · ) C B [ 0 , ) δ Ψ C B 2 [ 0 , ) .
For each Φ C B [ 0 , ) and Ψ C B 2 [ 0 , ) , using Equation (27), we acquire
F s ( Φ ; · ) Φ C B [ 0 , ) F s ( Φ ; · ) F s ( Ψ ; · ) C B [ 0 , ) + F s ( Ψ ; · ) Ψ C B [ 0 , ) + Ψ Φ C B [ 0 , ) 2 Ψ Φ C B [ 0 , ) + F s ( Ψ ; · ) Ψ C B [ 0 , ) 2 Ψ Φ C B [ 0 , ) + δ Ψ C B 2 [ 0 , ) .
Considering Peetre’s K-functional, one obtains
F s ( Φ ; · ) Φ C B [ 0 , ) 2 K ˜ 2 ( Φ ; δ )
and
F s ( Φ ; · ) Φ C B [ 0 , ) K ˜ ω 2 ( Φ ; δ ) + min ( 1 , δ ) Φ C B [ 0 , ) .
In view of Equation (25), we have
s t D lim s δ = 0 , thus s t D lim s ω ( Φ ; δ ) = 0 ,
which concludes the proof of the desired result. □

6. Numerical Observations

To confirm the theoretical approximation outcomes, numerical experiments are conducted. This section includes a series of simulations showcasing the proposed operators’ precision and effectiveness. We analyze their behavior across multiple benchmark functions and draw comparisons. The experimental data validate the theoretical developments and demonstrate the practical strength of the suggested method. In the graphical representation, we consider F s ( Φ ; v ) = F s ( Φ ; v ) .
Example 1.
Consider the function Φ ( v ) = v 2 . Using MATLAB R2015a on a standard HP laptop equipped with an Intel Core i7 processor and 8 GB of RAM, we compute the operator F s ( Φ ; v ) for values of v ranging from 5 to 15, and for distinct values of the parameter s, namely s = 10 ,   20 ,   30 ,   40 . In Figure 1, we present the approximation behavior of the operator for the function v 2 , which demonstrates how the operator acts on this specific test function. Additionally, we calculated the absolute error between the exact function and its approximation using the same parameters, | F s ( Φ ; v ) v 2 | , and the results are depicted in Figure 2 and also provided in Table 1 for the same. This helps illustrate the convergence behavior and accuracy of the operator with respect to the increase in parameter s.
Example 2.
Consider the function Φ ( v ) = sin v . Using MATLAB R2015a on a standard HP laptop equipped with an Intel Core i7 processor and 8 GB of RAM, we compute the operator F s ( Φ ; v ) for values of v ranging from 0 to 20, and for distinct values of the parameter s, namely s = 15 , 20 , 30 . In Figure 3, we present the approximation behavior of the operator for the function sin v , which demonstrates how the operator acts on this specific test function. This helps illustrate the convergence behavior and accuracy of the operator with respect to the increase in parameter s.

7. Conclusions

In this paper, we introduce a sequence of positive linear operators formulated using Frobenius–Euler–Şimşek-type polynomials in integral form. These operators, referred to as Szász–Beta type operators and defined in (4), are constructed to approximate functions defined on Lebesgue measurable spaces. We establish essential estimates to analyze the rate of convergence and the accuracy of approximation. Furthermore, we investigate various aspects of approximation theory, including both local and global results, as well as A-statistical convergence properties. To demonstrate the effectiveness and applicability of the proposed operators, we present several illustrative examples and visualize the results graphically. These examples highlight the practical behavior and confirm the validity of our theoretical findings across different functional settings.

Author Contributions

Conceptualization, N.R.; Software, M.F.; Writing—original draft, N.R. and S.B.; Writing—review & editing, M.F. and S.B. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded by the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2025).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The Researchers would like to thank the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support (QU-APC-2025).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Weierstrass, K. Über die Analytische Darstellbarkeit Sogenannter Willkürlicher Functionen einer Reellen Veränderlichen; Sitzungsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin: Berlin, Germany, 1885; Volume 2, pp. 633–639. [Google Scholar]
  2. Bernstein, S.N. Démonstration du théorème de Weierstrass fondée sur le calcul de probabilités. Commun. Kharkov Math. Soc. 1912, 13, 1–2. [Google Scholar]
  3. Szász, O. Generalization of Bernstein’s polynomials to the infinite interval. J. Res. Nat. Bur. Stds. 1950, 45, 239–245. [Google Scholar] [CrossRef]
  4. Özger, F. Weighted statistical approximation properties of univariate and bivariate λ-Kantorovich operators. Filomat 2019, 33, 3473–3486. [Google Scholar] [CrossRef]
  5. Aslan, R. Approximation by Szász Mirakjan Durrneyer operators based on shape parameter λ. Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat. 2022, 71, 407–421. [Google Scholar] [CrossRef]
  6. Acu, A.M.; Gonska, H.; Raşa, I. Grüss-type and Ostrowski-type inequalities in approximation theory. Ukr. Math. J. 2011, 63, 843–864. [Google Scholar] [CrossRef]
  7. Acu, A.M.; Acar, T.; Radu, V.A. Approximation by modified U n ρ operators. Rev. R. Acad. Ciene. Exactas Fis. Nat. Ser. A Math. RACSAM 2019, 113, 2715–2729. [Google Scholar] [CrossRef]
  8. Mohiuddine, S.A.; Acar, T.; Alotaibi, A. Construction of a new family of Bernstein-Kantorovich operators. Math. Methods Appl. Sci. 2017, 40, 7749–7759. [Google Scholar] [CrossRef]
  9. Mohiuddine, S.A.; Ahmad, N.; Özger, F.; Alotaibi, A.; Hazarika, B. Approximation by the parametric generalization of Baskakov–Kantorovich operators linking with Stancu operators. Iran. J. Sci. Technol. Trans. 2021, 45, 593–605. [Google Scholar] [CrossRef]
  10. Mursaleen, M.; Ansari, K.J.; Khan, A. Approximation properties and error estimation of q-Bernstein shifted operators. Numer. Algorithms 2020, 84, 207–227. [Google Scholar] [CrossRef]
  11. Mursaleen, M.; Naaz, A.; Khan, A. Improved approximation and error estimations by King type (p, q)-Szász-Mirakjan Kantorovich operators. Appl. Math. Comput. 2019, 348, 2175–2185. [Google Scholar] [CrossRef]
  12. Khan, A.; Mansoori, M.; Khan, K.; Mursaleen, M. Phillips-type q-Bernstein operators on triangles. J. Funct. Spaces 2021, 2021, 6637893. [Google Scholar] [CrossRef]
  13. Nasiruzzaman, M. Approximation properties by Szász–Mirakjan operators to bivariate functions via Dunkl analogue. Iran. J. Sci. Technol. Trans. 2021, 45, 259–269. [Google Scholar] [CrossRef]
  14. Rao, N.; Farid, M.; Ali, R. Study of Szász–Durremeyer-Type Operators Involving Adjoint Bernoulli Polynomials. Mathematics 2024, 12, 3645. [Google Scholar] [CrossRef]
  15. Rao, N.; Farid, M.; Raiz, M. Symmetric Properties of λ-Szász Operators Coupled with Generalized Beta Functions and Approximation Theory. Symmetry 2024, 16, 1703. [Google Scholar] [CrossRef]
  16. Rao, N.; Farid, M.; Raiz, M. Approximation Results: Szász– Kantorovich Operators Enhanced by Frobenius–Euler–Type Polynomials. Axioms 2025, 14, 252. [Google Scholar] [CrossRef]
  17. Rao, N.; Farid, M.; Raiz, M. On the Approximations and Symmetric Properties of Frobenius–Euler–Şimşek Polynomials Connecting Szász Operators. Symmetry 2025, 17, 648. [Google Scholar] [CrossRef]
  18. Simsek, Y. Applications of constructed new families of generating-type functions interpolating new and known classes of polynomials and numbers. Math. Methods Appl. Sci. 2021, 44, 11245–11268. [Google Scholar] [CrossRef]
  19. Simsek, Y. On generating functions for the special polynomials. Filomat 2017, 31, 9–16. [Google Scholar] [CrossRef]
  20. Simsek, Y. Construction of some new families of Apostol-type numbers and polynomials via Dirichlet character and p-adic q-integrals. Turk. J. Math. 2018, 42, 557–577. [Google Scholar] [CrossRef]
  21. Gadjiev, A.D. The convergence problem for a sequence of positive linear operators on bounded sets and theorems analogous to that of P. P. Korovkin. Dokl. Akad. Nauk SSSR 1974, 218, 1001–1004. [Google Scholar]
  22. DeVore, R.A.; Lorentz, G.G. Constructive Approximation; Grudlehren der Mathematischen Wissenschaften Fundamental Principales of Mathematical Sciences; Springer: Berlin, Germany, 1993. [Google Scholar]
  23. Korovkin, P.P. On convergence of linear positive operators in the space of continuous functions. Dokl. Akad. Nauk. SSSR 1953, 90, 961–964. [Google Scholar]
  24. Shisha, O.; Mond, B. The degree of convergence of linear positive operators. Proc. Nat. Acad. Sci. USA 1968, 60, 1196–1200. [Google Scholar] [CrossRef] [PubMed]
  25. Lenze, B. On Lipschitz type maximal functions and their smoothness spaces. Nederl Akad Indag Math. 1988, 50, 53–63. [Google Scholar] [CrossRef]
  26. Gadjiev, A.D. On P. P. Korovkin type theorems. Mat. Zametki 1976, 20, 781–786, reprinted in Transl. in Math. Notes 1978, 56, 995–998. [Google Scholar]
  27. Gadjiev, A.D.; Orhan, C. Some approximation theorems via statistical convergence. Rocky Mt. J. Math. 2007, 32, 129–138. [Google Scholar] [CrossRef]
Figure 1. Plot for F s ( Φ ; v ) and v 2 at s = 10 ,   20 ,   30 ,   40 .
Figure 1. Plot for F s ( Φ ; v ) and v 2 at s = 10 ,   20 ,   30 ,   40 .
Axioms 14 00418 g001
Figure 2. Absolute errors: | F s ( Φ ; v ) v 2 | .
Figure 2. Absolute errors: | F s ( Φ ; v ) v 2 | .
Axioms 14 00418 g002
Figure 3. Plot for F s ( Φ ; v ) and sin v at s = 15 ,   20 ,   30 .
Figure 3. Plot for F s ( Φ ; v ) and sin v at s = 15 ,   20 ,   30 .
Axioms 14 00418 g003
Table 1. Absolute errors for distinct s.
Table 1. Absolute errors for distinct s.
v | F s ( Φ ; v ) v 2 |
s = 10
| F s ( Φ ; v ) v 2 |
s = 20
| F s ( Φ ; v ) v 2 |
s = 30
| F s ( Φ ; v ) v 2 |
s = 40
510.99044.77513.04792.2380
5.025011.09454.82053.07682.2592
5.050111.19914.86603.10592.2805
5.075111.30424.91173.13512.3020
5.100211.40984.95763.16442.3235
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

Rao, N.; Farid, M.; Bansal, S. Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials. Axioms 2025, 14, 418. https://doi.org/10.3390/axioms14060418

AMA Style

Rao N, Farid M, Bansal S. Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials. Axioms. 2025; 14(6):418. https://doi.org/10.3390/axioms14060418

Chicago/Turabian Style

Rao, Nadeem, Mohammad Farid, and Shivani Bansal. 2025. "Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials" Axioms 14, no. 6: 418. https://doi.org/10.3390/axioms14060418

APA Style

Rao, N., Farid, M., & Bansal, S. (2025). Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials. Axioms, 14(6), 418. https://doi.org/10.3390/axioms14060418

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