Tractability of approximation in the weighted Korobov space in the worst-case setting
Numerical Analysis
2022-01-26 v1 Numerical Analysis
Abstract
In this paper we consider -approximation, , of periodic functions from weighted Korobov spaces. In particular, we discuss tractability properties of such problems, which means that we aim to relate the dependence of the information complexity on the error demand and the dimension to the decay rate of the weight sequence assigned to the Korobov space. Some results have been well known since the beginning of this millennium, others have been proven quite recently. We give a survey of these findings and will add some new results on the -approximation problem. To conclude, we give a concise overview of results and collect a number of interesting open problems.
Keywords
Cite
@article{arxiv.2201.09940,
title = {Tractability of approximation in the weighted Korobov space in the worst-case setting},
author = {Adrian Ebert and Peter Kritzer and Friedrich Pillichshammer},
journal= {arXiv preprint arXiv:2201.09940},
year = {2022}
}