About this Journal Submit a Manuscript Table of Contents
Journal of Function Spaces and Applications
Volume 2013 (2013), Article ID 856084, 10 pages
http://dx.doi.org/10.1155/2013/856084
Research Article

Approximation Strategy by Positive Linear Operators

Science School, Nanjing University of Science and Technology, 200 Xiao Ling Wei Street, Nanjing 210094, China

Received 31 March 2013; Accepted 28 June 2013

Academic Editor: Satit Saejung

Copyright © 2013 Wei Xiao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Two important techniques to achieve the Jackson type estimation by Kantorovich type positive linear operators in spaces are introduced in the present paper, and three typical applications are given.

1. Introduction

It is well known that Kantorovich type operators are usually used for approximation in spaces. Let , the class of all power integrable functions on the interval , and (, or ) be given kernels satisfying

This paper discusses how well the function can be approximated by the discrete Kantorovich-type operators such as or and the approximation is characterized by where , a positive number depending on only (such as , ), is called Jackson order of approximation; and , a constant depending sometimes upon as well as the kernels (e.g., the kernels of the Shepard operators; it contains a parameter ; see (10)), is called Jackson constant. Since the kernel can have two types, decided by the summation indices, respectively (see (1)), the Kantorovich type operators are therefore defined by (2) or (3). However, with similar arguments, we can only investigate the positive linear operators of the form of (3).

Sometimes, we need to write for , ; then the operators (3) can be written as an integral form: hence, This means, for Kantorovich type operators, there does not exist any difference whether (3) or (5) is taken. In particular, we give the following examples.

When the kernel function satisfies where satisfying is a polynomial with a degree at most 2, then the operators have exponential type, which have been studied deeply in [13], for example.

When the kernel function in (3) is taken as where is a Müntz system satisfying that ( is a given positive number), then the operator becomes the rational Müntz operator: readers can refer to [4, 5].

When the kernel function of (2) is taken as then the operator is the well-known Shepard operator one can check [6, 7], for example.

When the kernel in (2) is taken as then we obtain the Kantorovich-Bernstein operator which has been studied most widely among the positive linear operators of the form (2) (see [823]). Interested readers could also refer to the related papers for the other similar operators.

This paper will take the above three typical operators (9), (11), and (13) as examples to illustrate two quantitative methods on approximation. Over discussion, we find out that the Jackson order in spaces to approximate by the operators in (3) or (5) is decided completely by the kernels , or by the kernel function . Therefore, on applying this idea, we need only to investigate the properties of the kernels to obtain the magnitude of the Jackson order of the corresponding operators, which seems to be a different approach from the past approximating methods.

2. Notations and Terminologies

In this section, we give all preliminary notations and terminologies. For , the usual norm is defined by and the modulus of continuity of is defined by To understand clearly approximation by the positive linear operators, we need to make analysis of the kernels corresponding to the operators. Hence, some new terminologies on the kernels will be given and explained by some examples. For convenience, always indicates an absolute positive constant and indicates a positive constant depending upon at most . or may have different values at different occurrences even at the same line. Sometimes we write .

Definition 1. For any , if there exists a real sequence with , , satisfying then is called a global domination of , or we say is globally dominated by , where indicates the greatest integer not exceeding . In particular, if , , , then the kernel sequence is called a globally dominated geometrical sequence, or being dominated by a global geometrical sequence, or having (global) geometrical order. If , , , then the kernel sequence is called a globally dominated arithmetic sequence with power , or being dominated by a global arithmetic sequence with power , or having (global) -arithmetic order.

Definition 2. For any , if there exist a sequence with , and an integer subset satisfying that then is called a local domination of . Like in Definition 1, a locally dominated geometrical sequence of and a locally dominated -arithmetic sequence can be defined similarly.

The conceptions of Definitions 1 and 2 will be illustrated by the following examples.

Example 3. The kernel functions of the rational Müntz operators defined by (9) satisfy (see [4] or [5, Lemma 1]). The kernel functions then have geometrical order.

Example 4. The kernels of the Shepard operators    defined by (11) satisfy (see [12, Lemma 1]). The kernels have -arithmetic order.

Example 5. The kernels of the Kantorovich-Bernstein operators (13) satisfy where , and satisfies for real number (see [15, Theorem 1.5.2]). That is to say, if the set of all satisfying (21) is written as , then, while , has asymptotic expression (20). Hence, the kernels of Bernstein operators, from Definition 2, have local geometrical order.

Definition 6. For , and any , denote particularly,

Definition 7. For , write where is the global domination of in Definition 1. In particular,

Example 8. For any , from Example 3, we have where the kernels (8), as well as , from Definitions 6 and 7, satisfy and for all and any given .

Example 9. Propose that , write . In view of Example 4, we get Thus, from Definitions 6 and 7, the kernels (10), as well as , satisfy and for some .

Remark 10. We make a brief discussion on the above definitions.(1) or for some obviously yields that or ; the converse may not be true.(2)The kernels having geometrical order satisfy and for all and .(3)The kernels having -arithmetic order satisfy for .

3. Elementary Approximation Technique (I)

This section gives one of the approximation techniques in spaces by the Kantorovich type operators (3). We mainly apply -functional and maximum principle to obtain the Jackson type estimation in spaces.

Theorem 11. Let be a positive null sequence. For any , , the Kantorovich operators defined by (3) satisfy (i) which is uniformly bounded;(ii).Then, the estimate holds, where is a positive constant depending upon only.

Proof. For any function , from the definition of the -functional where indicates the set of all absolute continuous functions on the interval , we know that and are equivalent (see [24, Theorem 2.1]); that is, where we mean there is a constant independent of such that .
For given , the Hardy-Littlewood maximum function is defined by where if , we simply set . It is well known that (see [25]) Since for any , , , we have then the condition (i) of Theorem 11 induces that It is easy to deduce from definition (3) that With the condition (ii) in Theorem 11, we obtain Combining (32) and (36) leads to Together with (34) and (37), we get Finally, from the definition of the -functional we achieve that Therefore, in view of (30) and (39), we have completed Theorem 11.

4. Elementary Approximation Technique (II)

In Section 3, by applying the -functional, we obtain the Jackson type estimation in spaces for . However, the Jackson constant in that case must depend upon , and thus we cannot establish corresponding result in space! In this section, we will exhibit another efficient technique in spaces which will be used to obtain Jackson constant independent of !

Theorem 12. Let , , an be given with and the positive linear operators defined by (3). If the kernels with (1) are dominated globally by , and for some satisfy the following conditions:(i), (ii), then, the estimate holds, where is an absolute constant.

To prove Theorem 12, we first give two lemmas.

Lemma 13. Given with and , write the Steklov function of as where . Then, the following results hold:

Proof. Equations (42) and (43) can be directly verified from the definition of the Steklov function (41).

Lemma 14. Propose that , , , , and , then for any , one has

Proof. This Lemma is proved in [7]; we give a sketch here for self-completeness. Due to the symmetries on and , as well as on and , we need only to prove the lemma under . By calculations, Lemma 14 is done.

Proof of Theorem 12. Take in the Steklov function (41); check by applying Minkowski inequality, we get Then, apply Hölder inequality: When , . From the definition of the domination, we know Then, Applying Lemma 14, we have Applying (ii), we see that so that we obtain
Now we verify the case when . It is not difficult to see from Lemma 13 that . By the definition of Kantorovich type operators, rewrite This leads to Since , where Note that Furthermore, condition (ii) implies that This means However, from Lemma 13, which leads to Combining (62) with (43), we get This, with (53), finishes Theorem 12.

For space, we have the following result while conditions of Theorem 12 can be loosed.

Theorem 15. Let , be defined by (3). If the kernels with (1) are dominated globally by and satisfy , then the estimate holds.

Proof. The argument of proof is similar, and we can just repeat the corresponding parts of the proof of Theorem 12.

Remark 16. (1) If the kernels possess good properties, the conditions of Theorem 12 can be easily verified on the terminology of domination. For instance, if the kernels have geometric order, then the corresponding conditions of Theorem 12 are obviously satisfied (see the next section).
(2) There exists essential difference between Theorem 11 and Theorem 12. Theorem 11 requires weaker conditions than Theorem 12 does, but the latter obtains stronger result (the Jackson order is complete up to , and the Jackson constant is independent of !); we will make further illustrations in the coming section.

5. Applications

This section illustrates how to apply Theorems 11 and 12 to estimate approximation. To check the efficiency of two techniques on approximation by Kantorovich type positive linear operators, three examples will be exhibited. Those positive linear operators come from three different categories: rational Müntz operators from rational Müntz systems; the Shepard operators from general real rational function systems; and Bernstein polynomials from the polynomial system. Moreover, in our point of view, they represent three different types: positive linear operators with kernels of geometric order, positive linear operators of arithmetical order, and positive linear operators of local geometric order. It is because the kernels have different domination properties or different speeds of that the approximations by the corresponding positive linear operators possess different Jackson orders.

To show the key role of the global (or local) domination on the kernels, the condition (ii) of Theorem 11 will be further explicated to the following lemma.

Lemma 17. For any kernel , one has Especially, if the kernels are globally dominated, then

Proof. From definition (3),
For any , there exists an integer such that ; then will be calculated according to the following three cases, respectively.(a)When , (b)When , (c)When , Combining (a), (b), and (c), we obtain that From Definition 6, (67) and (71) yield (65). At the same time, since the kernels of are globally dominated, we obtain by Definition 1 that Thus, that is, from Definition 7, (66) holds.
Lemma 17 is done.

5.1. Rational Müntz Approximation

Rational Müntz Approximation has been researched in [5], shows the application of Theorem 12, and simplifies the proof of [5].

Write where , , is the class of all linear combinations of . For , define

Corollary 18. Given , , the rational Müntz operators are defined by (9). If , , where is an absolute constant, one has where is an absolute constant depending only upon (independent of !).

Proof. We verify that satisfies all the requirements of Theorem 12. Take , where is the constant appeared in [4], or [5]; see the following inequality (77). Given a fixed with , we verify that
(i) .
From [4], or [5], Then,
(ii) .
Due to Example 3, we have . From Definition 7, Therefore, Corollary 18 can be deduced from Theorem 12.

By the same argument of (ii), we obviously can obtain . From (66), we know . Moreover, it is simple to verify (see, e.g., [7]). Hence, applying Theorem 11, we get

Corollary 19. For rational Müntz operator (9), one has where is depending on and .

Remark 20. Since the kernels (8) have geometrical order (see Example 3), they certainly satisfy the conditions of both Theorems 11 and 12. Hence, approximation by these rational Müntz operators can always reach the Jackson order by applying both techniques of Theorems 12 and 11. However, for these operators, the conclusion of Corollary 18 surely contains Corollary 19 and makes the latter trivial.

5.2. The Shepard Operators

The approximation of the Shepard operators in the continuous function space has been studied very deeply (see [13, 2632]). The approximation by the Shepard operators is investigated in [6, 7].

Corollary 21. Proposed that , , the Shepard operators are defined by (11). Then, where

Proof. By applying Theorem 11, we verify this result.(i) are uniformly bounded (see [6]).(ii) (Lemma 17, Inequality (66)).
Due to Example 4, we know that the global dominated sequence is . Then, from Definition 7,
When , .
When , .
When , .
By Theorem 11, Corollary 21 holds.

Corollary 22. Propose that , , the Shepard operators are defined by (11). If , then where depends on only.

Proof. Theorem 12 will be applied to prove this result. The details can be referred in [7]. When , let , then , and . Evidently, the Shepard kernels have -arithmetic order (see Example 4). We check the corresponding conditions of Theorem 12:
(i) .
From Definition 6 and Example 4,
Then,
(ii) .
Note that the present dominated sequence ; then from Definition 7
Corollary 22 is completed from Theorem 12 as (i) and (ii) hold.

Remark 23. The difference between approximation techniques (I) and (II) with respect to Theorems 11 and 12 is fully exhibited on the Shepard operators by Corollaries 21 and 22. Stronger requirements by applying technique (II) than by applying technique (I) are needed. However, if the conditions are satisfied, the former can obtain essentially better result (the Jackson constant is independent of !). On this particular case, we can obtain the Jackson type estimation by applying technique (I) for , while achieve the corresponding result by applying technique (II) only for . We still do not know how to deal with the cases when by applying technique (II).

5.3. Bernstein Operators

There are many results on approximation by Bernstein polynomials; interested readers may refer to [823]. These results can be classified into the following categories:(1)uniform convergence; see [8, 12, 15, 18];(2)quantitative estimations; see [10, 11, 14, 19];(3)equivalence theorems; see [16, 17];(4)saturation problems; see [9, 16, 2023].

Here, we apply our technique (I) to test the corresponding Jackson type estimation as an example. The following proof is simpler than the past proof.

Corollary 24. Given , , one has the following estimation:

Proof. is uniformly bounded which is known from [33]. We only need to evaluate from Theorem 11. It is known from [15, page 15] and Definition 6 that From (65) of Lemma 17 and (88), which, from Theorem 11, leads to Corollary 24.

Remark 25. The approximation order of Corollary 24 is sharp which shows that (88) cannot be improved. In other words, is unbounded. Hence, the approximation technique (II) or Theorem 12 cannot be applied in this case. That is to say, we can never obtain the Jackson constant independent of for Bernstein polynomials in spaces. Furthermore, Corollary 24 also exhibits that Kantorovich type operators (2) or (3) cannot reach Jackson type estimation with the Jackson constant independent of unless their kernels possess good properties such as having globally geometric domination (rational Müntz approximation case) or having global -arithmetic domination for sufficiently large (the Shepard operators with ).

6. Conclusions

On the above discussions, the positive linear operators used in approximation can be classified according to the properties of their kernels. We have three categories: kernels with geometrical order (such as the rational Müntz operators), kernels with arithmetic order (such as the Shepard operators), and kernels with local arithmetic order (such as the Bernstein operators). In another word, for characterizing the Jackson type estimate in spaces by the Kantorovich type operators (3) or (5), it always plays an essential role how well the kernels of the operators under study behave.

References

  1. M. Felten, “Local and global approximation theorems for positive linear operators,” Journal of Approximation Theory, vol. 94, no. 3, pp. 396–419, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  2. D. H. Mache and D. X. Zhou, “Characterization theorems for the approximation by a family of operators,” Journal of Approximation Theory, vol. 84, no. 2, pp. 145–161, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  3. K. Satō, “Global approximation theorems for some exponential-type operators,” Journal of Approximation Theory, vol. 32, no. 1, pp. 32–46, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  4. J. Bak, “On the efficiency of general rational approximation,” Journal of Approximation Theory, vol. 20, no. 1, pp. 46–50, 1977. View at MathSciNet
  5. W. Xiao and S. Zhou, “On Müntz rational approximation rate in Lp spaces,” Journal of Approximation Theory, vol. 111, no. 1, pp. 50–58, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  6. W. Xiao and S. P. Zhou, “A Jackson type estimate for Shepard operators in Lp spaces for p1,” Acta Mathematica Hungarica, vol. 95, no. 3, pp. 217–224, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  7. W. Xiao, S. P. Zhou, and L. Y. Zhu, “Lp-approximation for the Shepard operators,” Journal of Zhejiang University, vol. 27, no. 4, pp. 364–371, 2000 (Chinese). View at MathSciNet
  8. M. Becker and R. J. Nessel, “On the global approximation by Kantorovitch polynomials,” in Approximation Theory III, pp. 207–212, Academic Press, New York, NY, USA, 1980. View at MathSciNet
  9. M. Becker and R. J. Nessel, “On global saturation for Kantorovitch polynomials,” in Approximation and Function Spaces, pp. 89–101, North-Holland, Amsterdam, The Netherlands, 1981. View at MathSciNet
  10. H. Berens and R. A. Devore, “Quantitative Korovkin theorems for Lp-spaces,” in Approximation Theory II, pp. 289–298, Academic Press, New York, NY, USA, 1976. View at MathSciNet
  11. R. Bojanic and O. Shisha, “Degree of L1 approximation to integrable functions by modified Bernstein polynomials,” Journal of Approximation Theory, vol. 13, pp. 66–72, 1975. View at MathSciNet
  12. P. L. Butzer, “Dominated convergence of Kantorovitch polynomials in the space Lp,” Transactions of the Royal Society of Canada, vol. 46, pp. 23–27, 1952. View at MathSciNet
  13. Z. Ditzian, “A global inverse theorem for combinations of Bernšteĭn polynomials,” Journal of Approximation Theory, vol. 26, no. 3, pp. 277–292, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  14. A. Grundmann, “Güteabschätzungen für den Kantorovič-operator in der L1-norm,” Mathematische Zeitschrift, vol. 150, no. 1, pp. 45–47, 1976. View at MathSciNet
  15. G. G. Lorentz, Bernstein polynomials, University of Toronto Press, Toronto, Canada, 1953. View at MathSciNet
  16. G. G. Lorentz and L. L. Schumaker, “Saturation of positive operators,” Journal of Approximation Theory, vol. 5, pp. 413–424, 1972. View at MathSciNet
  17. D. H. Mache, “Equivalence theorem on weighted simultaneous Lp-approximation by the method of Kantorovič operators,” Journal of Approximation Theory, vol. 78, no. 3, pp. 321–350, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  18. V. Maier, “Lp-approximation by Kantorovič operators,” Analysis Mathematica, vol. 4, no. 4, pp. 289–295, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  19. M. W. Miller, “Die Gūte der Lp-approximation durch Kantorovic-polynome,” Mathematische Zeitschrift, vol. 152, pp. 243–247, 1976.
  20. S. D. Riemenschneider, “The Lp-saturation of the Bernšteĭn-Kantorovitch polynomials,” Journal of Approximation Theory, vol. 23, no. 2, pp. 158–162, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  21. V. Totik, “Lp(p>1)-approximation by Kantorovich polynomials,” Analysis, vol. 3, no. 1–4, pp. 79–100, 1983. View at MathSciNet
  22. V. Totik, “Problems and solutions concerning Kantorovich operators,” Journal of Approximation Theory, vol. 37, no. 1, pp. 51–68, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  23. V. Totik, “Approximation in L1 by Kantorovich polynomials,” Acta Scientiarum Mathematicarum, vol. 46, no. 1–4, pp. 211–222, 1983. View at MathSciNet
  24. R. A. Devore, “Degree of approximation,” in Approximation Theory II, pp. 117–161, Academic Press, New York, NY, USA, 1976. View at MathSciNet
  25. E. M. Stein, Singular Integrals, Princeton, New Jersey, NJ, USA, 1970.
  26. G. Criscuolo and G. Mastroianni, “Estimates of the Shepard interpolatory procedure,” Acta Mathematica Hungarica, vol. 61, no. 1-2, pp. 79–91, 1993. View at Publisher · View at Google Scholar · View at MathSciNet
  27. G. Somorjai, “On a saturation problem,” Acta Mathematica Academiae Scientiarum Hungaricae, vol. 32, no. 3-4, pp. 377–381, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  28. J. Szabados, “Direct and converse approximation theorems for the Shepard operator,” Approximation Theory and Its Applications, vol. 7, no. 3, pp. 63–76, 1991. View at MathSciNet
  29. B. Della Vecchia and G. Mastroianni, “Pointwise simultaneous approximation by rational operators,” Journal of Approximation Theory, vol. 65, no. 2, pp. 140–150, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  30. B. Della Vecchia, “Direct and converse results by rational operators,” Constructive Approximation, vol. 12, no. 2, pp. 271–285, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  31. P. Vértesi, “Saturation of the Shepard operator,” Acta Mathematica Hungarica, vol. 72, no. 4, pp. 307–317, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  32. T. Xie, R. J. Zhang, and S. Zhou, “Three conjectures on Shepard interpolatory operators,” Journal of Approximation Theory, vol. 93, no. 3, pp. 399–414, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  33. Z. X. Liu, “Approximation of the Kantorovič-Bézier operators in Lp(0,1),” Northeastern Mathematical Journal, vol. 7, no. 2, pp. 199–205, 1991. View at MathSciNet