Skip to main content

Statistical Approximation to Periodic Functions by a General Family of Linear Operators

  • Chapter
  • 692 Accesses

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 14))

Abstract

In this chapter, using A-statistical convergence and also considering some matrix summability methods, we introduce an approximation theorem, which is a non-trivial generalization of Baskakov’s result [40] regarding the approximation to periodic functions by a general class of linear operators. This chapter relies on [20].

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Anastassiou, G.A., Duman, O. (2011). Statistical Approximation to Periodic Functions by a General Family of Linear Operators. In: Towards Intelligent Modeling: Statistical Approximation Theory. Intelligent Systems Reference Library, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19826-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19826-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19825-0

  • Online ISBN: 978-3-642-19826-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics