activity
20122026
most citedConstructive sparse trigonometric approximation for functions with small mixed smoothness

12 citations · 38 across the 10 of their papers we have counts for

collaborators

11 papers

math.NA2026

Some theoretical and practical results on noisy signals recovery

M. Makurin, Yu. Malykhin, K. Ryutin +1

We discuss some theoretical results and their applications to specific practical problems from wireless communications. We assume that we know the noisy version of the signal, whic…

math.FA2024

Twenty-five years of greedy bases

Fernando Albiac, Jose L. Ansorena, Vladimir Temlyakov

Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the public…

math.NA2024★ 1 cited

One-sided discretization inequalities and sampling recovery

Irina Limonova, Yuri Malykhin, Vladimir Temlyakov

Recently, in a number of papers it was understood that results on sampling discretization and on the universal sampling discretization can be successfully used in the problem of sa…

math.NA2023

On universal sampling recovery in the uniform norm

V. N. Temlyakov

It is known that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error measured in the square norm. In this paper we dem…

math.FA2019

Lebesgue-type inequalities in greedy approximation

Stephen Dilworth, Gustavo Garrigos, Eugenio Hernandez +2

We present new results regarding Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA) in uniformly smooth Banach spaces. We improve earlier bounds in Temlyakov…

math.NA2017★ 8 cited

Dispersion of the Fibonacci and the Frolov point sets

V. N. Temlyakov

It is proved that the Fibonacci and the Frolov point sets, which are known to be very good for numerical integration, have optimal rate of decay of dispersion with respect to the c…