A unified treatment of tractability for approximation problems defined on Hilbert spaces
Abstract: A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions $1, 2, \ldots$ grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus on the situation where the space of available information consists of all linear functionals and the problems are defined as linear operator mappings between Hilbert spaces. We unify the proofs of known tractability results and generalize a number of existing results. These generalizations are expressed as five theorems that provide equivalent conditions for (strong) tractability in terms of sums of functions of the singular values of the solution operators.
- Approximation of analytic functions in korobov spaces. J. Complexity, 30:2–28, 2014.
- An adaptive algorithm employing continuous linear functionals. In P. L’Ecuyer and B. Tuffin, editors, Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Rennes, France, July 2018, volume 324 of Springer Proceedings in Mathematics and Statistics, pages 161–181. Springer, Cham, 2020.
- Adaptive approximation for multivariate linear problems with inputs lying in a cone. In F. J. Hickernell and P. Kritzer, editors, Multivariate Algorithms and Information-Based Complexity, pages 109–145. DeGruyter, Berlin/Boston, 2020.
- M. Gnewuch and H. Woźniakowski. Generalized tractability for multivariate problems, part I: Linear tensor product problems and linear information. J. Complexity, 23(2):262–295, 2007.
- M. Gnewuch and H. Woźniakowski. Generalized tractability for linear functionals. In A. Keller, S. Heinrich, and H. Niederreiter, editors, Monte Carlo and Quasi-Monte Carlo Methods, pages 359–381. Springer, Berlin, 2008.
- M. Gnewuch and H. Woźniakowski. Generalized tractability for multivariate problems, part II: Linear tensor product problems, linear information, unrestricted tractability. Found. Comput. Math., 9:431–460, 2009.
- M. Gnewuch and H. Woźniakowski. Quasi-polynomial tractability. J. Complexity, 27:312–330, 2011.
- Exponential tractability of linear tensor product problems. In 2018 MATRIX Annals, MATRIX Book Series, pages 61–78. Springer Nature Switzerland AG, 2020.
- P. Kritzer. Selected aspects of tractability analysis, 2024. Submitted.
- 𝕃∞subscript𝕃\mathbb{L}_{\infty}blackboard_L start_POSTSUBSCRIPT ∞ end_POSTSUBSCRIPT-approximation in korobov spaces with exponential weights. J. Complexity, 41:102–125, 2017.
- P. Kritzer and H. Woźniakowski. Simple characterizations of exponential tractability for linear multivariate problems. J. Complexity, 51:110–128, 2019.
- E. Novak and H. Woźniakowski. Tractability of Multivariate Problems Volume I: Linear Information. Number 6 in EMS Tracts in Mathematics. European Mathematical Society, Zürich, 2008.
- E. Novak and H. Woźniakowski. Tractability of Multivariate Problems Volume II: Standard Information for Functionals. Number 12 in EMS Tracts in Mathematics. European Mathematical Society, Zürich, 2010.
- E. Novak and H. Woźniakowski. Tractability of Multivariate Problems Volume III: Standard Information for Operators. Number 18 in EMS Tracts in Mathematics. European Mathematical Society, Zürich, 2012.
- P. Siedlecki and M. Weimar. Notes on (s,t)𝑠𝑡(s,t)( italic_s , italic_t )-weak tractability: a refined classification of problems with (sub)exponential information complexity. J. Approx. Theory, 200:227–258, 2015.
- A. G. Werschulz and H. Woźniakowski. A new characterization of (s,t)𝑠𝑡(s,t)( italic_s , italic_t )-weak tractability. J. Complexity, 38:68–79, 2017.
- H. Woźniakowski. Tractability and strong tractability of linear multivariate problems. J. Complexity, 10:96–128, 1994.
- H. Woźniakowski. Tractability and strong tractability of multivariate tensor product problems. J. of Computing and Information, 4:1–19, 1994.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.