11 citations · 13 across the 5 of their papers we have counts for
Showing math.NAShow all
3 papers · 1 filter
math.NA2023
Worst case tractability of linear problems in the presence of noise: linear information
Leszek Plaskota, Paweł Siedlecki
We study the worst case tractability of multivariate linear problems defined on separable Hilbert spaces. Information about a problem instance consists of noisy evaluations of arbi…
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.NA2019★ 1 cited
A note on the complexity of a phaseless polynomial interpolation
Michal R. Przybylek, Pawel Siedlecki
In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circl…