Abstract Tractability of multivariate problems studies their complexity with respect to the number of variables, d , and the accuracy of the solution e . Different types of tractability have been used, such as polynomial tractability and weak tractability and others. These tractability types, however, do not express the complexity with respect to the number of bits of accuracy. We introduce two new tractability types, polylog tractability and ln κ -weak tractability. A problem is polylog tractable iff its complexity is polynomial in d and in ln e − 1 , while a problem is ln κ -weakly tractable iff its complexity is not exponential in d and ln κ e − 1 , for some κ ≥ 1 . We study general multivariate problems and multivariate tensor product problems. We provide necessary and sufficient conditions for the respective tractability types. Moreover, we show that a multivariate tensor product problem cannot be polylog tractable and cannot be ln 1 -weakly tractable (i.e., with κ = 1 ) unless it is trivial.
[1]
E. Novak,et al.
Tractability of Multivariate Problems
,
2008
.
[2]
Anargyros Papageorgiou,et al.
On the tractability of linear tensor product problems in the worst case
,
2009,
J. Complex..
[3]
Henryk Wozniakowski,et al.
Multivariate integration of infinitely many times differentiable functions in weighted Korobov spaces
,
2013,
Math. Comput..
[4]
E. Novak,et al.
Tractability of Multivariate Problems Volume II: Standard Information for Functionals
,
2010
.
[5]
E. Novak,et al.
Tractability of Multivariate Problems, Volume III: Standard Information for Operators.
,
2012
.
[6]
Henryk Wozniakowski,et al.
Tractability of multivariate analytic problems
,
2014,
Uniform Distribution and Quasi-Monte Carlo Methods.
[7]
Pawel Siedlecki,et al.
Uniform weak tractability
,
2013,
J. Complex..