Next Article in Journal
Nontrivial Solutions for a Class of Quasilinear Schrödinger Systems
Next Article in Special Issue
Volume-Preserving Shear Transformation of an Elliptical Slant Cone to a Right Cone
Previous Article in Journal
Digital h-Fibrations and Some New Results on Digital Fibrations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Kantorovich Version of Vector-Valued Shepard Operators

by
Oktay Duman
1,
Biancamaria Della Vecchia
2,* and
Esra Erkus-Duman
3
1
Department of Mathematics, TOBB Economics and Technology University, Söğütözü, 06560 Ankara, Turkey
2
Dipartimento di Matematica, Università di Roma ‘Sapienza’, 00185 Roma, Italy
3
Department of Mathematics, Gazi University, Teknikokullar, 06500 Ankara, Turkey
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(3), 181; https://doi.org/10.3390/axioms13030181
Submission received: 9 February 2024 / Revised: 27 February 2024 / Accepted: 6 March 2024 / Published: 9 March 2024
(This article belongs to the Special Issue Mathematics, Computer Graphics and Computational Visualizations)

Abstract

:
In the present work, in order to approximate integrable vector-valued functions, we study the Kantorovich version of vector-valued Shepard operators. We also display some applications supporting our results by using parametric plots of a surface and a space curve. Finally, we also investigate how nonnegative regular (matrix) summability methods affect the approximation.

1. Introduction

In the early 1900s, S. Bernstein [1] introduced a family of operators known in the literature as Bernstein polynomials in order to approximate continuous functions, which enabled us to give a constructive proof of Weierstrass’s fundamental approximation theorem. In 1930, L. V. Kantorovich [2,3] gave a modification of the Bernstein polynomials to approximate not only continuous functions but also integrable functions. Later, this idea was applied to many well-known approximation operators. Such operators are known in the literature as Kantorovich-type operators. There are numerous studies in the literature related to Kantorovich operators. Especially in recent years, it has also been shown that these operators have significant advantages in fields such as artificial neural networks, signal and digital image processing, and sampling theory (see, for instance, [4,5,6,7]).
In this article, we study the Kantorovich version of the vector-valued Shepard operators that have been investigated in our recent study [8]. We should note that the classical Shepard operators, which were first introduced by D. Shepard [9] in 1968, are quite effective not only in classical approximation theory (see [10,11,12,13,14,15]) but also in some applied research (see [16,17,18]).
Now, we first recall some notations and definitions about the vector-valued Shepard operators examined in [8].
Let m , n N , K = [ 0 , 1 ] m = [ 0 , 1 ] × × [ 0 , 1 ] , and define the following set:
Ω n : = k = ( k 1 , k 2 , , k m ) N m : k i { 0 , 1 , , n } , i = 1 , 2 , , m .
Then, consider the following sample points of K :
x k , n = k 1 n , k 2 n , , k m n with k Ω n .
Let f = ( f 1 , f 2 , , f d ) d N be a vector-valued function defined on K , where each component f i : K R ( i = 1 , 2 , , d ) . Then, for λ > 0 , the vector-valued Shepard operators are defined in [8] as follows:
S n , λ ( f ; x ) = k Ω n x x k , n m λ f ( x k , n ) k Ω n x x k , n m λ ,
where · m represents the classical Euclidean distance on K . Note that the symbol k Ω n denotes the multi-index summation. We denote the space of all continuous vector-valued functions from K into R d by C ( K , R d ) . Then, in [8], we proved the following approximation result.
Theorem 1. 
(see Theorem 1 in [8]). For every f C ( K , R d ) and λ m + 1 , we have S n , λ ( f ) f on K , where the symbol ⇉ denotes the uniform convergence.
This paper is organized as follows. In the second section, we first construct the Kantorovich version of the vector-valued Shepard operators defined by (1) and give the statements of our main theorems, including L p -approximation, which improves Theorem 1. In the third section, we prove the theorems by using some auxiliary results. In the final section, we display some applications verifying our results and investigate the effects of nonnegative regular matrix summability methods for L p -approximation.

2. Construction of the Operators and Main Theorems

For a given vector-valued function f = ( f 1 , f 2 , , f d ) , assume that each component function f i : K R i = 1 , 2 , , d belongs to the space L p ( K ) p 1 . Then, we denote the space of all such vector-valued functions by L p K , R d . Then, we consider the following Kantorovich version of the operators (1):
L n , λ ( f ; x ) = ( n + 1 ) m k Ω n s k , n ( λ , x ) R k , n f ( y ) d y ,
where x K , n , m , d N , λ > 0 , f = ( f 1 , f 2 , , f d ) L p K , R d and
s k , n ( λ , x ) = x x k , n m λ k Ω n x x k , n m λ for x x j , n ( j Ω n ) ,
and s k , n ( λ , x j , n ) = δ k , j with δ k , j being the Kronecker delta. The set R k , n in (2) denotes the m-dimensional rectangle
R k , n : = k 1 n + 1 , k 1 + 1 n + 1 × × k m n + 1 , k m + 1 n + 1
and the multiple integral in (2) is actually a Bochner-type integral representation (see, for instance, [19]) and reads as follows (with respect to the components of f ) :
R k , n f ( y ) d y = R k , n f 1 ( y ) d y , , R k , n f d ( y ) d y .
Then, it is easy to check that L n , λ ( f ) may be written as
L n , λ ( f ; x ) = L ˜ n , λ ( f 1 ; x ) , L ˜ n , λ ( f 2 ; x ) , , L ˜ n , λ ( f d ; x ) ,
where L ˜ n , λ is given by
L ˜ n , λ ( g ; x ) : = ( n + 1 ) m k Ω n s k , n λ , x R k , n g ( y ) d y
for real-valued functions g defined on K . We say that L ˜ n , λ is the companion operator of L n , λ . In this case, L ˜ n , λ ( g ; x ) given by (4) becomes real-valued.
Here is our main approximation result.
Theorem 2. 
For every f L p K , R d ( p 1 ) and λ m + 1 , we have
L n , λ ( f ) f i n L p K , R d a s n .
We should note that by the convergence in (5), we mean componentwise convergence in the space L p ( K ) ; that is, for each i = 1 , 2 , , d ,
lim n L ˜ n , λ ( f i ) f i p = 0
holds, where the symbol · p denotes the usual L p -norm on K given by
g p = K g ( y ) p d y 1 / p , p 1
for a real-valued function g L p ( K ) .
To prove Theorem 2, we should first show that (5) is valid for all f C ( K , R d ) . That is, we also need the next result.
Theorem 3. 
For every f C ( K , R d ) and λ m + 1 , the convergence in (5) holds.

3. Auxiliary Results and Proofs of the Main Theorems

To prove Theorems 2 and 3, we need the following lemmas.
Lemma 1. 
(see [8]). Let n , m N and x K with x x k , n for k Ω n . Then, for every λ > 0 ,
k Ω n x x k , m m λ 1 = O n λ
holds.
For the function s k , n ( λ , x ) given by (3), we get the next result.
Lemma 2. 
For every x = ( x 1 , x 2 , , x m ) K and λ > 1 ,
s k , n ( λ , x ) C i = 1 m [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2
holds for k Ω n , where C is a positive constant depending at most on λ , m , and α is the greatest integer not exceeding α.
Proof. 
First, assume that x = x j , n j Ω n . Since
s k , n ( λ , x j , n ) = δ k , j = 1 , if k = j 0 , if k j ,
the proof follows immediately. Assume now that x x j , n j Ω n . Let [ ( n + 1 ) x i ] = N i for each i = 1 , 2 , , m . Then, we observe that
N i n + 1 x i < N i + 1 n + 1 for i = 1 , 2 , , m .
For each i = 1 , 2 , , m , we have the following five possible cases:
k i < N i 1 or k = N i 1 , N i , N i + 1 or k i > N i + 1
Therefore, we have a total of 5 m possible cases. After some simple computations, it is possible to check that (6) is valid for all possible cases. Now we show some of them. For example, let k i < N i 1 for all i = 1 , 2 , , m . Lemma 1 implies that there exists a positive constant C 1 such that
s k , n ( λ , x ) C 1 n λ x x k , n m λ = C 1 i = 1 m ( n x i k i ) 2 λ / 2 .
Then, we get
s k , n ( λ , x ) C 1 i = 1 m n N i n + 1 k i 2 λ / 2 = C 1 i = 1 m n ( N i k i ) k i n + 1 2 λ / 2 C 1 i = 1 m ( N i k i 1 ) 2 λ / 2 C 1 i = 1 m N i k i + 1 4 2 λ / 2 = C i = 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 ,
where C : = 4 λ C 1 . Now, for some m 0 { 1 , 2 , , m 1 } , if k i < N i 1 for i = 1 , 2 , , m 0 and k i > N i + 1 for i = m 0 + 1 , , m , then using the same constants C 1 and C , we see that
s k , n ( λ , x ) C 1 i = 1 m ( n x i k i ) 2 λ / 2 C 1 i = 1 m 0 n N i n + 1 k i 2 + i = m 0 + 1 m k i n ( N i + 1 ) n + 1 2 λ / 2 = C 1 i = 1 m 0 n ( N i k i ) k i n + 1 2 + i = m 0 + 1 m n ( k i N i 1 ) + k i n + 1 2 λ / 2 C 1 i = 1 m 0 N i k i 1 2 + i = m 0 + 1 m ( k i N i 1 ) 2 λ / 2 C 1 i = 1 m 0 N i k i + 1 4 2 + k i N i + 1 4 2 λ / 2 = C i = 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 .
Now let k i = N i 1 for all i = 1 , 2 , , m . Then we observe that
s k , n ( λ , x ) 1 = 4 m λ / 2 i = 1 m ( 1 + 1 ) 2 λ / 2 = 4 m λ / 2 i = 1 m ( N i ( N i 1 ) + 1 ) 2 λ / 2 = 4 m λ / 2 i = 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 .
Also, for a given m 0 { 1 , 2 , , m 1 } , if k i = N i for i = 1 , 2 , , m 0 and k i > N i + 1 for i = m 0 + 1 , , n , we may then write that
s k , n ( λ , x ) C 1 i = m 0 + 1 m ( n x i k i ) 2 λ / 2 C 1 i = m 0 + 1 m n N i n + 1 k i 2 λ / 2 C 1 i = m 0 + 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 m m m 0 λ / 2 C 1 m 0 + i = m 0 + 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 = m m m 0 λ / 2 C 1 i = 1 m 0 N i N i + 1 2 + i = m 0 + 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 = C i = 1 m ( [ ( n + 1 ) x i ] k i + 1 ) 2 λ / 2 ,
where C = m m m 0 λ / 2 C 1 . By making similar calculations, it can be shown that (6) holds true in all other cases. □
Now for each fixed x K , define the function φ x on K by
φ x ( y ) : = y x m .
Then, we get the next lemma.
Lemma 3. 
For any x K , we have
L ˜ n , λ ( φ x ; x ) = O ( n 1 ) , i f λ > m + 1 O ( n 1 log n ) , i f λ = m + 1 .
Proof. 
For a given n N and x = x 1 , x 2 , , x m K , there exists u = ( u 1 , u 2 , , u m ) Ω n such that x i u i n + 1 , u i + 1 n + 1 for i = 1 , 2 , , m . Hence, Lemma 2 implies that
s k , n ( λ , x ) C i = 1 m u i k i + 1 2 λ / 2 .
Then, we get
L ˜ n , λ ( φ x ; x ) = ( n + 1 ) m k Ω n s k , n ( λ , x ) R k , n y x m d y ( n + 1 ) m k Ω n s k , n ( λ , x ) ( n + 1 ) m + 1 i = 1 m u i k i + 1 2 1 / 2 C n + 1 k Ω n i = 1 m u i k i + 1 2 ( 1 λ ) / 2 C n + 1 k 1 , k 2 , , k m = 1 n 1 k 1 2 + k 2 2 + + k m 2 ( λ 1 ) / 2 .
We know from Lemma 2.2 in [8] and its conclusion that
k 1 , k 2 , , k m = 1 n 1 k 1 2 + k 2 2 + + k m 2 ( λ 1 ) / 2 = O ( 1 ) , if λ > m + 1 O ( log n ) , if λ = m + 1 .
Therefore, by combining the above results, the proof is completed. □
With the help of the above lemmas, we first prove Theorem 3.
Proof of Theorem 3. 
Let f = ( f 1 , f 2 , , f d ) C ( K , R d ) and λ m + 1 . By the uniform continuity of each component f i i = 1 , 2 , , d on K , for every ε > 0 , there exists a δ i > 0 such that
f i ( y ) f i ( x ) < ε
for all x , y K satisfying y x m < δ i . Then, it follows from (4) that for each i = 1 , 2 , , d ,
L ˜ n , λ ( f i ; x ) f i ( x ) ( n + 1 ) m k Ω n s k , n ( λ , x ) K f i ( y ) f i ( x ) d y ( n + 1 ) m k Ω n s k , n ( λ , x ) K ε + 2 M δ i y x m d y = ε + 2 M i δ i L ˜ n , λ ( φ x ; x ) .
Lemma 3 implies that for each i = 1 , 2 , , d ,
L ˜ n , λ ( f i ) f i on K
holds for λ m + 1 . Since the uniform convergence on K implies L p -convergence, we obtain for each i = 1 , 2 , , m that
lim n L ˜ n , λ ( f i ) f i p = 0
holds for λ m + 1 , which completes the proof. □
For the proof of Theorem 2, we also need the next lemma.
Lemma 4. 
Let λ m + 1 and p 1 . Then, the sequence of companion operators { L ˜ n , λ } given by (4) is uniformly bounded from L p K into itself, i.e., for every g L p K ,
L ˜ n , λ ( g ) p B g p
holds for some absolute constant B.
Proof. 
Lemma 2 immediately gives that for every k Ω n ,
K s k , n ( λ , x ) d x = u Ω n R u , n s k , n ( λ , x ) d x C u Ω n R u , n i = 1 m ( u i k i + 1 ) 2 λ / 2 d x = C ( n + 1 ) m u Ω n i = 1 m ( u i k i + 1 ) 2 λ / 2 C ( n + 1 ) m k 1 , k 2 , , k m = 1 n 1 k 1 2 + k 2 2 + + k m 2 λ / 2 = O 1 ( n + 1 ) m
holds for λ m + 1 . If g L 1 K , then we obtain that
L ˜ n , λ ( g ) 1 = K L ˜ n , λ ( g ; x ) d x ( n + 1 ) m k Ω n R k , n g ( y ) d y K s k , n ( λ , x ) d x C k Ω n R k , n g ( y ) d y ,
which yields
L ˜ n , λ ( g ) 1 C g 1 for λ m + 1 .
On the other hand, if g C ( K ) , then one can easily check that
L ˜ n , λ ( g ) f ,
where the symbol · denotes the usual supremum norm on K . Therefore, considering (7) and (8), the Riesz–Thorin theorem [20] (see also [15]) implies that for some absolute constant B > 0 ,
L ˜ n , λ ( g ) p B g p
is satisfied for every g L p ( K ) p 1 and λ m + 1 . □
Then, we are ready to give the proof of our main theorem.
Proof of Theorem 2. 
Let f L p ( K , R d ) ( p 1 ) . Then for each component f i L p ( K ) , i = 1 , 2 , , d , there exists a real-valued continuous function g i on K such that
L ˜ n , λ ( f i ) f i p L ˜ n , λ ( f i g i ) p + L ˜ n , λ ( g i ) g i p + f i g i p .
Then, we may write from Lemma 4 that, for every λ m + 1 ,
L ˜ n , λ ( f i ) f i p C f i g i p + L ˜ n , λ ( g i ) g i p
holds for some C > 0 . From Theorem 3, we get
lim n L ˜ n , λ ( g i ) g i p = 0 .
Now, since the space of all real-valued and continuous functions on K is dense in the space L p ( K ) , the proof is completed from (9) and (10). □

4. Illustrations and Concluding Remarks

We first give applications of Theorems 2 and 3 on the set K = [ 0 , 1 ] m . Later, we modify vector-valued Shepard operators in order to show the effects of regular summability methods in the approximation.
Example 1. 
Take d = 3 and m = 2 . Define the function f on K = [ 0 , 1 ] 2 by
f ( x ) = f 1 ( x ) , f 2 ( x ) , f 3 ( x ) ,
where for x = ( x 1 , x 2 ) K , the component functions are given, respectively, by
f 1 ( x ) = x 1 , f 2 ( x ) = x 2 , f 3 ( x ) = [ x 1 + x 2 ] .
Then, we obtain from Theorem 2 that for every λ 3 and p 1 ,
L n , λ ( f ) f i n L p [ 0 , 1 ] 2 , R 3 a s n .
If the function f is considered to be a three-dimensional surface parametrized by x 1 and x 2 , one can produce its three-dimensional parametric plots with the help of the Mathematica program. Similarly, we can also produce the corresponding approximations by vector-valued Shepard operators. Such parametric plots are shown in Figure 1 for the values n = 5 ,   12 ,   20 and λ = 6 . Observe that since f is not continuous on K , Theorem 1 is not valid for the function f given by (11). Hence, this example explains why we also need the Kantorovich version of vector-valued Shepard operators.
Example 2. 
Take d = 3 and m = 1 . Now define the function h on the set K = [ 0 , 1 ] by
h ( x ) = sin 20 x , cos 20 x , 2 x .
Then this function parametrized by x gives a helix curve. Since h C K , R 3 , we obtain from Theorems 1 and 3 that for every λ 2 ,
L n , λ ( h ) h o n [ 0 , 1 ]
and
L n , λ ( h ) h i n L p [ 0 , 1 ] , R 3 .
This approximation is indicated in Figure 2 for the values n = 15 ,   22 ,   30 and λ = 4 .
Finally, we discuss the regular summability methods on the L p -approximation. Before giving our final application, we recall some concepts from summability theory. For a given infinite matrix A : = [ a j n ] j , n N and a sequence x : = x n , the A-transformed sequence of ( x n ) is defined by A x : = ( A x ) j = n = 1 a j n x n provided that the series is convergent for every j N . Also, A = [ a j n ] is called regular if lim A x = L whenever lim x = L (see [21]). A = [ a j n ] is nonnegative if a j n 0 for all j , n N . Now let A = [ a j n ] be a nonnegative regular summability matrix. Then, we say that a sequence ( x n ) is A-summable (or A-convergent) to a number L if lim n ( A x ) j = L . It is also possible to give the same definition for a sequence of functions in the space L p K , R d p 1 . Let f n be a sequence of vector-valued functions in L p K , R d , and let A = [ a j n ] be a nonnegative regular summability method such that n = 1 a j n f n L p K , R d for every j N . Then, we say that ( f n ) is A-summable to a function f in L p K , R d if n = 1 a j n f n f in L p K , R d as j . As stated before, here we mean the componentwise L p -convergence on K .
We should note that the use of regular summability methods in the approximation theory enables us to get more powerful results than the classical ones. We will now consider an application in this direction.
Example 3. 
In this application, we modify the vector-valued Kantorovich–Shepard operators in (2) as follows:
L n , λ * ( f ; x ) : = 1 + f ( x ) , i f n = k 2 k N L n , λ ( f ; x ) otherwise ,
where 1 = 1 , 1 , , 1 . Since 1 + f f , we cannot get an L p -approximation to f by means of the operators L n , λ * ( f ) given by (13); that is, for every λ > 0 and i = 1 , 2 , , d ,
L n , λ * ( f ) f i n L p K , R d a s n .
Now to overcome the loss of convergence, we consider the well-known Cesàro summability method C 1 : = [ c j n ] (see [21] for details) given by
c j n = 1 j , i f n = 1 , 2 , , j 0 , otherwise .
Let f L p K , R d p 1 and λ m + 1 be given. Then, we observe that the arithmetic mean of L n , λ * ( f ) is L p -convergent to f in L p K , R d . To see that considering the companion operator L ˜ n , λ * of (13), it is enough to show that for each i = 1 , 2 , , d , the sequence L ˜ n , λ * ( f i ) , i = 1 , 2 , , d , is C 1 -summable (with respect to the L p -norm on K ) to the function f i . Indeed, by using (13) we may write that
n = 1 c j n L ˜ n , λ * ( f i ) f i p = 1 j n = 1 j L ˜ n , λ * ( f i ) f i p 1 j n = 1 j L ˜ n , λ * ( f i ) f i p = 1 j n = 1 n = k 2 j L ˜ n , λ * ( f i ) f i p + 1 j n = 1 n k 2 j L ˜ n , λ * ( f i ) f i p 1 j + 1 j n = 1 j L ˜ n , λ ( f i ) f i p ,
where L ˜ n , λ is the classical companion operator given by (4). Now, by taking the limit as j on both sides of the last inequality, we obtain from Theorem 2 and the regularity of the Cesàro method that for each i = 1 , 2 , , d ,
lim j n = 1 c j n L ˜ n , λ * ( f i ) f i p = 0 ,
holds, which means
L 1 , λ * ( f ) + L 2 , λ * ( f ) + + L j , λ * ( f ) j f i n L p K , R d a s j .
In other words, the sequence L n , λ * ( f ) is C 1 -summable to f in L p K , R d .

Author Contributions

This material is the result of the joint efforts of O.D., B.D.V. and E.E.-D. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

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

Acknowledgments

The authors would like to thank the anonymous reviewers for their valuable comments.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Bernstein, S. Démonstration du théorème de Weierstrass fondée sur le calcul des probabilités. Commun. Kharkov Math. Soc. 1913, XIII, 1–2. [Google Scholar]
  2. Kantorovič, L.V. Sur certains développements suivant les polynomes de la forme de S.Bernstein, I. Comptes Rendus L’AcadéMie Des Sci. L’Urss 1930, 20, 563–568. [Google Scholar]
  3. Kantorovič, L.V. Sur certains développements suivant les polynomes de la forme de S.Bernstein, II. Comptes Rendus L’AcadéMie Des Sci. L’Urss 1930, 20, 595–600. [Google Scholar]
  4. Angeloni, L.; Vinti, G. Multidimensional sampling-Kantorovich operators in BV-spaces. Open Math. 2023, 21, 20220573. [Google Scholar] [CrossRef]
  5. Costarelli, D. Approximation error for neural network operators by an averaged modulus of smoothness. J. Approx. Theory 2023, 294, 105944. [Google Scholar] [CrossRef]
  6. Costarelli, D.; Spigler, R. Convergence of a family of neural network operators of the Kantorovich type. J. Approx. Theory 2014, 185, 80–90. [Google Scholar] [CrossRef]
  7. Orlova, O.; Tamberg, G. On approximation properties of generalized Kantorovich-type sampling operators. J. Approx. Theory 2016, 201, 73–86. [Google Scholar] [CrossRef]
  8. Duman, O.; Vecchia, B.D. Vector-Valued Shepard Processes: Approximation with Summability. Axioms 2023, 12, 1124. [Google Scholar] [CrossRef]
  9. Shepard, D. A two-dimensional interpolation function for irregularly-spaced data. In Proceedings of the 23rd ACM National Conference, New York, NY, USA, 27–29 August 1968; pp. 517–524. [Google Scholar]
  10. Della Vecchia, B. Direct and converse results by rational operators. Constr. Approx. 1996, 12, 271. [Google Scholar] [CrossRef]
  11. Duman, O.; Della Vecchia, B. Complex Shepard operators and their summability. Results Math. 2021, 76, 214. [Google Scholar] [CrossRef]
  12. Duman, O.; Della Vecchia, B. Approximation to integrable functions by modified complex Shepard operators. J. Math. Anal. Appl. 2022, 512, 126161. [Google Scholar] [CrossRef]
  13. Farwig, R. Rate of convergence of Shepard’s global interpolation formula. Math. Comput. 1986, 46, 577–590. [Google Scholar] [CrossRef]
  14. Hermann, T. Rational interpolation of periodic functions. In Supplemento ai Rendiconti del Circolo Matematico di Palermo, Proceedings of the Second International Conference in Functional Analysis and Approximation Theory, Acquafredda di Maratea, Italy, 14–19 September 1992; Circolo Matematico di Palermo: Palermo, Italy, 1993; Series 2; Volume 33, pp. 337–344. [Google Scholar]
  15. Zhou, X. The saturation class of Shepard operators. Acta Math. Hung. 1998, 80, 293–310. [Google Scholar] [CrossRef]
  16. Dell’Accio, F.; Di Tommaso, F. Complete Hermite–Birkhoff interpolation on scattered data by combined Shepard operators. J. Comput. Appl. Math. 2016, 300, 192–206. [Google Scholar] [CrossRef]
  17. Dell’Accio, F.; Di Tommaso, F. On the hexagonal Shepard method. Appl. Numer. Math. 2020, 150, 51–64. [Google Scholar] [CrossRef]
  18. Dell’Accio, F.; Di Tommaso, F.; Hormann, K. On the approximation order of triangular Shepard interpolation. IMA J. Numer. Anal. 2016, 36, 359–379. [Google Scholar] [CrossRef]
  19. Mikusiński, J. The Bochner Integral; Lehrbücher und Monographien aus dem Gebiete der Exakten Wissenschaften, Mathematische Reihe; Birkhäuser Verlag: Basel, Switzerland; Stuttgart, Germany, 1978; pp. xii+233. [Google Scholar] [CrossRef]
  20. Zygmund, A. Trigonometric Series, 3rd ed.; Cambridge Mathematical Library, Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  21. Boos, J.; Cass, P. Classical and Modern Methods in Summability; Oxford Mathematical Monographs, Oxford University Press: Oxford, UK, 2000; p. 600. [Google Scholar]
Figure 1. Parametric plots of L n , λ ( f ) for the values n = 5 ,   12 ,   20 and λ = 6 , where f is given by (11).
Figure 1. Parametric plots of L n , λ ( f ) for the values n = 5 ,   12 ,   20 and λ = 6 , where f is given by (11).
Axioms 13 00181 g001
Figure 2. Parametric plots of L n , λ ( h ) for the values n = 15 ,   22 ,   30 and λ = 4 , where h is given by (12).
Figure 2. Parametric plots of L n , λ ( h ) for the values n = 15 ,   22 ,   30 and λ = 4 , where h is given by (12).
Axioms 13 00181 g002
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

Duman, O.; Della Vecchia, B.; Erkus-Duman, E. Kantorovich Version of Vector-Valued Shepard Operators. Axioms 2024, 13, 181. https://doi.org/10.3390/axioms13030181

AMA Style

Duman O, Della Vecchia B, Erkus-Duman E. Kantorovich Version of Vector-Valued Shepard Operators. Axioms. 2024; 13(3):181. https://doi.org/10.3390/axioms13030181

Chicago/Turabian Style

Duman, Oktay, Biancamaria Della Vecchia, and Esra Erkus-Duman. 2024. "Kantorovich Version of Vector-Valued Shepard Operators" Axioms 13, no. 3: 181. https://doi.org/10.3390/axioms13030181

APA Style

Duman, O., Della Vecchia, B., & Erkus-Duman, E. (2024). Kantorovich Version of Vector-Valued Shepard Operators. Axioms, 13(3), 181. https://doi.org/10.3390/axioms13030181

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