Skip to main content

Jackson’s Theorem in Hardy-Sobolev Type Spaces in the Unit Polydiscs

  • Conference paper
Book cover Information Computing and Applications (ICICA 2012)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 307))

Included in the following conference series:

  • 1094 Accesses

Abstract

The purpose of this article is to establish Jackson type inequality in the unit polydiscs U n of ℂn for Hardy-Sobolev type spaces \(F_{\alpha}^{p,q}(U^n)\). Namely,

$$E_{\overrightarrow{k}}(f, F_{\alpha}^{p,q}(U^n))\lesssim\omega_r \left(\overrightarrow{1/k},f, F_{\alpha}^{p,q}(U^n)\right),$$

where \(E_{\overrightarrow{k}}(f, F_{\alpha}^{p,q}(U^n))\) is the deviation of the best approximation of \(f\in F_{\alpha}^{p,q}(U^n)\) by polynomials of degree at most k j about the j-th variable z j with the corresponding moduli of smoothness.

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

Access this chapter

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bhaya, E.S.: On Jackson’s Theorem. Int. J. Contemp. Math. Sciences 7, 1149–1154 (2012)

    MATH  MathSciNet  Google Scholar 

  2. Chen, Y.W., Ren, G.B.: Jackson’s Theorem in Qp Spaces. Science in China Series A: Mathematics 53, 367–372 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, Y.W., Liu, Y.J.: Strong Converse Inequality in Hardy Type Spaces \(\mathcal A_\mu\). J. Hebei Norm. Univ. Nat. Sci. Ed. 35, 336–342 (2011) (Chinese)

    MATH  Google Scholar 

  4. Devore, R.A., Lorentz, G.G.: Constructive Approximation. Springer, Berlin (1993)

    Book  MATH  Google Scholar 

  5. Fefferman, C., Stein, E.: H p Spaces of Several Variables. Acta Math. 192, 137–173 (1972)

    Article  MathSciNet  Google Scholar 

  6. Garnett, J.B.: Bounded Analytic Functions. Academic Press, New York (1981)

    MATH  Google Scholar 

  7. Ivanov, A.V., Ivanov, V.I.: Jackson’s Theorem in the Space L 2(ℝd) with Power Weight. Mathematical Notes 88, 140–143 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ren, G.B., Chen, Y.W.: Gradient Estimates and Jackson’s Theorem in Q μ Spaces Related to Measures. J. Approx. Theory 155, 97–110 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ren, G.B., Wang, M.Z.: Holomorphic Jackson’s Theorems in Polydiscs. J. Approx. Theory 134, 175–198 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lorentz, G.G.: Approximation of Function. Athena Series. Holt. Rinehart and Winston, New York (1966)

    Google Scholar 

  11. Rudin, W.: Function Theory in Polydiscs. Benjamin, New York (1969)

    MATH  Google Scholar 

  12. Shamoyan, R.F.: On the Representation of Linear Continuous Functionals in Spaces of Analytic Functions of the Hardy-Sobolev Type in a Polydisk. Ukrainian Math. J. 55, 812–831 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Wang, Z., Dong, W. (2012). Jackson’s Theorem in Hardy-Sobolev Type Spaces in the Unit Polydiscs. In: Liu, C., Wang, L., Yang, A. (eds) Information Computing and Applications. ICICA 2012. Communications in Computer and Information Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34038-3_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34038-3_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34037-6

  • Online ISBN: 978-3-642-34038-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics