paper

Asymptotic analysis in multivariate average case approximation with Gaussian kernels

arXiv:2101.06331

Abstract

We consider tensor product random fields , , whose covariance funtions are Gaussian kernels. The average case approximation complexity is defined as the minimal number of evaluations of arbitrary linear functionals needed to approximate , with relative -average error not exceeding a given threshold . We investigate the growth of for arbitrary fixed and . Namely, we find criteria of boundedness for on and of tending , , for any fixed . In the latter case we obtain necessary and sufficient conditions for the following logarithmic asymptotics \begin{eqnarray*} \ln n^{Y_d}(\varepsilon)= a_d+q(\varepsilon)b_d+o(b_d),\quad d\to\infty, \end{eqnarray*} with any . Here is a non-decreasing function, is a sequence and is a positive sequence such that , . We show that only special quantiles of self-decomposable distribution functions appear as functions in a given asymptotics. These general results apply to under particular assumptions on the length scale parameters.

Asymptotic analysis in multivariate average case approximation with Gaussian kernels · wovepaper