Abstract

AbstractWe study tractability properties of the weighted $$L_p$$ L p -discrepancy, where the weights model the influence of different coordinates. A discrepancy is said to be tractable if the minimal number N of points, such that the discrepancy is less than the initial discrepancy times an error threshold $$\varepsilon $$ ε , does not grow exponentially fast with the dimension and $$\varepsilon ^{-1}$$ ε - 1 . In this case there are various notions of tractabilities used in order to classify the exact rate. In the present paper we prove matching sufficient conditions (upper bounds) and neccessary conditions (lower bounds) for polynomial and weak tractability for all $$p \in (1, \infty )$$ p ∈ ( 1 , ∞ ) and we prove a necessary condition for strong polynomial tractability. The proofs of the lower bounds are based on a powerful general result for the information complexity of integration with positive quadrature rules for tensor product spaces. As a second application of this general result we consider the integration of polynomials of degree at most 2.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.