48 citations · 191 across the 37 of their papers we have counts for
42 papers
A survey on sampling recovery
F. Dai, V. Temlyakov
The reconstruction of unknown functions from a finite number of samples is a fundamental challenge in pure and applied mathematics. This survey provides a comprehensive overview of…
On the rate of convergence of greedy algorithms
V. N. Temlyakov
We prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spa…
On universal sampling representation
V. N. Temlyakov
For the multivariate trigonometric polynomials we study convolution with the corresponding the de la Vallee Poussin kernel from the point of view of discretization. In other words,…
Sampling discretization of integral norms and its application
F. Dai, V. Temlyakov
The paper addresses the problem of sampling discretization of integral norms of elements of finite-dimensional subspaces satisfying some conditions. We prove sampling discretizatio…
Sampling discretization and related problems
B. Kashin, E. Kosov, I. Limonova +1
This survey addresses sampling discretization and its connections with other areas of mathematics. The survey concentrates on sampling discretization of norms of elements of finite…
Universal sampling discretization
Feng Dai, V. Temlyakov
Let be an -dimensional subspace of functions on a probability space spanned by a uniformly bounded Riesz basis . Given an integer and a…