Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions
Abstract
We investigate multivariate integration for a space of infinitely times differentiable functions Fs, u := \f ∈ C∞ [0,1]s \| f \|Fs, u < ∞ \, where \| f \|Fs, u := α = (α1, …, αs) ∈ N0s \|f(α)\|L1/Πj=1s ujαj, f(α) := ∂|α|∂ x1α1 ·s ∂ xsαsf and u = \uj\j ≥ 1 is a sequence of positive decreasing weights. Let e(n,s) be the minimal worst-case error of all algorithms that use n function values in the s-variate case. We prove that for any u and s considered e(n,s) ≤ C(s) (-c(s)(n)2) holds for all n, where C(s) and c(s) are constants which may depend on s. Further we show that if the weights u decay sufficiently fast then there exist some 1 < p < 2 and absolute constants C and c such that e(n,s) ≤ C (-c(n)p) holds for all s and n. These bounds are attained by quasi-Monte Carlo integration using digital nets. These convergence and tractability results come from those for the Walsh space into which Fs, u is embedded.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.