On the randomized complexity of Banach space valued integration
Abstract
We study the complexity of Banach space valued integration in the randomized setting. We are concerned with r-times continuously differentiable functions on the d-dimensional unit cube Q, with values in a Banach space X, and investigate the relation of the optimal convergence rate to the geometry of X. It turns out that the n-th minimal errors are bounded by cn-r/d-1+1/p if and only if X is of equal norm type p.
0
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.