8 citations · 25 across the 12 of their papers we have counts for
Showing 2023 · math.NAShow all
3 papers · 2 filters
math.NA2023★ 4 cited
Bounds for the sampling discretization error and their applications to the universal sampling discretization
E. D. Kosov, V. N. Temlyakov
In the first part of the paper we study absolute error of sampling discretization of the integral -norm for function classes of continuous functions. We use basic approaches f…
math.NA2023
Rate of convergence of Thresholding Greedy Algorithms
V. N. Temlyakov
The rate of convergence of the classical Thresholding Greedy Algorithm with respect to bases is studied in this paper. We bound the error of approximation by the product of both no…
math.NA2023★ 8 cited
Universal discretization and sparse sampling recovery
F. Dai, V. Temlyakov
Recently, it was discovered that for a given function class the error of best linear recovery in the square norm can be bounded above by the Kolmogorov width of $\math…