Notes on (s, t)-weak tractability: A refined classification of problems with (sub)exponential information complexity

@article{Siedlecki2015NotesO,
  title={Notes on (s, t)-weak tractability: A refined classification of problems with (sub)exponential information complexity},
  author={Pawe l Siedlecki and Markus Weimar},
  journal={J. Approx. Theory},
  year={2015},
  volume={200},
  pages={227-258}
}

Figures from this paper

Uniform Weak Tractability of Weighted Integration
TLDR
It is shown that as long as \(t>1\) then this notion holds for weighted integration defined over quite general tensor product Hilbert spaces with arbitrary bounded product weights.
On the power of standard information for tractability for L2-approximation in the randomized setting
TLDR
This work solves Open Problems 98, 101, 102 and almost solve Open Problem 100 as posed by E.Novak and H.Wo´zniakowski and investigates the equivalences of various notions of algebraic and exponential tractability in the randomized setting for Λstd and Λall for the normalized or absolute error criterion.
...
...

References

SHOWING 1-10 OF 36 REFERENCES
A new criterion for tractability of multivariate problems
Uniform weak tractability
Quasi-polynomial tractability
The inverse of the star-discrepancy depends linearly on the dimension
We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, e) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at most
Approximation numbers of Sobolev embeddings - Sharp constants and tractability
Tractability of multivariate analytic problems
TLDR
The goal of this paper is to survey the existing results, present some new results, and propose further questions for the study of tractability of multivariate analytic questions.
Tractability of linear problems defined over Hilbert spaces
On the tractability of linear tensor product problems in the worst case
...
...