AI Chat AI Image Generator AI Video Text to Speech

Rate of convergence of Thresholding Greedy Algorithms

04/19/2023

∙

by V. N. Temlyakov, et al.

∙

∙

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 results for greedy bases, unconditional bases, and quasi-greedy bases. In particular, we prove that our bounds for the trigonometric basis and for the Haar basis are optimal.

page 1

page 2

page 3

page 4

research

∙ 04/13/2023

On the rate of convergence of greedy algorithms

We prove some results on the rate of convergence of greedy algorithms, w...

0 V. N. Temlyakov, et al. ∙

research

∙ 02/15/2021

Expansions in Cantor real bases

We introduce and study series expansions of real numbers with an arbitra...

0 Émilie Charlier, et al. ∙

research

∙ 03/27/2013

Sparse approximation and recovery by greedy algorithms in Banach spaces

We study sparse approximation by greedy algorithms. We prove the Lebesgu...

0 Vladimir Temlyakov, et al. ∙

research

∙ 11/06/2019

Sparse approximation of individual functions

Results on two different settings of asymptotic behavior of approximatio...

0 L. Burusheva, et al. ∙

research

∙ 02/17/2021

Dynamical behavior of alternate base expansions

We generalize the greedy and lazy β-transformations for a real base β to...

0 Émilie Charlier, et al. ∙

research

∙ 04/26/2023

Entropy-based convergence rates of greedy algorithms

We present convergence estimates of two types of greedy algorithms in te...

0 Yuwen Li, et al. ∙

research

∙ 02/11/2021

SLS (Single ℓ_1 Selection): a new greedy algorithm with an ℓ_1-norm selection rule

In this paper, we propose a new greedy algorithm for sparse approximatio...

0 Ramzi Ben Mhenni, et al. ∙