5 citations · 10 across the 14 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.NA2023
Randomized Complexity of Vector-Valued Approximation
Stefan Heinrich
We study the randomized -th minimal errors (and hence the complexity) of vector valued approximation. In a recent paper by the author [Randomized complexity of parametric integr…
math.NA2023
Randomized Complexity of Parametric Integration and the Role of Adaption II. Sobolev Spaces
Stefan Heinrich
We study the complexity of randomized computation of integrals depending on a parameter, with integrands from Sobolev spaces. That is, for , $1\le p,q\le \…
math.NA2023★ 1 cited
Randomized Complexity of Parametric Integration and the Role of Adaption I. Finite Dimensional Case
Stefan Heinrich
We study the randomized -th minimal errors (and hence the complexity) of vector valued mean computation, which is the discrete version of parametric integration. The results of…