Worst case complexity of weighted approximation and integration over Rd

  • Authors:

  • Youming Li;Grzegorz W. Wasilkowski

  • Affiliations:

  • Department of Computer Science, University of Kentucky, Lexington, Kentucky;Department of Computer Science, University of Kentucky, Lexington, Kentucky

  • Venue:
  • Journal of Complexity
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the worst case complexity of weighted approximation and integration for functions defined over Rd. We assume that the functions have all partial derivatives of order up to r uniformly bounded in a weighted Lp-norm for a given weight function ψ. The integration and the error for approximation are defined in a weighted sense for another given weight ρ. We present a necessary and sufficient condition on weight functions ρ and ψ for the complexity of the problem to be finite. Under additional conditions, we show that the complexity of the weighted problem is proportional to the complexity of the corresponding classical problem defined over a unit cube and with ρ = ψ = 1. Similar results have been obtained recently for scalar functions (d = 1) and for multivariate functions under restriction that ψ = 1 and p = ∞.