Approximation of analytic functions in Korobov spaces

Abstract

We study multivariate L2-approximation for a weighted Korobov space of analytic periodic functions for which the Fourier coefficients decay exponentially fast. The weights are defined, in particular, in terms of two sequences a =\aj\ and b =\bj\ of numbers no less than one. Let eL2-app,Λ(n,s) be the minimal worst-case error of all algorithms that use n information functionals from the class Λ in the s-variate case. We consider two classes Λ: the class Λ all consists of all linear functionals and the class Λ std consists of only function valuations. We study (EXP) exponential convergence. This means that eL2-app,Λ(n,s) C(s)\,q\,(n/C1(s))p(s)for all n, s ∈ N where q∈(0,1), and C,C1,p:N → (0,∞). If we can take p(s)=p>0 for all s then we speak of (UEXP) uniform exponential convergence. We also study EXP and UEXP with (WT) weak, (PT) polynomial and (SPT) strong polynomial tractability. These concepts are defined as follows. Let n(,s) be the minimal n for which eL2-app,Λ(n,s) . Then WT holds iff s+\,-1∞( n(,s))/(s+\,-1)=0, PT holds iff there are c,τ1,τ2 such that n(,s) csτ1(1+\,-1)τ2 for all s and ∈(0,1), and finally SPT holds iff the last estimate holds for τ1=0. The infimum of τ2 for which SPT holds is called the exponent τ* of SPT. We prove that the results are the same for both classes Λ, and obtain conditions for WT, PT, SPT with and without EXP and UEXP.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…