Average case tractability of additive random fields with Korobov kernels

2019/07/01 by Jia Chen, Heping Wang, Chen, Jia +1
Computer Science · Mathematics · #65D15 #FOS: Mathematics #Numerical Analysis (math.NA) #cs.NA #math.NA #msc:65D15

paper · pdf · doi:10.48550/arxiv.1907.00576

15 pages

arxiv created 2019/07/01 · arxiv updated 2019/07/02

Abstract

We investigate average case tractability of approximation of additive random fields with marginal random processes corresponding to the Korobov kernels for the non-homogeneous case. We use the absolute error criterion (ABS) or the normalized error criterion (NOR). We show that the problem is always polynomially tractable for ABS or NOR, and give sufficient and necessary conditions for strong polynomial tractability for ABS or NOR.

Related

• Asymptotic analysis of average case approximation complexity of additive random fields
• Approximation complexity of homogeneous sums of random processes
• Average case tractability of multivariate approximation with Gevrey type kernels
• A note about EC-(s,t)-weak tractability of multivariate approximation with analytic Korobov kernels
• Simplified criterion of quasi-polynomial tractability and its applications