11 citations · 11 across the 2 of their papers we have counts for
3 papers
math.NA2022★ 11 cited
Exponential tractability of -approximation with function values
David Krieg, Pawel Siedlecki, Mario Ullrich +1
We study the complexity of high-dimensional approximation in the -norm when different classes of information are available; we compare the power of function evaluations with t…
math.NA2020
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
Peter Kritzer, Friedrich Pillichshammer, Henryk Woźniakowski
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 a…
math.NA2017
Reproducing Kernels of Sobolev Spaces on and Applications to Embedding Constants and Tractability
Erich Novak, Mario Ullrich, Henryk Woźniakowski +1
The standard Sobolev space , with arbitrary positive integers and for which , has the reproducing kernel $$ K_{d,s}(x,t)=\int_{\mathbb{R}^d}\fra…