Information-based complexity
Tractability and strong tractability of linear multivariate problems
Journal of Complexity
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
Complexity and information
Worst case complexity of multivariate Feynman-Kac path integration
Journal of Complexity
Finite-order weights imply tractability of linear multivariate problems
Journal of Approximation Theory
Quasi-Monte Carlo methods can be efficient for integration over products of spheres
Journal of Complexity
Journal of Complexity
Journal of Complexity
Quasi-polynomial tractability of linear problems in the average case setting
Journal of Complexity
Hi-index | 0.00 |
Many papers study polynomial tractability for multivariate problems. Let n(@?,d) be the minimal number of information evaluations needed to reduce the initial error by a factor of @? for a multivariate problem defined on a space of d-variate functions. Here, the initial error is the minimal error that can be achieved without sampling the function. Polynomial tractability means that n(@?,d) is bounded by a polynomial in @?^-^1 and d and this holds for all (@?^-^1,d)@?[1,~)xN. In this paper we study generalized tractability by verifying when n(@?,d) can be bounded by a power of T(@?^-^1,d) for all (@?^-^1,d)@?@W, where @W can be a proper subset of [1,~)xN. Here T is a tractability function, which is non-decreasing in both variables and grows slower than exponentially to infinity. In this article we consider the set @W=[1,~)x{1,2,...,d^*}@?[1,@?"0^-^1)xN for some d^*=1 and @?"0@?(0,1). We study linear tensor product problems for which we can compute arbitrary linear functionals as information evaluations. We present necessary and sufficient conditions on T such that generalized tractability holds for linear tensor product problems. We show a number of examples for which polynomial tractability does not hold but generalized tractability does.