EC-tractability of \(\mathbb{L}_p\)-approximation in Korobov spaces with exponential weights (Q2007614)

In this paper, the author studies the information complexity (so-called tractability) with respect to problems in arbitrary dimensions and with respect to a prescribed error demand (numerical error). Exponential convergence of this problem is called exponential convergence (EC) tractability. A characterisation is provided for all \(L^p\) spaces for all \(1\leq p\leq\infty\) which is new, in particular the generalisation for \(1\leq p\leq2\). The author uses normalised error criteria and the spaces for which these results apply are Korobov spaces.