Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Temlyakov, V."'
Autor:
Gasnikov, A., Temlyakov, V.
The general theory of greedy approximation with respect to arbitrary dictionaries is well developed in the case of real Banach spaces. Recently, some of results proved for the Weak Chebyshev Greedy Algorithm (WCGA) in the case of real Banach spaces w
Externí odkaz:
http://arxiv.org/abs/2408.03214
Autor:
Temlyakov, V.
Sampling recovery on some function classes is studied in this paper. Typically, function classes are defined by imposing smoothness conditions. It was understood in nonlinear approximation that structural conditions in the form of control of the numb
Externí odkaz:
http://arxiv.org/abs/2404.07210
Autor:
Temlyakov, V.
This paper is a direct followup of the recent author's paper. In this paper we continue to analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special unconditionality prop
Externí odkaz:
http://arxiv.org/abs/2401.14670
Autor:
Temlyakov, V.
In this paper we analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method -- the Weak Chebyshev
Externí odkaz:
http://arxiv.org/abs/2312.13163
Autor:
Kosov, E. D., Temlyakov, V. N.
In the first part of the paper we study absolute error of sampling discretization of the integral $L_p$-norm for function classes of continuous functions. We use basic approaches from chaining technique to provide general upper bounds for the error o
Externí odkaz:
http://arxiv.org/abs/2312.05670
Autor:
Dai, F., Temlyakov, V.
Recently, it has been discovered that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error being measured in the square norm. It was established that a simple greedy type algorithm -- Weak
Externí odkaz:
http://arxiv.org/abs/2307.04161
Autor:
Temlyakov, V. N.
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 demonstrate how known results on universal sampling discretization of the
Externí odkaz:
http://arxiv.org/abs/2307.04017
Autor:
Kosov, E. D., Temlyakov, V. N.
Publikováno v:
Journal of Mathematical Analysis and Applications, 538(2), 2024, 128431
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is sufficient to us
Externí odkaz:
http://arxiv.org/abs/2306.14207
Autor:
Temlyakov, V. N.
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 norms -- the norm of $f$ and the $A_1$-norm of $f$. We obtain some resul
Externí odkaz:
http://arxiv.org/abs/2304.09586
Autor:
Temlyakov, V. N.
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 spaces. The new ingredient of the paper is that we bound the error of app
Externí odkaz:
http://arxiv.org/abs/2304.06423