Skip to Content
MathematicsMathematics
  • Article
  • Open Access

7 October 2026

18 Pages

A Study of King-Type Operators Connecting Wavelet and Quantum Calculus: Numerical and Graphical Analysis

,
and
1
Department of Mathematics, Faculty of Science, University of Ostrava, Mlýnská 702/5, Moravská Ostrava, 702 00 Ostrava, Czech Republic
2
Department of Mathematics, School of Computer Science & Artificial Intelligence, SR University, Warangal 506371, Telangana, India
3
Department of Mathematics, University Center for Research and Development, Chandigarh University, Mohali 140413, Punjab, India
*
Author to whom correspondence should be addressed.
This article belongs to the Section E: Applied Mathematics

Abstract

This paper introduces a new class of King-type wavelet-assisted Kantorovich q-Baskakov operators, built to address the observation that classical operators of this type typically fail to reproduce the quadratic test function exactly. Moment formulas are derived for these operators, and a weighted Korovkin-type theorem is used to establish convergence. The speed of pointwise convergence is then quantified with the help of the modulus of smoothness and Lipschitz-type maximal function spaces; the resulting convergence factor δ n q n turns out to be smaller than that reported for earlier q-Baskakov constructions, indicating an improvement in approximation power. Beyond the theoretical development, a numerical and graphical investigation plots the pointwise error | Y n , q * f ( z ) − f ( z ) | for several parameter pairs ( n , q ) , with the error found to decrease steadily as n increases and q approaches 1, consistent with the theoretical estimates. Implementation details accompany this study to make the computations reproducible and to connect the abstract approximation-theoretic results with their practical execution.

1. Introduction and Preliminaries

A large number of positive linear operator sequences are constructed so as to reproduce the constant and linear test functions exactly; that is, L ( e i , y ) = e i ( y ) for i = 0 , 1 where e i ( y ) = y i ; the Bernstein, Baskakov, Szász–Mirakjan, and Phillips families are all examples of this behavior. What none of these classical constructions manages, however, is an exact reproduction of the second-degree monomial e 2 , so that in general L m ( e 2 , y ) ≠ e 2 ( y ) . It was King [1] who first repaired this gap, proposing a re-parametrization scheme under which the quadratic test function is left invariant. When this device is applied to the Bernstein polynomials, it produces the modified operator
B m * ( h ; y ) = ∑ j = 0 m m j ( γ m * ( y ) ) j ( 1 − γ m * ( y ) ) m − j h j m ,
with y , γ m * ( y ) ∈ [ 0 , 1 ] , m = 1 , 2 , 3 , . . . , where γ m * ( y ) is given by
γ m * ( y ) = − 1 2 ( m − 1 ) + m m − 1 y 2 + 1 4 ( m − 1 ) for m = 2 , 3 , 4 , . . . y 2 , for m = 1 .
The construction B m * ( h ; y ) above is a re-parametrization of the classical Bernstein polynomial B m ( h ; y ) = ∑ j = 0 m m j y j ( 1 − y ) m − j h ( j / m ) , going back to Bernstein’s original probabilistic proof of the Weierstrass approximation theorem [2]: replacing the argument y of the classical binomial weights by King’s function γ m * ( y ) leaves the operator positive and linear, changes nothing about e 0 and, because γ m * ( y ) is chosen precisely so that B m * ( e 2 ; y ) = y 2 , repairs the one test function that the classical Bernstein polynomials do not reproduce exactly. Every operator considered later in this paper—the q-Baskakov family Γ n , q of [3], its Kantorovich modification with a scaling kernel, and the King-type operator Y n , q * built from it—inherits this same re-parametrization idea, so that the present construction sits at the intersection of three classical threads in approximation theory: the Bernstein–Baskakov family of positive linear operators [2,4], King’s second-moment-preserving re-parametrization [1], and the general Korovkin-type convergence theory that governs when such operator sequences converge at all (see, e.g., [5] and Section 3.2 below). King [1] showed that, restricted to 0 ≤ y ≤ 1 3 , his operators B m * ( h ; y ) outperform the classical Bernstein construction analyzed by Lupas [4]. Extending this idea further, Doğru and Örkcü [6] constructed King-type analogues of the Meyer–König–Zeller operators along with their q-versions, achieving sharper error bounds than both the classical and q-based Meyer–König–Zeller families. Along similar lines, Yilmaz et al. [7] examined King-type Baskakov operators centered on the test functions e 0 and e 2 a x for a fixed positive constant a, uncovering shape-preservation results tied to generalized convexity. The King methodology has since been carried over to many other operator families with their own approximation properties studied case by case; representative instances appear in [8,9,10].
Over recent years, quantum calculus has emerged as a fruitful setting in which to build and analyze positive linear operators; representative studies include [11,12,13,14,15]. More broadly, the design and tuning of structured operators is also an active theme outside classical approximation theory: He et al. [16] propose a model-based approach to accelerate the tuning of deep-network operators, underscoring the practical value of operator constructions whose parameters (here, our n and q) can be chosen to control performance in a predictable way, and Li et al. [17] develop a permutation-based method for generating mass functions that captures class bias through structured combinatorial transformations, a construction philosophy—building a new operator from an existing one via a controlled, invertible transformation—that parallels the King-type re-parametrization used throughout the present paper. These connections suggest that operator-tuning ideas developed in approximation theory and in applied/data-driven settings can inform one another. Because the Kantorovich q-Baskakov operators with scaling kernels fail to preserve the second moment e 2 , the present work is aimed at constructing a King-type analogue of this family and examining how well it approximates. Related constructions built on kernel ideas can be found in [18,19,20,21,22,23,24]. More recently, this trend has expanded to include parametric and generalized constructions, with Nasiruzzaman and Alotaibi [25] developing a Kantorovich extension of the parametric generalized q-Schurer operators and investigating their approximation properties. We first record several preliminary facts that will be used later on.
Throughout this paper, quantum calculus refers to the Jackson q-calculus that underlies the entire construction–the q-integers [ n ] q , the q-binomial coefficients, the q-Pochhammer symbol ( 1 + · ) q n , and the associated q-integral and not to quantum computing or quantum information processing; no claim of a quantum-computational application is made or intended anywhere in what follows, and any phrasing that might be read otherwise is not so intended. Wavelet, for its part, refers to the nonnegative compactly supported scaling kernel Ψ introduced in Section 2, which plays a role analogous to that of a scaling function in a multiresolution analysis [26,27,28]: it localizes and redistributes the mass of each Kantorovich-type average over a compact window, in the spirit of the wavelet-assisted Kantorovich operators of [18,19,20,21,24]. Unlike a genuine wavelet basis, Ψ is not required to oscillate in sign or to annihilate higher-order moments (Remark 1 below); the wavelet connection therefore sits at the level of the kernel-based construction technique common to that line of work, rather than a full multiresolution decomposition. What distinguishes Y n , q * from all of [18,19,20,21,24] as well as from the classical construction of [3] is the King-type re-parametrization introduced in Section 2: none of those wavelet-Kantorovich or classical q-Baskakov operators reproduces the quadratic test function e 2 exactly, whereas Y n , q * does, by construction (Theorem 1), and it is this exact reproduction that drives the strictly smaller convergence factor established in Proposition 1.
This work is motivated by a simple observation with a non-trivial consequence: a Kantorovich-type q-Baskakov operator built from a nonnegative scaling kernel need not settle for reproducing e 2 only asymptotically. If it can instead be re-parametrized, à la King, so as to reproduce e 2 exactly, it becomes natural to ask whether this exact reproduction amounts to more than a formal repair of a single moment: whether it genuinely translates into a smaller convergence factor. The question is far from incidental: the second central moment Y n , q * ( ( y − z ) 2 , z ) is precisely the quantity that drives every rate-of-convergence estimate obtained in Section 4, whether expressed through the modulus of smoothness, the Lipschitz-type maximal function space, or statistical convergence. Forcing e 2 to be reproduced exactly removes the dominant source of growth of this moment in z and n, and it is this fact that motivates the construction developed below. Proposition 1 confirms this is a genuine gain rather than a cosmetic one: it makes precise, rather than merely asserts, how much smaller the resulting factor δ n q n is relative to the corresponding operators without the King correction.
Aral and Gupta [3] introduced the q-analogue of the classical Baskakov operators, for z ∈ [ 0 , ∞ ) and 0 < q ≤ 1 , as
( Γ n , q h ) ( z ) = ∑ b = 0 ∞ υ n q ( z ) h 1 q b − 1 n q ,
where
υ n q ( z ) = n + b − 1 b q q b ( b − 1 ) 2 z b ( 1 + z ) q n + b .
Setting e j ( z ) = z j for j = 0 , 1 , 2 , the following identities hold for every n ∈ N  [3]:
( Γ n , q e 0 ) ( z ) = 1 , ( Γ n , q e 1 ) ( z ) = z , ( Γ n , q e 2 ) ( z ) = z 2 + z 1 n q 1 + 1 q z ,
for z ∈ 0 , 1 and 0 < q ≤ 1 .
Definition 1. 
For a nonnegative integer n, the q-integer [ n ] q is given by
n q = 1 − q n 1 − q and 0 q = 0 ,
where 0 < q ≤ 1 .
Definition 2. 
A function h ∈ C [ 0 , ∞ ) satisfies a Lipschitz condition of order μ > 0 with constant λ ≥ 0 provided
h ( z 1 ) − h ( z 2 ) ≤ λ z 1 − z 2 μ , z 1 , z 2 ∈ [ 0 , ∞ ) .
Definition 3. 
The s t h -order modulus of smoothness of h on an interval I is defined as
ω s ( h , δ ) = sup t < δ { sup ▵ t s h ( z ) : z , z + s t ∈ I } , δ ≥ 0 , s ∈ N ,
where ▵ t s h ( z ) is the s t h -order forward difference of h taken with step size t, namely
▵ t s h ( z ) = ∑ j = 0 s ( − 1 ) s − j s j h ( z + j t ) , s ∈ N .
The following inequality holds for every δ > 0 :
h ( t ) − h ( z ) ≤ 1 + t − z δ ω ( h , δ ) .

2. New Operators

In contrast to the wavelet-based constructions in the literature [27,28], which typically employ kernels with vanishing moments and sign-changing behavior, we adopt a nonnegative scaling kernel Ψ satisfying
(a)
Ψ ∈ L ∞ ( R ) , Ψ ≥ 0 on R ,
(b)
supp Ψ ⊂ [ 0 , α ] for some finite α > 0 ,
(c)
∫ R Ψ ( y ) d y = 1 .
The nonnegativity of Ψ ensures that the resulting operator is positive, which is essential for the Korovkin-type convergence theorems used in Section 3. The compact support condition makes the operator local and computationally tractable, while normalization preserves constant functions exactly.
Remark 1. 
A simple example of such a kernel satisfying (a)–(c) with α = 1 is Ψ ( y ) = 1 on [ 0 , 1 ] (and 0 elsewhere). This uniform kernel is commonly used in Kantorovich-type constructions; however, any nonnegative compactly supported function normalized to have total mass 1 would serve equally well. The use of a nonnegative kernel represents a departure from wavelet-type kernels, which necessarily exhibit sign changes when requiring higher-order vanishing moments.
With these conditions in place, let m 1 = ∫ 0 α y Ψ ( y ) d y denote the first moment of the scaling kernel Ψ . The q-analogue of the King-type scaling-kernel-assisted Baskakov–Kantorovich operators is defined as
( Y n , q * h ) ( z ) = n q ∑ b = 0 ∞ q b − 1 υ n q ( z ) ∫ R h y − m 1 [ n ] q q b − 1 Ψ n q q b − 1 y − b q d q y ,
for z ∈ [ 0 , ∞ ) and 0 < q ≤ 1 . Throughout, ∫ R ( · ) d q y denotes the ordinary Lebesgue integral in the real variable y; the subscript q only records that the integrand Ψ is required to satisfy the q-moment conditions (a)–(c) above, and it does not stand for a discrete Jackson q-sum. Under this reading, the map y ↦ n q q b − 1 y − b q occurring inside Ψ in (5) is, for each fixed b, an ordinary affine bijection of R , to which the classical (non-q) substitution rule for Lebesgue integrals applies directly; this is exactly the computation used to pass from (5) to (7) below, where
υ n q ( z ) = n + b − 1 b q q b ( b − 1 ) 2 ( r n q ( z ) ) b ( 1 + r n q ( z ) ) q n + b ,
and
r n q ( z ) = q 2 + 4 q n q n + 1 q z 2 − q 2 n + 1 q , n = 1 , 2 , 3 , … .
Remark 2. 
Observe that r n q ( z ) ≥ 0 , because q 2 + 4 q n q n + 1 q z 2 − q ≥ 0 . Note also that n + 1 q > 0 for every n ≥ 1 and 0 < q ≤ 1 ; so, (6) is valid uniformly in n, and no separate case is required at n = 1 .
Remark 3 
(Convergence of the series defining Y n , q * h ). Write r = r n q ( z ) and c b = n + b − 1 b q q b ( b − 1 ) / 2 r b / ( 1 + r ) q n + b ; so, υ n q ( z ) = c b . Since ( 1 + r ) q n + b ≥ ( 1 + r ) b for large b while n + b − 1 b q grows only polynomially, c b = O b n − 1 ( r / ( 1 + r ) ) b , and r / ( 1 + r ) < 1 gives absolute (geometric) convergence of ∑ b c b for every fixed z ≥ 0 . This justifies the term-by-term manipulations used in Theorem 1 and is what underlies the series truncation in Section 4.
When supp Ψ ⊂ 0 , α , Equation (5) can equivalently be written as
( Y n , q * h ) ( z ) = ∑ b = 0 ∞ υ n q ( z ) ∫ 0 α h ( y − m 1 + b q ) n q q b − 1 Ψ ( y ) d q y .

3. Main Results

3.1. Moments of Y n , q *

Here, we work out the moment identities satisfied by the scaling-kernel Kantorovich q-Baskakov operators, taking 0 < q ≤ 1 throughout, as stated in the following theorem.
Theorem 1. 
Let e j ( y ) = y j for j = 0 , 1 , 2 , and suppose that Ψ satisfies conditions (a)–(c) stated above. Then, for every z ∈ [ 0 , ∞ ) , the following identities hold:
( Y n , q * e 0 ) ( z ) = 1 ,
( Y n , q * e 1 ) ( z ) = r n q ( z ) ,
( Y n , q * e 2 ) ( z ) = z 2 .
Proof. 
Starting from Equation (7), for j = 0 , 1 , 2 ,
( Y n , q * e j ) ( z ) = ∑ b = 0 ∞ υ n q ( z ) ∫ 0 α y − m 1 + [ b ] q [ n ] q q b − 1 j Ψ ( y ) d y .
For j = 0 , using (c) gives
( Y n , q * e 0 ) ( z ) = ∑ b = 0 ∞ υ n q ( z ) ∫ 0 α Ψ ( y ) d y = ∑ b = 0 ∞ υ n q ( z ) = 1 .
For j = 1 ,
( Y n , q * e 1 ) ( z ) = ∑ b = 0 ∞ υ n q ( z ) [ b ] q [ n ] q q b − 1 ∫ 0 α Ψ ( y ) d y + ∑ b = 0 ∞ υ n q ( z ) 1 [ n ] q q b − 1 ∫ 0 α ( y − m 1 ) Ψ ( y ) d y .
Since ∫ 0 α y Ψ ( y ) d y = m 1 and ∫ 0 α Ψ ( y ) d y = 1 , the second term vanishes identically ( ∫ 0 α ( y − m 1 ) Ψ ( y ) d y = m 1 − m 1 = 0 ). By the definition of υ n q ( z ) in terms of r n q ( z ) , we have
( Y n , q * e 1 ) ( z ) = ( Γ n , q e 1 ) ( r n q ( z ) ) = r n q ( z ) ,
where the last equality uses the first-moment identity of the classical q-Baskakov operators from (2).
For j = 2 , the same substitution gives
( Y n , q * e 2 ) ( z ) = ( Γ n , q e 2 ) ( r n q ( z ) ) = r n q ( z ) 2 + r n q ( z ) [ n ] q 1 + r n q ( z ) q = z 2 ,
where the final equality follows from the defining relation (6) for r n q ( z ) .    □
Remark 4. 
Theorem 1 says that the moments of Y n , q * at z agree with the moments of the classical operator Γ n , q of Aral and Gupta [3], evaluated at the King point r n q ( z ) , not with ( Γ n , q e j ) ( z ) itself; the two agree only when r n q ( z ) = z . It is precisely this evaluation at r n q ( z ) , together with the defining relation for r n q ( z ) recorded in Corollary 1(iii), that reproduces e 2 exactly at z, which is the King mechanism the construction is built around.
Combining Theorem 1 with Equation (2) immediately gives Corollary 1 below.
Corollary 1. 
For z ∈ [ 0 , 1 ] and 0 < q ≤ 1 , we have
(i)
( Y n , q * e 0 ) ( z ) = 1 ,
(ii)
( Y n , q * e 1 ) ( z ) = r n q ( z ) ,
(iii)
( Y n , q * e 2 ) ( z ) = ( r n q ( z ) ) 2 + r n q ( z ) 1 n q 1 + 1 q r n q ( z ) = z 2 .
Note: Corollary 1 follows directly from the argument used to establish Equation (2) in Aral and Gupta [3].
Beyond the moments themselves, the operators of Equation (5) satisfy the central-moment identity ( Y n , q * ( y − z ) 2 ) ( z ) = ( Y n , q * e 2 ) ( z ) − 2 z ( Y n , q * e 1 ) ( z ) + z 2 ( Y n , q * e 0 ) ( z ) . Using Corollary 1, this reduces to
( Y n , q * ( y − z ) 2 ) ( z ) = z 2 − 2 z r n q ( z ) + z 2 = 2 z 2 − 2 z r n q ( z ) ;
that is, using (6),
( Y n , q * ( y − z ) 2 ) ( z ) = 2 z 2 − z q 2 + 4 q n q n + 1 q z 2 − q n + 1 q .
Lemma 1. 
For every z ≥ 0 , n ≥ 1 and 0 < q ≤ 1 , 0 ≤ r n q ( z ) ≤ z .
Proof. 
Write r = r n q ( z ) and φ ( t ) = t 2 + t [ n ] q 1 + t q for t ≥ 0 , so that φ is strictly increasing on [ 0 , ∞ ) (its derivative 2 t + 1 [ n ] q ( 1 + 2 t q ) is positive for t ≥ 0 , and, by Corollary 1(iii), φ ( r ) = z 2 . Since φ ( z ) = z 2 + z [ n ] q ( 1 + z q ) ≥ z 2 = φ ( r ) , the monotonicity of φ gives r ≤ z ; r ≥ 0 , since, by (6), r n q ( z ) = q 2 + 4 q [ n ] q [ n + 1 ] q z 2 − q / ( 2 [ n + 1 ] q ) with q 2 + 4 q [ n ] q [ n + 1 ] q z 2 ≥ q and [ n + 1 ] q > 0 .    □
Proposition 1 
(Improvement over the classical and Kantorovich q-Baskakov operators with scaling kernels). For every z ≥ 0 , n ≥ 1 , and 0 < q ≤ 1 ,
( Y n , q * ( y − z ) 2 ) ( z ) = 2 z z − r n q ( z ) ≤ z [ n ] q 1 + z q = Γ n , q ( t − z ) 2 , z ,
where the right-hand side is the second central moment, hence the driving quantity in the corresponding rate-of-convergence bounds, of both the classical q-Baskakov–Kantorovich operator and the Kantorovich q-Baskakov operator with scaling kernels obtained from (7) by evaluating the weights υ n q at z itself instead of at r n q ( z ) (equivalently, Γ n , q e 2 ( z ) − 2 z Γ n , q e 1 ( z ) + z 2 , using (2)). In particular, the King re-parametrization strictly decreases the second central moment, hence the convergence factor δ n q n , whenever r n q ( z ) < z , i.e., whenever z > 0 .
Proof. 
Write r = r n q ( z ) ∈ [ 0 , z ] (Lemma 1). From Corollary 1(iii), z 2 − r 2 = r [ n ] q 1 + r q , and since z 2 − r 2 = ( z − r ) ( z + r ) with z + r > 0 for z > 0 (the case z = 0 being trivial, as both sides vanish), this gives
z − r = r 1 + r q [ n ] q ( z + r ) .
The claimed inequality 2 ( z − r ) ≤ 1 [ n ] q 1 + z q is therefore equivalent to
2 r 1 + r q ≤ 1 + z q ( z + r ) .
Expanding the right-hand side and subtracting the left-hand side,
1 + z q ( z + r ) − 2 r 1 + r q = ( z − r ) + 1 q z 2 + z r − 2 r 2 = ( z − r ) 1 + z + 2 r q ,
using z 2 + z r − 2 r 2 = ( z − r ) ( z + 2 r ) . Since z ≥ r ≥ 0 and q > 0 , the bracket is nonnegative, and z − r ≥ 0 by Lemma 1; so, the difference is ≥ 0 , proving the inequality. Multiplying both sides by 2 z ≥ 0 gives 2 z ( z − r ) ≤ z [ n ] q ( 1 + z q ) , which is the statement of the proposition.    □

3.2. Korovkin’s Type Result

We now turn to a weighted Korovkin-type convergence theorem for the King-type scaling-kernel-aided Kantorovich q-Baskakov operators Y n , q * . The study of convergence in weighted spaces often draws upon the rich theory of sequence spaces and summability, which has seen significant recent advances, for example in the context of invariant means and lacunary sequences [29].
Let B ρ ( R 0 + ) denote the space of real-valued functions h on R 0 + for which
| h ( z ) | ≤ N h ρ ( z ) , ∀ z ∈ R 0 + ,
holds for some constant N h > 0 that may depend on h. Restricting to continuous members of this space gives
C ρ ( R 0 + ) = B ρ ( R 0 + ) ∩ C ( R 0 + ) ,
where C ( R 0 + ) denotes the continuous functions on R 0 + .
A further subclass is defined by
C ρ * ( R 0 + ) = h ∈ C ρ ( R 0 + ) : lim z → ∞ | h ( z ) | ρ ( z ) < ∞ .
Under the norm
∥ h ∥ ρ = sup z ∈ R 0 + | h ( z ) | ρ ( z ) ,
each of B ρ ( R 0 + ) and C ρ ( R 0 + ) is a Banach space.
Corollary 1 shows that ( Y n , q * e 0 ) ( z ) = 1 and ( Y n , q * e 2 ) ( z ) = z 2 hold exactly, for every finite n, by the King-type construction. It is instead the first moment, ( Y n , q * e 1 ) ( z ) = r n q ( z ) , that is not reproduced exactly at finite n: by Lemma 1, 0 ≤ r n q ( z ) ≤ z with equality only in the limit n → ∞ (Remark 5), so ( Y n , q * e 1 ) ( z ) = z fails, in general, at finite n. The classical Bohman–Korovkin theorem does not directly apply to the sequence ( Y n , q * ) n on this account; one of its three test-function hypotheses is not met at finite n and, independently, its classical (compact-interval) form is in any case not applicable here since the domain R 0 + is unbounded. The appropriate substitute on the unbounded interval R 0 + is therefore the weighted Korovkin theorem of Gadjiev [30], whose weight ρ ( z ) = 1 + z 2 controls the growth of h and of the moments as z → ∞ in a way the unweighted theorem cannot, which we now recall in the form we use.
Lemma 2 
(Gadjiev [30]). Let ρ ( z ) = 1 + z 2 , and let ( L n ) n be a sequence of positive linear operators mapping C ρ ( R 0 + ) into B ρ ( R 0 + ) . If
lim n → ∞ ∥ L n e i − e i ∥ ρ = 0 , i = 0 , 1 , 2 ,
then
lim n → ∞ ∥ L n h − h ∥ ρ = 0 , ∀ h ∈ C ρ * ( R 0 + ) .
Each Y n , q n * is a positive linear operator on C ρ ( R 0 + ) (thanks to the nonnegative kernel); so, Lemma 2 applies to the sequence ( Y n , q n * ) n with this same weight ρ ( z ) = 1 + z 2 , and the content of Theorem 2 below is exactly the verification of its three hypotheses ∥ Y n , q n * e i − e i ∥ ρ → 0 , i = 0 , 1 , 2 , together with the conclusion Gadjiev’s theorem then gives.
Remark 5. 
For fixed q ∈ ( 0 , 1 ) , [ n ] q = 1 − q n 1 − q → 1 1 − q < ∞ as n → ∞ : the limit is finite and nonzero, not 0 . This is exactly why the classical (non-weighted) Korovkin theorem, which needs 1 / [ n ] q → 0 , cannot be applied with q held fixed. To force [ n ] q → ∞ , one must instead let q vary with n: take a sequence ( q n ) n with q n ∈ ( 0 , 1 ) satisfying
lim n → ∞ q n = 1 and lim n → ∞ q n n = 1 .
Writing [ n ] q n = 1 − q n n 1 − q n , (8) makes both the numerator and denominator tend to 0 ; a standard argument (e.g., via 1 − q n n = ( 1 − q n ) ( 1 + q n + ⋯ + q n n − 1 ) and q n → 1 ) shows [ n ] q n → ∞ under (8), even though [ n ] q → 1 / ( 1 − q ) < ∞ for any fixed q.
Consequently, for a sequence ( q n ) n satisfying (8), lim n → ∞ [ n ] q n = ∞ , and thus lim n → ∞ 1 [ n ] q n = 0 , from which the following theorem is obtained.
Theorem 2. 
Let ( q n ) n be a sequence in ( 0 , 1 ] satisfying Equation (8) of Remark 5 above; then, since each Y n , q n * is a positive linear operator (Section 2), we have
lim n → ∞ ( Y n , q n * h ) ( z ) − h ( z ) ρ = 0 , ∀ h ∈ C ρ * ( R 0 + ) .
Proof. 
From Corollary 1(i):
( Y n , q n * e 0 ) ( z ) − e 0 ( z ) ρ = sup z ∈ R 0 + ( Y n , q n * e 0 ) ( z ) − e 0 ( z ) 1 + z 2 , = 0 .
For e 1 , using Corollary 1(ii):
( Y n , q n * e 1 ) ( z ) − e 1 ( z ) ρ = sup z ∈ R 0 + r n q n ( z ) − z 1 + z 2 .
By Lemma 1, 0 ≤ r n q n ( z ) ≤ z . Moreover, from the defining equation for r n q n ( z ) ,
r n q n ( z ) − z = z [ n ] q n · 1 + r n q n ( z ) q n z + r n q n ( z ) .
Therefore,
| r n q n ( z ) − z | 1 + z 2 ≤ 1 [ n ] q n · 1 + z q n 1 + z 2 ≤ 1 [ n ] q n · max 1 , 1 q n .
Since [ n ] q n → ∞ under condition (8), we obtain
lim n → ∞ ( Y n , q n * e 1 ) ( z ) − e 1 ( z ) ρ = 0 .
For e 2 , Corollary 1(iii) gives exactly ( Y n , q n * e 2 ) ( z ) = z 2 ; so,
lim n → ∞ ( Y n , q n * e 2 ) ( z ) − e 2 ( z ) ρ = 0 .
We have thus verified lim n → ∞ ∥ Y n , q n * e i − e i ∥ ρ = 0 for i = 0 , 1 , 2 , which are exactly the three hypotheses of the weighted Korovkin theorem of Gadjiev (Lemma 2), applied to the weight ρ ( z ) = 1 + z 2 and the sequence of positive linear operators Y n , q n * : C ρ ( R 0 + ) → B ρ ( R 0 + ) . Lemma 2 therefore gives lim n → ∞ ∥ Y n , q n * h − h ∥ ρ = 0 for every h ∈ C ρ * ( R 0 + ) , as claimed. This completes the proof.    □

3.3. Rate of Convergence of the Operators Y n , q *

Here, we study how fast the King-type Kantorovich q-Baskakov operators converge, expressed via the modulus of continuity and via Lipschitz-type function spaces, and we further obtain estimates through the Lipschitz-type maximal function space D ⊂ [ 0 , ∞ ) .
For 0 < q n ≤ 1 with ( q n ) n ≥ 2 satisfying Equation (8), it follows that lim n → ∞ 1 [ n ] q = 0 . We therefore have
δ n q n = 2 z 2 − z q n 2 + 4 q n n q n n + 1 q n z 2 − q n n + 1 q n , = 2 z 2 − z q n 2 n + 1 q 2 + 4 q n n q z 2 n + 1 q + z q n n + 1 q .
Taking n → ∞ yields, using (8) and lim n → ∞ q n = 1 ,
lim n → ∞ δ n q n = lim n → ∞ 2 z 2 − z q n 2 n q + q n n 2 + 4 q n n q z 2 n q + q n n + z q n n q + q n n , = 2 z 2 − z 0 + 4 z 2 + 0 , = 0 .
This yields the following pointwise rate-of-convergence result for the operators Y n , q n * approximating h ( z ) . Here, C B [ 0 , ∞ ) = { h ∈ C [ 0 , ∞ ) ; h is bounded on [ 0 , ∞ ) } , with the sup-norm.
Theorem 3. 
Let 0 < q n ≤ 1 and ( q n ) n ≥ 2 satisfying Equation (8) above; then, for all h ∈ C B [ 0 , ∞ ) and each z ≥ 0 , we have
( Y n , q n * h ) ( z ) − h ( z ) ≤ 2 ω h , δ n q n ,
where
δ n q n = 2 z 2 − z q n 2 + 4 q n n q n + 1 q n z 2 − q n n + 1 q n .
Proof. 
Using the linearity and monotonicity of Y n , q n * together with inequality (4), we obtain
( Y n , q n * h ) ( z ) − h ( z ) = Y n , q n * h ( y ) − h ( z ) , z ≤ Y n , q n * h ( y ) − h ( z ) , z ≤ 1 + 1 δ Y n , q n * y − z , z ω ( h , δ ) ≤ 1 + 1 δ ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) ∫ R y − z Ψ n q n q n b − 1 y + m 1 − b q n d q n y ω ( h , δ ) .
Using the bound
∫ R y − z d q n y ≤ ∫ R y − z 2 d q n y 1 2 ∫ R d q n y 1 2 ,
we have
( Y n , q n * h ) ( z ) − h ( z ) ≤ ω ( h , δ ) { 1 + 1 δ ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) × ∫ R y − z 2 Ψ n q n q n b − 1 y + m 1 − b q n d q n y 1 2 × ∫ R Ψ n q n q n b − 1 y + m 1 − b q n d q n y 1 2 } .
Applying Hölder’s inequality for sums gives
( Y n , q n * h ) ( z ) − h ( z ) ≤ ω ( h , δ ) { 1 + 1 δ ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) ∫ R y − z 2 Ψ n q n q n b − 1 y + m 1 − b q n d q n y 1 2 × ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) ∫ R Ψ n q n q n b − 1 y + m 1 − b q n d q n y 1 2 } .
We then obtain
( Y n , q n * h ) ( z ) − h ( z ) ≤ ω ( h , δ ) 1 + 1 δ Y n , q n * t − z 2 , z 1 2 · Y n , q n * 1 , z 1 2 = ω ( h , δ ) 1 + 1 δ Y n , q n * t − z 2 , z 1 2 = ω ( h , δ ) 1 + 1 δ δ n q n 1 2 .
Choosing δ = δ n q n , we have
( Y n , q n * h ) ( z ) − h ( z ) ≤ 2 ω h , δ n q n ,
This establishes the desired bound, completing the proof.    □
Next, we look at how quickly Y n , q n * converges for functions belonging to the standard Lipschitz class L i p λ ( μ ) .
Theorem 4. 
Suppose that 0 < q n ≤ 1 and ( q n ) n ≥ 2 satisfies Equation (8), and let Y n , q n * denote the sequence of positive linear operators given by (5). Then, for every h ∈ L i p λ ( μ ) with λ > 0 and 0 < μ ≤ 1 satisfying (3), it holds that
( Y n , q n * h ) ( z ) − h ( z ) ≤ λ δ n q n μ 2 ,
where δ n , b q n is defined by Equation (9).
Proof. 
Combining Equation (9) with Hölder’s inequality, we obtain
( Y n , q n * h ) ( z ) − h ( z ) = Y n , q n * h ( y ) − h ( z ) , z ≤ Y n , q n * h ( y ) − h ( z ) , z ≤ λ Y n , q n * y − z μ ; z ≤ λ ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) ∫ R y − z μ Ψ n q n q n b − 1 y + m 1 − b q n d q n y .
Now, applying Hölder’s inequality with q = 2 2 − μ gives
( Y n , q n * h ) ( z ) − h ( z ) ≤ λ ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) μ 2 q n b − 1 υ n q n ( z ) 2 − μ 2 × ∫ R y − z μ Ψ n q n q n b − 1 y + m 1 − b q n d q n y .
This in turn yields
( Y n , q n * h ) ( z ) − h ( z ) ≤ λ ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) ∫ R Ψ n q n q n b − 1 y + m 1 − b q n d q n y 2 − μ 2 × ∑ b = 0 ∞ q n b − 1 υ n q n ( z ) ∫ R y − z μ Ψ n q n q n b − 1 y + m 1 − b q n d q n y μ 2 .
Hence,
( Y n , q n * h ) ( z ) − h ( z ) ≤ λ Y n , q n * 1 ; z 2 − μ 2 Y n , q n * t − z 2 , z μ 2 = λ δ n q n μ 2 .
The proof is thus complete.    □
We next turn to the Lipschitz-type maximal function space D ⊂ [ 0 , ∞ ) , due to Aral and Doğru [31], to obtain a further rate-of-convergence estimate for Y n , q * . This space is defined by
R ν , D = h : sup ( 1 + z ) ν h ν ( z , t ) ≤ M 1 ( 1 + t ) ν , z ≥ 0 , t ∈ D ,
where h is bounded and continuous on [ 0 , ∞ ) , M > 0 , and 0 < ν ≤ 1 . Following Lenze [32], the associated Lipschitz maximal function is
h ν ( z , y ) = ∑ y > 0 h ( y ) − h ( z ) z − y ν , z ≠ y ,
and d ( z , D ) denotes the distance of z from D :
d ( z , D ) = inf z − t : t ∈ D .
Theorem 5. 
Assume D ⊂ [ 0 , ∞ ) is closed. If Y n , q n * is given by (5), then, for every h ∈ R ν , D ,
( Y n , q n * h ) ( z ) − h ( z ) ≤ M 2 ( d ( z , D ) ) ν + ( δ n q n ) ν 2 ,
where δ n , b q n is defined by Equation (9), and M is a Lipschitz constant.
Proof. 
Since D is closed by hypothesis, the infimum defining d ( z , D ) = inf { | z − t | : t ∈ D } is attained for every fixed z ≥ 0 , and there exists a point y ∈ D such that
d ( z , D ) = z − y .
Therefore, we can write
h − h ( z ) ≤ h ( y ) − h ( z ) + h − h ( y ) .
Based on the facts that Y n , q n * is a positive linear operator and h ∈ R ν , D , using the aforementioned inequality, we can write
( Y n , q n * h ) ( z ) − h ( z ) ≤ h ( y ) − h ( z ) Y n , q n * ( e 0 , z ) + Y n , q n * h − h ( y ) , z = h ( y ) − h ( z ) + Y n , q n * h − h ( y ) , z ≤ M z − y ν + Y n , q n * t − y ν , z .
Recalling that ( a + b ) ν ≤ a ν + b ν for a , b ≥ 0 , we may write
t − y ν ≤ t − z ν + z − y ν ,
for ν ∈ ( 0 , 1 ] and t ∈ [ 0 , ∞ ) ; it follows that
Y n , q n * t − y ν , z ≤ Y n , q n * t − z ν , z + Y n , q n * z − y ν , z ≤ Y n , q n * t − z ν , z + z − y ν .
Because Y n , q n * ( e 0 , z ) = 1 , an application of Hölder’s inequality with q = 2 2 − ν gives
Y n , q n * t − y ν , z ≤ Y n , q n * t − z 2 , z ν 2 + z − y ν .
Therefore, we have
( Y n , q n * h ) ( z ) − h ( z ) ≤ M z − y ν + Y n , q n * t − z 2 , z ν 2 + z − y ν = M 2 z − y ν + Y n , q n * t − z 2 , z ν 2 = M 2 ( d ( z , D ) ) ν + ( δ n q n ) ν 2 .
This completes the proof.    □

3.4. The Rate of Statistical Convergence

The concept of statistical convergence, which has been extended and refined in various directions such as the multidimensional sliding window Pringsheim convergence [33], provides a powerful framework for studying the convergence behavior of operator sequences without requiring classical pointwise or uniform convergence. Recall that, for K ⊂ N , the natural density is δ ( K ) = lim m → ∞ 1 m | { k ≤ m : k ∈ K } | (when this limit exists), and ( x n ) is statistically convergent to L, written s t - lim n x n = L , if δ ( { n : | x n − L | ≥ ε } ) = 0 for every ε > 0 . We now analyze the convergence rate of Y n , q * in terms of the modulus of continuity, beginning with the following remark.
Remark 6. 
As already noted in Remark 5, for a fixed q ∈ ( 0 , 1 ) , [ n ] q = 1 − q n 1 − q → 1 1 − q < ∞ as n → ∞ : it neither tends to 0 nor diverges. To obtain a sequence [ n ] q n diverging in the statistical sense needed below, q must again be allowed to vary with n, exactly as in Remark 5: if q n ∈ ( 0 , 1 ) satisfies s t − lim n → ∞ q n = 1 and s t − lim n → ∞ q n n = 1 , then s t - lim n → ∞ [ n ] q n = ∞ .
We are now ready to state the main result of this subsection.
Theorem 6. 
If the sequence q = q n satisfies Remark (6), and Y n , q n * is defined by Equation (5), then, for every n and every z ≥ 0 ,
( Y n , q n * h ) ( z ) − h ( z ) ≤ 2 ω h , δ n q n ,
where δ n q n is defined by Equation (9); consequently,
s t - lim n → ∞ ( Y n , q n * h ) ( z ) − h ( z ) = 0 .
Proof. 
Since each Y n , q n * is positive and linear, for n ≥ 2 and z ∈ [ 0 , ∞ ) , we get
( Y n , q n * h ) ( z ) − h ( z ) = Y n , q n * h ( y ) − h ( z ) , z ≤ Y n , q n * h ( y ) − h ( z ) , z .
Inequality (4) then gives
( Y n , q n * h ) ( z ) − h ( z ) ≤ ω ( h , δ ) 1 + 1 δ Y n , q n * y − z , z .
The Cauchy–Schwarz inequality then yields
( Y n , q n * h ) ( z ) − h ( z ) ≤ ω ( h , δ ) 1 + 1 δ Y n , q n * y − z 2 , z 1 2 = ω ( h , δ ) 1 + 1 δ δ n q n 1 2 .
With δ = δ n q n , this becomes, for every n,
( Y n , q n * h ) ( z ) − h ( z ) ≤ 2 ω h , δ n q n .
Since s t − lim n δ n q n = 0 , it follows that s t − lim n ω h , δ n q n = 0 , and hence, by the displayed inequality above, s t - lim n → ∞ ( Y n , q n * h ) ( z ) − h ( z ) = 0 . The operators Y n , q n * therefore converge statistically, pointwise, to h ( z ) , as claimed in Theorem 6.
This completes the proof.    □

4. Numerical and Graphical Section

This section reports a fully specified reproducible computation of the pointwise error | Y n , q * f ( z ) − f ( z ) | , addressing each of the gaps identified in this review, and the algorithm is given for each figure and table. The efficient numerical implementation of such structured operators is not only valuable for verifying theoretical estimates but is also crucial for their application in solving practical problems, such as the numerical treatment of fractional differential systems [34].
  • Implementation details:
All computations reported below use the uniform kernel Ψ ( y ) = 1 for y ∈ [ 0 , 1 ] and Ψ ( y ) = 0 elsewhere; the simple example of a kernel satisfying (a)–(c) was already given in Remark 1. This fixes α = 1 and m 1 = ∫ 0 1 y d y = 1 2 . With this choice, step (3) of the Algorithm below reduces to the plain (non-q) integral ∫ 0 1 f y − m 1 + [ b ] q [ n ] q q b − 1 d y , which is evaluated by composite Simpson’s rule on [ 0 , 1 ] with 200 equal subintervals (201 nodes); this was checked, for the ( n , q ) pairs of Table 1, to agree with an adaptive-quadrature reference (MATLAB R2026a’s integral, default tolerances) to within 10 − 10 . The truncation criterion in step (4) is sum over b = 0 , 1 , 2 , … and stop at the first index B for which ten consecutive terms υ n q ( z ) × ( step 3 ) all fall below 10 − 14 in absolute value; in practice, B ≤ 60 for every ( n , q , z ) combination used in Figure 1 and Table 1 and Table 2, consistent with the geometric decay of υ n q ( z ) established in the remark on convergence of the defining series in Section 2. These are the settings used to produce Figure 1 and Table 1, and are sufficient, together with the description below, to reproduce both independently.
Table 1. The ( n ,   q ) pairs used in Figure 1, with the pointwise error | Y n , q * f ( z ) − f ( z ) | at z = 1 and z = 2 , computed as described in the text.
Figure 1. Pointwise error | Y n , q * f ( z ) − f ( z ) | for f ( z ) = z / ( 1 + z ) over z ∈ [ 0.1 , 4 ] , computed by direct evaluation of (7) as described in the text, for the five ( n , q ) pairs of Table 1. The error decreases monotonically in n across the whole plotted range.
Table 2. The King-type second central moment δ n q = ( Y n , q * ( y − z ) 2 ) ( z ) against the classical/scaling-kernel moment Γ n , q ( ( t − z ) 2 , z ) = z [ n ] q ( 1 + z q ) of Proposition 1, at z = 2 , for the ( n ,   q ) pairs of Table 1: the inequality of Proposition 1 holds numerically in every case, confirming it is not asymptotically vacuous.
  • Algorithm.
For each pair ( n , q ) and each evaluation point z, (1) compute r n q ( z ) from (6); (2) for b = 0 , 1 , … , compute the q-binomial coefficient n + b − 1 b q from its product formula, the q-Pochhammer symbol ( 1 + r n q ( z ) ) q n + b = ∏ s = 0 n + b − 1 ( 1 + q s r n q ( z ) ) , and hence the weight υ n q ( z ) ; (3) evaluate the Simpson-quadrature approximation of ∫ 0 1 f y − m 1 + [ b ] q [ n ] q q b − 1 Ψ ( y ) d y ; (4) accumulate υ n q ( z ) × ( step 3 ) over b until the truncation criterion is met; and (5) subtract f ( z ) and take the absolute value. This is a direct elementary evaluation of (7) with no reliance on the closed forms derived in Section 3 and Section 4; so, it also serves as an independent numerical check on Theorem 1 and Corollary 1: at z = 0 , 1 , 2 , 3 , the computed values of ( Y n , q * e 1 ) ( z ) and ( Y n , q * e 2 ) ( z ) obtained this way agree with r n q ( z ) and z 2 , respectively, to within 10 − 10 , for every ( n , q ) pair in Table 1.
We illustrate the pointwise approximation error | Y n , q * f ( z ) − f ( z ) | over z ∈ [ 0.1 , 4 ] . In this notation, n stands for the degree (size) of the operator, while q ∈ ( 0 , 1 ) acts as a tuning parameter governing the smoothing, with a lower curve reflecting a better approximation. The ( n , q ) pairs behind each curve are listed in Table 1.
This illustration deliberately uses a single test function, f ( z ) = z / ( 1 + z ) : it is bounded, strictly increasing, and neither a polynomial nor asymptotically linear; so, none of the moment identities of Theorem 1 trivializes the resulting computation. It is worth stressing that the rate-of-convergence bounds of Section 4 are already proved uniformly over entire function classes ( C B [ 0 , ∞ ) , L i p λ ( μ ) , and R ν , D , respectively), not for this function alone. The numerical experiment therefore corroborates, on one concrete instance, bounds that are already established analytically for every admissible h, rather than substituting for that analysis. What the present study can, and does, add is a second, exactly computable numerical comparison that complements Table 2; rather than varying n at fixed q, Table 3 varies q at fixed n, using the closed-form expressions of Equation (9) and Proposition 1 directly, with no quadrature or truncation involved.
Table 3. Dependence on q, for fixed operator degree n = 6 and evaluation point z = 2 , of the King-type central moment δ n q and of the scaling-kernel moment Γ n , q ( ( t − z ) 2 , z ) , both evaluated exactly from their closed forms (9) and Proposition 1, respectively; no quadrature or truncation is involved.

5. Conclusions

We have introduced a King-type re-parametrization of the wavelet-assisted Kantorovich q-Baskakov operators, designed to reproduce the quadratic test function e 2 exactly. This exact reproduction is not merely formal: Proposition 1 proves, in closed form, that the resulting central moment δ n q n is strictly smaller than the corresponding moment for the classical and scaling-kernel operators from which Y n , q n * is built, for every z > 0 , n ≥ 1 , and 0 < q ≤ 1 , confirmed numerically in Table 2 across n and Table 3 across q. Since this moment drives every rate-of-convergence estimate in Section 4, the improvement carries through to the modulus-of-smoothness, Lipschitz-type, and statistical convergence rates alike. These analytical results hold uniformly over the stated function classes; the numerical illustration (Figure 1, Table 1) corroborates them on one representative test function rather than establishing them independently. The construction draws on the Jackson q-calculus throughout and on a wavelet-theoretic scaling-kernel idea in its definition, but it makes no claim regarding quantum computing or a full multiresolution decomposition; a systematic multi-function numerical benchmark and a direct comparison with other published King-type or wavelet-Kantorovich constructions remain natural directions for future work.

Author Contributions

Conceptualization, M.A.-M. and N.R.; methodology, M.A.-M. and N.R.; formal analysis, M.A.-M. and I.H.; investigation, M.A.-M.; writing—original draft preparation, M.A.-M.; writing—review and editing, I.H.; supervision, I.H. and N.R. 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 no conflicts of interest.

References

  1. King, J.P. Positive linear operators which preserve x2. Acta Math. Hung. 2003, 99, 203–208. [Google Scholar] [CrossRef] [Scilit]
  2. Bernstein, S. Démonstration du théorème de Weierstrass fondée sur le calcul des probabilités. Commun. Soc. Math. Kharkow 1912, 13, 1–2. [Google Scholar]
  3. Aral, A.; Gupta, V. Generalized q-Baskakov operators. Adv. Oper. Theory 2011, 61, 619–634. [Google Scholar] [CrossRef] [Scilit]
  4. Lupaş, A. A q-analogue of Bernstein operator. Semin. Numer. Stat. Calc. 1987, 9, 85–92. [Google Scholar]
  5. Altomare, F.; Campiti, M. Korovkin-Type Approximation Theory and Its Applications; Walter de Gruyter Studies in Mathematics 17; de Gruyter: Berlin, Germany, 1994. [Google Scholar]
  6. Doğru, O.; Örkcü, M. King type modification of Meyer-König and Zeller operators based on the q-integers. Math. Comput. Model. 2009, 50, 1245–1251. [Google Scholar] [CrossRef] [Scilit]
  7. Yilmaz, Ö.G.; Gupta, V.; Aral, A. On Baskakov operators preserving the exponential function. J. Numer. Anal. Approx. Theory 2017, 46, 150–161. [Google Scholar] [CrossRef] [Scilit]
  8. Mursaleen, M.; Naaz, A.; Khan, A. Dunkl generalization of q-Szász-Mirakjan Kantorovich operators which preserve some test functions. J. Inequal. Appl. 2016, 2016, 1–18. [Google Scholar] [CrossRef] [Scilit]
  9. 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, 175–185. [Google Scholar] [CrossRef] [Scilit]
  10. Rao, N.; Shahzad, M.; Jha, N.K. Study of two dimensional α-modified Bernstein bi-variate operators. FILOMAT 2025, 39, 1509–1522. [Google Scholar] [CrossRef] [Scilit]
  11. Alamer, A.; Nasiruzzaman, M. Approximation by Stancu variant of λ-Bernstein shifted knots operators associated by Bézier basis function. J. King Saud Univ. Sci. 2024, 36, 103333. [Google Scholar] [CrossRef] [Scilit]
  12. Burban, I. Two-Parameter Deformation of the Oscillator Algebra and (p, q)-Analog of Two-Dimensional Conformal Field Theory. J. Nonlinear Math. Phys. 1995, 2, 384–391. [Google Scholar] [CrossRef] [Scilit]
  13. Mohiuddine, S.A.; Özger, Z.Ö.; Özger, F.; Alotaibi, A.M. Construction of a new family of modified Bernstein-Schurer operators of different order for better approximation. J. Nonlinear Convex Anal. 2024, 25, 2059–2082. [Google Scholar]
  14. Mursaleen, M.; Ansari, K.J.; Khan, A. On (p, q)-analogue of Bernstein operators. Appl. Math. Comput. 2015, 266, 874–882, Erratum in Appl. Math. Comput. 2016, 278, 70–71. [Google Scholar] [CrossRef] [Scilit]
  15. Özger, F.; Aslan, R.; Ersoy, M. Some Approximation Results on a Class of Szász-Mirakjan-Kantorovich Operators Including Non-negative parameter α. Numer. Funct. Anal. Optim. 2025, 46, 481–484. [Google Scholar] [CrossRef] [Scilit]
  16. He, Z.; Zhong, H.; Shi, X.; Zhao, C.; Wen, J.; Shang, M. Accelerating the tuning process for optimizing DNN operators by ROFT model. Sci. Rep. 2025, 15, 36327. [Google Scholar] [CrossRef] [Scilit]
  17. Li, M.; Li, L.; Zhang, Z.; Zhang, Q. A novel method for generating permutation mass functions using permutations to represent class bias. Expert Syst. Appl. 2026, 319, 132004. [Google Scholar] [CrossRef] [Scilit]
  18. Ayman-Mursaleen, M. Quadratic function preserving wavelet type Baskakov operators for enhanced function approximation. Comp. Appl. Math. 2025, 44, 395. [Google Scholar] [CrossRef] [Scilit]
  19. Kumar, S.; Moreka, A.E.; Mursaleen, M. On wavelets Kantorovich (p, q)-Baskakov operators and approximation properties. J. Ineq. Appl. 2023, 2023, 134. [Google Scholar] [CrossRef] [Scilit]
  20. Kumar, S.; Moreka, A.E.; Mursaleen, M. Statistical approximation using wavelets Kantorovich (p, q)-Baskakov operators. Analysis 2024, 44, 105–114. [Google Scholar] [CrossRef] [Scilit]
  21. Nasiruzzaman, M. Function preserving the wavelets-associated approximation by Szasz-type operators in quantum calculus. J. Inequal. Appl. 2025, 2025, 157. [Google Scholar] [CrossRef] [Scilit]
  22. Nasiruzzaman, M.; Alqahtani, R.T.; Mohiuddine, S.A. Approximation Properties of a New Class of Beta-Type Szasz–Mirakjan Operators. J. Math. 2025, 2025, 6680828. [Google Scholar] [CrossRef] [Scilit]
  23. Nasiruzzaman, M.; Kiliçman, A.; Ayman-Mursaleen, M. Construction of q-Baskakov operators by wavelets and approximation properties. Iran. J. Sci. Technol. Trans. A Sci. 2022, 46, 1495–1503. [Google Scholar] [CrossRef] [Scilit]
  24. Savaş, E.; Mursaleen, M. Bézier type Kantorovich q-Baskakov operators via wavelets and some approximation properties. Bull. Iran. Math. Soc. 2023, 49, 68. [Google Scholar] [CrossRef] [Scilit]
  25. Nasiruzzaman, M.; Alotaibi, A. Kantorovich extension of parametric generalized q-Schurer operators and their approximation properties. Mathematics 2025, 13, 3770. [Google Scholar] [CrossRef] [Scilit]
  26. Daubechies, I. Ten Lectures on Wavelets; SIAM: Philadelphia, PA, USA, 1992. [Google Scholar]
  27. Graps, A. An introduction to wavelets. IEEE Comput. Sci. Eng. 1995, 2, 50–61. [Google Scholar] [CrossRef] [Scilit]
  28. Meyer, Y. Wavelets and Operators; Cambridge University Press: Cambridge, UK, 1992; Volume 1. [Google Scholar]
  29. Ayman-Mursaleen, M.; Nasiruzzaman, M.; Sharma, S.K.; Cai, Q.-B. Invariant means and lacunary sequence spaces of order (α, β). Demonstr. Math. 2024, 57, 20240003. [Google Scholar] [CrossRef] [Scilit]
  30. Gadjiev, A.D. The convergence problem for a sequence of positive linear operators on unbounded sets, and theorems analogous to that of P.P. Korovkin. Sov. Math. Dokl. 1974, 15, 1433–1436. [Google Scholar]
  31. Aral, A.; Doğru, O. Bleimann, Butzer, and Hahn operators based on the q-integers. J. Inequal. Appl. 2007, 1–12. [Google Scholar]
  32. Aral, A.; Doğru, O. Bernstein-Baskakov-Kantorovich operators and Lipschitz-type maximal functions. Colloq. Math. Soc. Janos Bolyai. 1990, 58, 469–496. [Google Scholar]
  33. Savaş, R.; Patterson, R.F. Multidimensional sliding window Pringsheim convergence for measurable functions. Rend. Circ. Mat. Palermo 2024, 73, 689–698. [Google Scholar] [CrossRef] [Scilit]
  34. Alqhtani, M.; Sadek, L.; Hammouch, Z.; Saad, K.M. Efficient numerical schemes for linear fractional differential systems with applications to diffusion problems. J. Frankl. Inst. 2025, 362, 108144. [Google Scholar] [CrossRef] [Scilit]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.