Next Article in Journal
Searching for Optimal Oversampling to Process Imbalanced Data: Generative Adversarial Networks and Synthetic Minority Over-Sampling Technique
Previous Article in Journal
Deep Learning Model for Multivariate High-Frequency Time-Series Data: Financial Market Index Prediction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Unveiling the Potential of Sheffer Polynomials: Exploring Approximation Features with Jakimovski–Leviatan Operators

by
Mohra Zayed
1,
Shahid Ahmad Wani
2,* and
Mohammad Younus Bhat
3,*
1
Mathematics Department, College of Science, King Khalid University, Abha 61413, Saudi Arabia
2
Department of Applied Sciences, Symbiosis Institute of Technology, Symbiosis International (Deemed University) (SIU), Pune 412115, India
3
Department of Mathematical Sciences, Islamic University of Science and Technology, Kashmir 192122, India
*
Authors to whom correspondence should be addressed.
Submission received: 6 July 2023 / Revised: 14 August 2023 / Accepted: 14 August 2023 / Published: 21 August 2023

Abstract

:
In this article, we explore the construction of Jakimovski–Leviatan operators for Durrmeyer-type approximation using Sheffer polynomials. Constructing positive linear operators for Sheffer polynomials enables us to analyze their approximation properties, including weighted approximations and convergence rates. The application of approximation theory has earned significant attention from scholars globally, particularly in the fields of engineering and mathematics. The investigation of these approximation properties and their characteristics holds considerable importance in these disciplines.

1. Introduction and Preliminaries

The Approximation theory, which serves as a vital connection between pure and practical mathematics, has recently benefitted a variety of computer techniques. It covers the optimal method for approximating functions utilizing more straightforward or accessible functions and processes based on the use of contemporary approximation technology. In many situations requiring the approximation of continuous functions, positive approximation techniques naturally emerge. This is especially true when additional qualitative features, such as monotonicity, convexity, pattern preservation, etc., are required.
To address practical and theoretical inquiries in various fields, such as measurement theory, partial differential equations (PDEs), and probability theory, the positive approximation methods introduced by Korovkin [1] have emerged as crucial techniques. Korovkin’s 1953 development of a simple and effective criterion for determining if a given series of positive linear operators on a space, C [ 0 , 1 ] , is an approximation process, i.e., if K l ( h ) h uniformly on [ 0 , 1 ] for every h C [ 0 , 1 ] , has had significant implications. This methodology has been extended to abstract spaces, like Banach lattices, Banach algebras, and Banach spaces, making it applicable in diverse contexts. Numerous researchers have explored the properties and convergence rates of Korovkin-type approximations. Notable contributions can be found in works such as [1,2,3,4,5,6,7,8,9,10,11]. These studies have provided valuable insights into approximation theory. Additionally, the literature offers further valuable information on approximation theories, as can be seen in references such as [12,13,14,15,16].
Appell polynomials [17] are a special set of functions used in mathematical analysis and various areas of applied mathematics. They are often used to represent and approximate other functions in a given context. These polynomials have important properties that make them useful in different mathematical and engineering applications. These polynomials are given by the generating relation:
J ( ρ ) exp u ρ = k = 0 J k ( u ) ρ k k ! ,
where J ( ρ ) is expressed as follows:
J ( ρ ) = k = 0 J k ρ k k ! , ρ 0 0 .
Recently, substantial strides and breakthroughs have emerged in the expansion of mathematical physics, with a particular focus on the realm of special functions. This modern evolution has established a robust analytical framework, serving as the bedrock for solving a multitude of intricate problems in the spheres of mathematical physics and engineering. These strides have reverberated across an array of domains, showcasing their versatile applications. Notably, the introduction of special functions endowed with approximation properties stands as a pivotal leap forward within the special functions theory. These functions have garnered acknowledgment for their paramount significance and pertinence in both pragmatic real-world applications and the realm of pure mathematics.
Karaisa [18] introduced Durrmeyer-type Jakimovski–Leviatan operators for a specified special polynomial sequence and, thus, are designed to operate on these special class of mathematical functions called Appell polynomials, given by Expression (1), denoted as j k ( u ) , where k is a non-negative integer or zero.
The operators introduced by Karaisa are named after Durrmeyer, Jakimovski, and Leviatan, which suggests that these operators may have been inspired by or are related to the works of these mathematicians. The specific details of these operators and their properties are elaborated in [18].
The scope of application for these operators is restricted to real-valued continuous and bounded functions. In other words, the functions they operate on are defined for all non-negative real numbers and do not exhibit extreme behavior or fluctuations. This choice of function class is common in mathematical analysis, as it allows for well-behaved and manageable mathematical operations.
Moreover, the functions on which these operators act are defined on the interval, [ 0 , ) . This interval spans from 0 to positive infinity and is often used when dealing with functions that have positive domain values or grow without bounds. These operators were specifically designed for real-valued continuous and bounded functions, f, defined on the interval, [ 0 , ) :
L n ( f ; u ) = e n u r ( 1 ) k = 0 j k ( n u ) B ( n + 1 , k ) 0 ρ k 1 ( 1 + ρ ) n + k + 1 f ( ρ ) d ρ , u 0 .
Here, B ( k + 1 , n ) denotes the Beta function, which is defined as follows:
B ( η , ϑ ) = 0 ρ η 1 ( 1 + ρ ) η + ϑ d ρ = Γ ( η ) Γ ( ϑ ) Γ ( η + ϑ ) , η , ϑ 0 .

2. Construction of Operators

Building upon Karaisa’s research [18], we develop positive linear operators utilizing Sheffer polynomials [19]. These polynomials possess generating expressions of the following form:
r ( ρ ) e u H ( ρ ) = k = 0 S k ( u ) ρ k ,
where the analytical functions r and H are defined as follows:
r ( ρ ) = k = 0 r k ρ k , r 0 0 ,
H ( ρ ) = k = 0 h k ρ k , h 1 0 ( k 0 ) .
The Sheffer polynomials fulfilling our restriction are listed as follows:
(i)
r ( 1 ) 0 , r m k h k r ( 1 ) 0 , 0 k m , m = 0 , 1 , 2 ,
(ii)
The generating function (3) and the power series presented above converge for values of
| ρ | < R ; R > 1 .
Additionally, the following method is used to introduce the positive linear operators using S k ( u ) polynomials while taking the aforementioned limitations into account:
( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) 0 ρ k 1 ( 1 + ρ ) n + k + 1 f ( ρ ) d ρ = : T n ( f ; u ) ,
where u 0 and n N .
Remark 1.
For H ( ρ ) = e ρ , H ( 1 ) = 1 a n d S k ( n u ) = j k ( n u ) , in this case the operator (8) reduces to the operator given by (3).
Remark 2.
For H ( ρ ) = e ρ , g ( ρ ) = 1 and S k ( n u ) = ( n u ) k k ! we obtain the S z ´ asz operators [10].

3. Approximation Properties of T n Operators

Significant advancements in the convergence of sequences, ( K n ( f , u ) ) n = 1 , where K n ( f , u ) represents positive linear operators, were made by Korovkin. Notably, if K n ( f , u ) uniformly converges to f in specific scenarios, such as 1 , ρ , ρ 2 or 1 , cos ρ , sin ρ f ( ρ ) , it also exhibits this convergence behavior for any given function, f.
Our goal is to prove the convergence theorem and determine the order of convergence for the operators T n ( f ; u ) , as given in Equation (8).
Lemma 1.
We extract the succeeding generating expression from (3) as follows:
r ( 1 ) e n u H ( 1 ) = k = 0 S k ( n u ) , r ( 1 ) + n u r ( 1 ) e n u H ( 1 ) = k = 0 k S k ( n u ) , n 2 u 2 r ( 1 ) + 2 r ( 1 ) + r ( 1 ) H ( 1 ) + r ( 1 ) n u + r ( 1 ) + r ( 1 ) e n u H ( 1 ) = k = 0 k 2 S k ( n u ) ,
r ( 1 ) n 3 u 3 + r ( 1 ) H ( 1 ) + 3 r ( 1 ) H ( 1 ) + 3 r ( 1 ) + r ( 1 ) + 6 r ( 1 ) + 3 r ( 1 ) H ( 1 ) n u + 3 r ( 1 ) H ( 1 ) + 3 r ( 1 ) + 3 r ( 1 ) n 2 u 2 + r ( 1 ) + 3 r ( 1 ) + r ( 1 ) + 3 r ( 1 ) e n u H ( 1 ) = k = 0 k 3 S k ( n u ) , r ( 1 ) n 4 u 4 + 4 r ( 1 ) + 6 r ( 1 ) H ( 1 ) + 1 n 3 u 3 + ( 6 r ( 1 ) + r ( 1 ) 12 H ( 1 ) + 18 + 3 ( H ( 1 ) ) 2 + 4 H ( 1 ) + 18 H ( 1 ) + 7 r ( 1 ) ) n 2 u 2 + ( 4 r ( 1 ) + 6 H ( 1 ) + 18 r ( 1 ) + 4 H ( 1 ) + 18 H ( 1 ) + 14 r ( 1 ) + H ( 1 ) + 6 H ( 1 ) + 7 H ( 1 ) + 1 r ( 1 ) ) n u + r ( 1 ) + 6 r ( 1 ) + 7 r ( 1 ) + r ( 1 ) e n u H ( 1 ) = k = 0 k 4 S k ( n u ) .
Lemma 2.
For all u [ 0 , ) and e i = ρ i , we have the following:
T n ( e 0 ; u ) = 1 ,
T n ( e 1 ; u ) = u + A 0 n ,
T n ( e 2 ; u ) = 1 𝘍 1 n 2 u 2 + n u B 0 + C 0 ,
T n ( e 3 ; u ) = 1 𝘍 2 n 3 u 3 + n 2 u 2 A 1 + n u A 2 + A 3 ,
T n ( e 4 ; u ) = 1 𝘍 3 n 4 u 4 + n 3 u 3 B 1 + n 2 u 2 B 2 + n u B 3 + B 4 ,
where
e n = ρ n , A 0 = r ( 1 ) r ( 1 ) , B 0 = 2 r ( 1 ) + 2 r ( 1 ) H ( 1 ) r ( 1 ) r ( 1 ) , C 0 = r ( 1 ) + 2 r ( 1 ) r ( 1 )
and
A 1 = 3 r ( 1 ) + r ( 1 ) ( 6 + 3 H ( 1 ) ) r ( 1 ) , A 2 = 3 r ( 1 ) + r ( 1 ) ( 12 + 3 H ( 1 ) ) + r ( 1 ) ( H ( 1 ) + 6 H ( 1 ) + 5 ) r ( 1 ) , A 3 = r ( 1 ) + 6 r ( 1 ) + 5 r ( 1 ) r ( 1 ) ,
B 1 = 4 r ( 1 ) + r ( 1 ) ( 12 + 6 H ( 1 ) ) r ( 1 ) , B 2 = 6 r ( 1 ) + r ( 1 ) ( 36 + 12 H ( 1 ) ) + r ( 1 ) ( 4 H ( 1 ) + 3 ( H ( 1 ) ) 2 + 36 H ( 1 ) + 32 ) r ( 1 ) , B 3 = 4 r 3 ( 1 ) + 36 r ( 1 ) + 64 r ( 1 ) + 17 r ( 1 ) r ( 1 ) , B 4 = r 4 ( 1 ) + 12 r 3 ( 1 ) + 32 r ( 1 ) + 17 r ( 1 ) r ( 1 )
and
𝘍 n = Π i = 0 n ( n i ) .
Proof. 
Substituting f ( ρ ) = 1 into operator Equation (8), we obtain the following expression:
T n ( e 0 ; u ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) 0 ρ k 1 ( 1 + ρ ) n + k + 1 d ρ = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( k , n + 1 ) B ( n + 1 , k ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) e n u H ( 1 ) r ( 1 ) = 1 .
By substituting f ( ρ ) = ρ into operator Equation (8), we obtain the following expression:
T n ( e 1 ; u ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) 0 ρ k ( 1 + ρ ) n + k + 1 d ρ = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) B ( n , k + 1 ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) k n = e n u H ( 1 ) n r ( 1 ) k = 0 k S k ( n u ) = u + r ( 1 ) n r ( 1 ) = u + A 0 n .
By substituting f ( ρ ) = ρ 2 into operator Equation (8), it follows that
T n ( e 2 ; u ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) 0 ρ k + 1 ( 1 + ρ ) n + k + 1 d ρ = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) B ( n 1 , k + 2 ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) k + k 2 𝘍 1 = e n u H ( 1 ) 𝘍 1 r ( 1 ) k = 0 k S k ( n u ) + k 2 S k ( n u ) = e n u H ( 1 ) 𝘍 1 [ n 2 u 2 r ( 1 ) + n u 2 r ( 1 ) + r ( 1 ) ( 2 + H ( 1 ) ) + r ( 1 ) + ( r ( 1 ) ) 2 + n u r ( 1 ) ] e n u H ( 1 ) = 1 𝘍 1 n 2 u 2 + n u B 0 + C 0 .
Consequently, by substituting f ( ρ ) = ρ 3 into operator Equation (8), we obtain the following expression:
T n ( e 3 ; u ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) 0 ρ k + 2 ( 1 + ρ ) n + k + 1 d ρ = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) B ( n 2 , k + 3 ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) k + 3 k 2 + k 3 𝘍 2 = e n u H ( 1 ) 𝘍 2 r ( 1 ) k = 0 k S k ( n u ) + 3 k 2 S k ( n u ) + k 3 S k ( n u ) = e n u H ( 1 ) 𝘍 2 n 3 u 3 + n 2 u 2 A 1 + n u A 2 + A 3
Again, put f ( ρ ) = ρ 4 in operator Equation (8), we have the following:
T n ( e 4 ; u ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) 0 ρ k + 3 ( 1 + ρ ) n + k + 1 d ρ = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) B ( n + 1 , k ) B ( n 3 , k + 4 ) = ( r ( 1 ) ) 1 exp n u H ( 1 ) k = 0 S k ( n u ) 3 k + 7 k 2 + 6 k 3 + k 4 𝘍 3 = e n u H ( 1 ) 𝘍 3 r ( 1 ) k = 0 3 k S k ( n u ) + 7 k 2 S k ( n u ) + 6 k 3 S k ( n u ) + k 4 S k ( n u ) = e n u H ( 1 ) 𝘍 3 n 4 u 4 + n 3 u 3 B 1 + n 2 u 2 B 2 + n u B 3 + B 4 .
Lemma 3.
The following identities hold for the operators, T n ( f ; u ) , and for u [ 0 , ) :
T n ( s u ; u ) = A 0 n ,
T n ( ( s u ) 2 ; u ) = u 2 + 2 u + 4 H ( 1 ) n 1 + 2 u r ( 1 ) n ( n 1 ) r ( 1 ) + r ( 1 ) + 2 r ( 1 ) n ( n 1 ) r ( 1 )
T n ( ( s u ) 4 ; u ) = n 4 𝘍 3 4 n 3 𝘍 2 + 6 n 2 𝘍 1 4 + 1 u 4 + n 3 𝘍 3 B 1 4 n 2 𝘍 2 A 1 + 6 n 𝘍 1 B 0 4 A 0 𝘍 0 u 3 + n 2 𝘍 3 B 2 4 n 𝘍 2 A 2 + 6 C 0 𝘍 1 u 2 + n 𝘍 3 B 3 4 A 3 𝘍 2 u + B 4 𝘍 3
where A 0 , B 0 , C 0 , A 1 , A 2 , A 3 , B 1 , B 2 , B 3 , B 4 , and 𝘍 1 are given by Equations (14)–(17).
Proof. 
Due to the linearity property of T n , it can be inferred that
T n ( s u ; u ) = T n ( s ; u ) u T n ( 1 ; u ) , T n ( ( s u ) 2 ; u ) = T n ( s 2 ; u ) 2 u T n ( s ; u ) + u 2 T n ( 1 ; u ) , T n ( ( s u ) 4 ; u ) = T n ( s 4 ; u ) 4 u T n ( s 3 ; u ) + 6 u 2 T n ( s 2 ; u ) , 4 u 3 T n ( s ; u ) + u 4 T n ( 1 ; u ) ,
By utilizing Lemma (2), we can deduce statements (22), (23), and (24) accordingly. □
Theorem 1.
For f C [ 0 , ) E and | f ( u ) | c e A u , then lim n T n ( f ; u ) = f ( u ) and the operators, T n , converge uniformly in each compact subset of [ 0 , ) , where E : = f : for all u [ 0 , ) , A R , and c R + .
Proof. 
Considering Lemma (2), it can be deduced that
lim n T n ( e i , u ) = u i , i = 0 , 1 , 2 .
Uniform convergence is verified on every compact subset of [ 0 , ) . By applying Korovkin’s theorem, we obtain the desired result. □

4. Order of Convergence

By employing the definitions of modulus II of continuity and Peetre’s K -functional, along with the lemmas of Gavrea and Raşa [2] and Zhuk [20], the following conclusions can be drawn:
Theorem 2.
Consider a function, fm defined on C [ 0 , a ] . We can establish the following results:
| T n ( f ; u ) f ( u ) | 2 h 2 a | | f | | + 3 4 ( a + 2 + h 2 ) w 2 ( f ; h ) ,
where
T n ( ( s u ) 2 ; u ) 4 = h : = h n ( u ) .
Proof. 
Let us consider the second-order Steklov function, f h , associated with f. Consequently, with the presence of Expression (9), we can deduce the following:
| T n ( f ; u ) f ( u ) | | T n ( f f h ; u ) | + | f h ( u ) f ( u ) | + | T n ( f h ; u ) f h ( u ) | , | T n ( f h ; u ) f h ( u ) | + 2 | | f h f | | .
By utilizing the inequality, | | g h g | | 3 4 W 2 ( g ; h ) becomes
| T n ( f ; u ) f ( u ) | 3 2 w 2 ( f ; h ) + | T n ( f h ; u ) f h ( u ) | .
Considering that f h C 2 [ 0 , a ] , we can infer the following from Lemma (12):
| T n ( f h ; u ) f h ( u ) | | | f h | | T n ( ( s u ) 2 ; u ) + 1 2 | | f h | | T n ( ( s u ) 2 ; u ) ,
By utilizing the inequality, | | g h | | 3 2 h 2 W 2 ( g ; h ) , Expression (28) gives
| T n ( f h ; u ) f h ( u ) | | | f h | | T n ( ( s u ) 2 ; u ) + 3 4 h 2 w 2 ( f ; h ) T n ( ( s u ) 2 ; u ) .
Furthermore, by utilizing inequality
| | f h | | 2 η | | f h | | + a 2 | | f h | | ,
in combination with | | g h | | 3 2 h 2 W 2 ( g ; h ) gives
| | f h | | 2 a | | f | | + 3 a 4 h 2 w 2 ( f ; h ) .
By incorporating inequality (30) into inequality (29) and setting h = T n ( ( s u ) 2 ; u ) 4 , we obtain the following:
| T n ( f h ; u ) f h ( u ) | 2 a | | f | | h 2 + 3 4 ( a + h 2 ) w 2 ( f ; h ) .
By employing inequality (31) and inequality (27), we can establish assertion (25). □
Theorem 3.
If f C B 2 [ 0 ) , then
| T n ( f ; u ) f ( u ) | ξ | | f | | C B 2 ,
where
ξ : = ξ n ( u ) = 1 n 1 u 2 2 + n ( 1 + H ( 1 ) 2 ) + r ( 1 ) r ( 1 ) u n + r ( 1 ) 2 + r ( 1 ) n r ( 1 ) .
Proof. 
By leveraging the linearity property of the operator, T n ; Taylor’s expansion of f; and statement (9), the following becomes apparent:
T n ( f ; u ) f ( u ) = f ( u ) T n ( s u ; u ) + 1 2 f ( η ) T n ( ( s u ) 2 ; u ) , η ( u , s ) .
Based on Lemma (2), the following can be observed:
T n ( s u ; u ) = A 0 n 0
For s u , by incorporating Lemma (2) and (11) into (33), we can express this as follows:
| T n ( f ; u ) f ( u ) | r ( 1 ) n r ( 1 ) | | f | | C B + 1 2 u 2 + 2 u + u H ( 1 ) n 1 + 2 u r ( 1 ) n ( n 1 ) r ( 1 ) + r ( 1 ) + 2 r ( 1 ) n ( n 1 ) r ( 1 ) | | f | | C B 2 .
This concludes the proof. □
Corollary 1.
Let f C B [ 0 , ) ; thus, one has
| T n ( f ; u ) f ( u ) | 2 M { w 2 ( f ; δ ) + m i n ( 1 , δ ) | | f | | C B } ,
where
δ : = 1 2 ξ n ( u ) = δ n ( u )
Moreover, the constant, M 0 , remains fixed and is independent of both f and δ. Additionally, ξ n ( u ) exhibits similarity to that of Theorem (3).
Proof. 
Let us consider g C B 2 [ 0 , ) . According to Theorem (3), we obtain the following:
| T n ( f ; u ) f ( u ) | | T n ( f r ; u ) | + | T n ( r ; u ) r ( u ) | + | r ( u ) f ( u ) | 2 | | f r | | C B + ξ | | r | | C B 2 = 2 | | f r | | C B + δ | | r | | C B 2
As the left-hand side is not influenced by the choice of r C B 2 [ 0 , ) , we can conclude the following:
| T n ( f ; u ) f ( u ) | 2 K ( f ; δ ) ,
Assertion (35) is established by utilizing Peetre’s k-functional. □

5. Weighted Approximation

Weighted approximation is a mathematical technique that involves modifying the traditional notion of approximation by assigning varying degrees of importance or significance (weights) to different parts of a given function or data set. This approach has several advantages and significant applications across various fields of mathematics, science, and engineering, as many real-world phenomena exhibit variations and complexities that are not adequately captured by simple uniform approximations. This allows for a more flexible and nuanced representation of such phenomena by assigning different weights to different regions or points, emphasizing their importance or relevance. It further enables the customization of approximation methods to meet specific requirements or constraints. By assigning appropriate weights, it becomes possible to prioritize certain characteristics or properties of the function being approximated, resulting in a more accurate representation within a defined context. Further, it can enhance numerical stability by reducing the influence of oscillations or rapid changes in the function being approximated. This can lead to more stable and robust algorithms, especially in numerical analysis and computational mathematics.
In the subsequent section, we present certain approximation properties for the operator, T n , within a space of weighted continuous functions. Specifically, we focus on a particular class of functions defined on [ 0 , ) .
Let us consider the set of functions, h, that satisfy the condition, | H ( y ) | M H ( 1 + u 2 ) , where M h is a constant dependent on h. Here, B u 2 [ 0 , ) denotes the space defined on [ 0 , ) , and C u 2 [ 0 , ) represents the subspace of B u 2 [ 0 , ) consisting of all continuous functions. Moreover, C u 2 * [ 0 , ) as the subspace of h C u 2 [ 0 , ) , for which lim | u | H ( u ) 1 + u 2 is finite. It is evident that C u 2 * [ 0 , ) C u 2 [ 0 , ) B u 2 [ 0 , ) . The norm on C u 2 * [ 0 , ) is given as follows:
| | h | | u 2 = sup u [ 0 , ) | H ( u ) | 1 + u 2 .
Lemma 4.
Let the weight function ρ ( u ) = 1 + u 2 . If h C y 2 [ 0 , ) , then
| | T n ( ρ ; u ) | | u 2 1 + M .
Proof. 
Using Equations (9) and (11) from Lemma (2), we can deduce the following expressions for n > 1 :
T n ( ρ ; u ) = 1 + 1 𝘍 1 n 2 u 2 + n u B 0 + C 0 .
Then, we deduce
| | T n ( ρ ; u ) | | u 2 = sup u 0 1 1 + u 2 + n u 2 ( 1 + u 2 ) ( n 1 ) + 2 u r ( 1 ) + r ( 1 ) 1 + H ( 1 ) 2 r ( 1 ) 1 + u 2 n 1
+ r ( 1 ) + 2 r ( 1 ) ( 1 + u 2 ) r ( 1 ) ( n 1 )
sup u 0 1 + n ( n 1 ) + r ( 1 ) + r ( 1 ) 1 + H ( 1 ) 2 r ( 1 ) n 1 + r ( 1 ) + 2 r ( 1 ) r ( 1 ) ( n 1 ) .
We have
lim n n n 1 = 1 , lim n 1 n 1 = 0   a n d lim n 1 n 2 n = 0 .
Thus, in view of these assumptions, there exists a positive constant, M, such that
| | T n ( ρ ; u ) | | u 2 1 + M .
Thus, the proof is deduced. □
Theorem 4.
Consider the operators, T n , defined by Equation (8) and the weight function, ρ ( u ) = 1 + u 2 . For any f C * u 2 [ 0 , ) , the following holds:
lim n | | T n ( f ; u ) f ( u ) | | u 2 = 0 .
Proof. 
Applying the weighted Korovkin theorem as stated by Gadzhiev [21], it suffices to verify the following conditions:
| | T n ( 1 ; u ) 1 | | u 2 = 0 .
Expression (10) follows
| | T n ( e 1 ; u ) e 1 ( u ) | | u 2 = sup u 0 | u 1 + u 2 + r ( 1 ) n r ( 1 ) ( 1 + u 2 ) u 1 + u 2 | .
Thus,
lim n | | T n ( e 1 ; u ) e 1 ( u ) | | u 2 = 0 ,
Then, in view of (11), it follows that
| | T n ( e 2 ; u ) e 2 ( u ) | | u 2 = sup u 0 | n u 2 ( n 1 ) ( 1 + u 2 ) + n u B 0 ( n 2 n ) ( 1 + u 2 ) + C 0 n ( n 1 ) ( 1 + u 2 ) u 2 1 + u 2 | .
Therefore,
lim n | | T n ( e 2 ; u ) e 2 ( u ) | | u 2 = 0 .
Therefore, the proof is deduced. □

6. Concluding Remarks

This article delved into the construction of Jakimovski–Leviatan operators for Durrmeyer-type approximations utilizing Sheffer polynomials. By developing positive linear operators based on Sheffer polynomials, we conducted a comprehensive analysis of their approximation properties, encompassing weighted approximations and convergence rates. The field of approximation theory has received substantial attention from researchers worldwide, particularly within the realms of engineering and mathematics. The study of these approximation properties and their underlying characteristics holds significant importance in advancing these disciplines.
One can examine the error estimation for the approximation using the Sheffer family of operators. Additionally, it is possible to illustrate the approximate solution, f ˇ ( t ) , of any continuous function using positive linear operators, T n ( f ; u ) . In a subsequent study, extensions of these operators, such as Sheffer polynomials and other members of the Kantrovich–Stancu type, will be utilized to investigate the Kantrovich–Stancu type more extensively.

Author Contributions

Conceptualization, M.Y.B., S.A.W. and M.Z.; methodology, M.Y.B., S.A.W. and M.Z.; validation, M.Y.B., S.A.W. and M.Z.; formal analysis, M.Y.B., S.A.W. and M.Z.; investigation, M.Y.B., S.A.W. and M.Z.; resources, M.Z.; writing—original draft preparation, M.Y.B., S.A.W. and M.Z.; writing—review and editing, M.Y.B., S.A.W. and M.Z.; supervision, M.Y.B.; project administration, M.Y.B., S.A.W. and M.Z.; funding acquisition, M.Z. All authors have read and agreed to the published version of this manuscript.

Funding

This work was funded by the Deanship of Scientific Research at King Khalid University through the Small Group Research Project (grant number: RGP1/141/44).

Data Availability Statement

Not applicable.

Acknowledgments

M. Zayed extends her appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through the Small Group Research Project (grant number: RGP1/141/44).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Korovkin, P.P. On convergence of linear positive operators in the space of continous functions. Dokl. Akad. Nauk SSSR 1953, 90, 961–964. [Google Scholar]
  2. Gavrea, I.; Raşa, I. Remarks on some quantitative Korovkin-type results. Rev. Anal. Numér. Théor. Approx. 1993, 22, 173–176. [Google Scholar]
  3. Içöz, G.; Varma, S.; Sucu, S. Approximation by operators including generalized Appell polynomials. Filomat 2016, 2, 429–440. [Google Scholar] [CrossRef]
  4. Ismail, M.E.H. On a generalization of Szasz operators. Mathematica 1974, 39, 259–267. [Google Scholar]
  5. Jakimovski, A.; Leviatan, D. Generalized Szasz operators for the approximation in the infinite interval. Mathematica 1969, 11, 97–103. [Google Scholar]
  6. Korovkin, P.P. Linear Operators and Approximation Theory; Chapters I, II. (Russian, 1959); Hindustan Publishing Corp.: Delhi, India, 1960. (In English) [Google Scholar]
  7. 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]
  8. Shisha, O.; Mond, B. The degree of approximation to periodic functions by linear positive operators. J. Approx. Theory 1968, 1, 335–339. [Google Scholar] [CrossRef]
  9. Sucu, S.; Içöz, G.; Varma, S. On some extensions of Szasz operators including Boas-Buck-type polynomials. In Abstract and Applied Analysis 2012; Hindawi: London, UK, 2012; pp. 1–15. [Google Scholar]
  10. Szasz, O. Generalization of S. Bernstein’s polynomials to the infinite interval. J. Res. Nat. Bur. Stand. 1950, 45, 239–245. [Google Scholar] [CrossRef]
  11. Varma, S.; Sucu, S.; Içöz, G. Generalization of Szasz operators involving Brenke type polynomials. Comput. Math. Appl. 2012, 64, 121–127. [Google Scholar] [CrossRef]
  12. Atangana, A. New Class of Boundary Value Problems. Inf. Sci. Lett. 2015, 1, 67–77. Available online: https://digitalcommons.aaru.edu.jo/isl/vol1/iss3/1 (accessed on 1 July 2023). [CrossRef]
  13. Thi, D.N. On the type and generators of monomial curves. Turk. J. Math. 2018, 42, 4. [Google Scholar]
  14. Wani, S.A.; Mursaleen, M.; Nisar, K.S. Certain approximation properties of Brenke polynomials using Jakimovski–Leviatan operators. J. Inequal. Appl. 2021, 2021, 104. [Google Scholar] [CrossRef]
  15. Kang, J.Y.; Ryoo, C.S. Approximate Roots and Properties of Differential Equations for Degenerate q-Special Polynomials. Mathematics 2023, 11, 2803. [Google Scholar] [CrossRef]
  16. Remogna, S.; Sbibih, D.; Tahrichi, M. Superconvergent Nyström Method Based on Spline Quasi-Interpolants for Nonlinear Urysohn Integral Equations. Mathematics 2023, 11, 3236. [Google Scholar] [CrossRef]
  17. Paul, A. Sur une classe de polynômes. Annales Scientifiques de l’École Normale Supérieure 2e Série 1980, 9, 119–144. [Google Scholar]
  18. Karaisa, A. Approximation by Durrmeyer type Jakimovski-Leviatan operators. Math. Methods Appl. Sci. 2016, 39, 2401–2410. [Google Scholar] [CrossRef]
  19. Sheffer, I.M. Some properties of polynomial sets of type zero. Duke Math. J. 1939, 5, 590–622. [Google Scholar] [CrossRef]
  20. Zhuk, V.V. Functions of the Lip 1 class and S. N. Bernstein’s polynomials. Vestnik Leningrad. Univ. Mat. Mekh. Astronom. 1989, 1, 25–30. [Google Scholar]
  21. Gadzhiev, A.D. The convergence problem for a sequence of positive linear operators on unbounded sets and theorems analogus to that of P. P. Krovokin. Sov. Math. Dokl. 1974, 15, 1433–1436. [Google Scholar]
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

Zayed, M.; Wani, S.A.; Bhat, M.Y. Unveiling the Potential of Sheffer Polynomials: Exploring Approximation Features with Jakimovski–Leviatan Operators. Mathematics 2023, 11, 3604. https://0-doi-org.brum.beds.ac.uk/10.3390/math11163604

AMA Style

Zayed M, Wani SA, Bhat MY. Unveiling the Potential of Sheffer Polynomials: Exploring Approximation Features with Jakimovski–Leviatan Operators. Mathematics. 2023; 11(16):3604. https://0-doi-org.brum.beds.ac.uk/10.3390/math11163604

Chicago/Turabian Style

Zayed, Mohra, Shahid Ahmad Wani, and Mohammad Younus Bhat. 2023. "Unveiling the Potential of Sheffer Polynomials: Exploring Approximation Features with Jakimovski–Leviatan Operators" Mathematics 11, no. 16: 3604. https://0-doi-org.brum.beds.ac.uk/10.3390/math11163604

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