Tractability of approximation in the weighted Korobov space in the worst-case setting

2022/01/24 by Adrian Ebert, Ebert, Adrian, Peter Kritzer +3
Computer Science · Mathematics · #FOS: Mathematics #Numerical Analysis (math.NA) #cs.NA #math.NA

paper · pdf · doi:10.48550/arxiv.2201.09940

arxiv created 2022/01/24 · arxiv updated 2022/01/26

Abstract

In this paper we consider L_p-approximation, p ∈ \2,∞\, 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 d to the decay rate of the weight sequence (γ_j)_{j ≥ 1} 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 L_∞-approximation problem. To conclude, we give a concise overview of results and collect a number of interesting open problems.

Related

• Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture
• On the power of standard information for tractability for L_∞ approximation of periodic functions in the worst case setting
• \boldsymbolL_∞-approximation in Korobov spaces with Exponential Weights
• Worst case tractability of L₂-approximation for weighted Korobov spaces
• Approximation of analytic functions in Korobov spaces