Lebesgue constants for Chebyshev thresholding greedy algorithms
We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n -term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then we determine the exact rate of the Lebesgue...
Saved in:
| Published in: | Journal of inequalities and applications Vol. 2018; no. 1; pp. 1 - 23 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cham
Springer International Publishing
27.04.2018
Springer Nature B.V SpringerOpen |
| Subjects: | |
| ISSN: | 1029-242X, 1025-5834, 1029-242X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an
n
-term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then we determine the exact rate of the Lebesgue constants
L
n
ch
for two examples of such bases: the trigonometric system and the summing basis. We also establish the upper estimates for
L
n
ch
with respect to general bases in terms of quasi-greedy parameter, democracy parameter and A-property parameter. These estimates do not involve an unconditionality parameter, therefore they are better than those of TGA. In particular, for conditional quasi-greedy bases, a faster convergence rate is obtained. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1029-242X 1025-5834 1029-242X |
| DOI: | 10.1186/s13660-018-1694-y |