Skip to main content
SpringerLink
Log in

Linear and Iterative Combinations

  • Chapter
  • First Online:
Convergence Estimates in Approximation Theory

  • 1052 Accesses

Abstract

The linear positive operators are conceptually simpler, and easier to construct and study, but they lack rapidity of convergence for sufficiently smooth functions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. P.N. Agrawal, Simultaneous approximation by Micchelli combination of Bernstein polynomials. Demonstr. Math. XXV(3), 513–523 (1992)

    Google Scholar 

  2. P.N. Agrawal, H.S. Kasana, On the iterative combinations of Bernstein polynomials. Demonstr. Math. XVII(3), 777–783 (1984)

    Google Scholar 

  3. P.N. Agrawal, V. Gupta, A. Sahai, On convergence of derivatives of linear combinations of modified Lupas operators. Publ. Inst. Math. Nouv. Sér. 45(59), 147–154 (1989)

    MathSciNet  Google Scholar 

  4. S. Bernstein, Demonstration du theoreme de Weierstrass, fonde sur le probabilities. Commun. Soc. Math. Kharkow 13, 1–2 (1912–13)

    Google Scholar 

  5. L. Bingzheng, Direct and converse results for linear combinations of Baskakov–Durrmeyer operators. Approx. Theory Appl. 9(3), 61–72 (1993)

    MATH  MathSciNet  Google Scholar 

  6. P.L. Butzer, Linear combinations of Bernstein polynomials. Can. J. Math. 5, 559–567 (1953)

    Article  MATH  MathSciNet  Google Scholar 

  7. R.A. DeVore, G.G. Lorentz, Constructive Approximation (Springer, Berlin, 1993)

    Book  MATH  Google Scholar 

  8. Z. Ditzian, V. Totik, Moduli of Smoothness (Springer, Berlin, 1987)

    Book  MATH  Google Scholar 

  9. Z. Finta, N.K. Govil, V. Gupta, Some results on modified Szász–Mirakyan operators. J. Math. Anal. Appl. 327(2), 1284–1296 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  10. S. Goldberg, V. Meir, Minimum moduli of ordinary differential operators. Proc. London Math. Soc. 23(3), 1–15 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  11. V. Gupta, M.A. Noor, Convergence of derivatives for certain mixed Szász Beta operators. J. Math. Anal. Appl. 321(1), 1–9 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. V. Gupta, G. Tachev, Approximation by Szász–Mirakyan–Baskakov operators. J. Appl. Funct. Anal. 9(3–4), 308–309 (2014)

    Google Scholar 

  13. M. Heilmann, Direct and converse results for operators of Baskakov–Durrmeyer type. Approx. Theory Appl. 5(1), 105–127 (1989)

    MATH  MathSciNet  Google Scholar 

  14. H.S. Kasana, P.N. Agrawal, V. Gupta, Inverse and saturation theorems for linear combination of modified Baskakov operators. Approx. Theory Appl. 7 (2), 65–81 (1991)

    MATH  MathSciNet  Google Scholar 

  15. C.P. May, Saturation and inverse theorems for combinations of a class of exponential type opertors. Can. J. Math. XXVIII, 1224–1250 (1976)

    Google Scholar 

  16. C.P. May, On Phillips operators. J. Approx. Theory 20, 315–322 (1997)

    Article  Google Scholar 

  17. C.A. Micchelli, Saturation classes and iterates of operators. Ph.D. Thesis, Stanford University, 1969

    Google Scholar 

  18. G. Prasad, P.N. Agrrawal, H.S. Kasana, Approximation of functions on [0, ∞] by a new sequence of modified Szász operators. Math. Forum. 6(2), 1–11 (1983)

    Google Scholar 

  19. R.K.S. Rathore, Linear combinations of linear positive operators and generating relations in special functions. Ph.D. Thesis, IIT Delhi, 1973

    Google Scholar 

  20. A. Sahai, G. Prasad, On the rate of convergence for modified Szász–Mirakyan operators on functions of bounded variation. Publ. Inst. Math. Nouv. Sér. (N.S.) 53(67), 73–80 (1993)

    Google Scholar 

  21. T.A.K. Sinha, P.N. Agrawal, A. Sahai, V. Gupta, Improved L p approximation by linear combination of modified Lupas operators. Bull. Inst. Math. Acad. Sinica 17(3), 106–114 (1989)

    MathSciNet  Google Scholar 

  22. T.A.K. Sinha, V. Gupta, P.N. Agrawal, A. R. Gairola, Inverse theorem for an iterative combinations of Bernstein–Durrmeyer operators. Studia Univ. Babes Bolyai Mat. LIV(4), 153–164 (2009)

    Google Scholar 

  23. T.A.K. Sinha, P.N. Agrawal, A.R. Gairola, On L p -approximation by iterative combination of Bernstein–Durrmeyer polynomials. ISRN Math. Anal. 2011, 11 (2011). Article 184374

    Google Scholar 

  24. O. Szász, Generalizations of S. Bernstein’s polynomial to the infinite interval. J. Res. Nat. Bur. Standards 45, 239–245 (1950)

    Article  Google Scholar 

  25. D.X. Zhou, On a paper of Mazhar and Totik. J. Approx. Theory 72(3), 290–300 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Applied Sciences, Netaji Subhas Institute of Technology, New Delhi, India

    Vijay Gupta

  2. Department of Mathematics, Texas A&M University - Kingsville, Kingsville, TX, USA

    Ravi P. Agarwal

Authors
  1. Vijay Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ravi P. Agarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gupta, V., Agarwal, R.P. (2014). Linear and Iterative Combinations. In: Convergence Estimates in Approximation Theory. Springer, Cham. https://doi.org/10.1007/978-3-319-02765-4_4

Download citation

Publish with us

Policies and ethics

Search

Navigation