Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals

01/31/2020
by   Peter Kritzer, et al.
0

We study the approximation of compact linear operators defined over certain weighted tensor product Hilbert spaces. The information complexity is defined as the minimal number of arbitrary linear functionals which is needed to obtain an ε-approximation for the d-variate problem. It is fully determined in terms of the weights and univariate singular values. Exponential tractability means that the information complexity is bounded by a certain function which depends polynomially on d and logarithmically on ε^-1. The corresponding un-weighted problem was studied recently by Hickernell, Kritzer and Woźniakowski with many negative results for exponential tractability. The product weights studied in the present paper change the situation. Depending on the form of polynomial dependence on d and logarithmic dependence on ε^-1, we study exponential strong polynomial, exponential polynomial, exponential quasi-polynomial, and exponential (s,t)-weak tractability with max(s,t)>1. For all these notions of exponential tractability, we establish necessary and sufficient conditions on weights and univariate singular values for which it is indeed possible to achieve the corresponding notion of exponential tractability. The case of exponential (s,t)-weak tractability with max(s,t)<1 is left for future study.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2021

Tractability of approximation in the weighted Korobov space in the worst-case setting – a complete picture

In this paper, we study tractability of L_2-approximation of one-periodi...
research
06/29/2011

The Rate of Convergence of AdaBoost

The AdaBoost algorithm was designed to combine many "weak" hypotheses th...
research
08/26/2023

Worst case tractability of L_2-approximation for weighted Korobov spaces

We study L_2-approximation problems APP_d in the worst case setting in t...
research
05/09/2022

Exponential tractability of L_2-approximation with function values

We study the complexity of high-dimensional approximation in the L_2-nor...
research
10/05/2021

Segre-Driven Radicality Testing

We present a probabilistic algorithm to test if a homogeneous polynomial...
research
01/11/2021

On the power of standard information for tractability for L_2-approximation in the randomized setting

We study approximation of multivariate functions from a separable Hilber...
research
01/12/2021

On the power of standard information for tractability for L_2-approximation in the average case setting

We study multivariate approximation in the average case setting with the...

Please sign up or login with your details

Forgot password? Click here to reset