Efficiency of weak greedy algorithms for m-term approximations

We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm（WTGA） and weak Chebyshev thresholding greedy algorithm....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science China. Mathematics Jg. 59; H. 4; S. 697 - 714
Hauptverfasser: Ye, PeiXin, Wei, XiuJie
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Beijing Science China Press 01.04.2016
Schlagworte:
Applications of Mathematics
Approximation
Chebyshev approximation
Computational efficiency
Computing time
Constants
Functions (mathematics)
Greedy algorithms
Mathematical analysis
Mathematics
Mathematics and Statistics
TGA
一致有界
切比雪夫
勒贝格常数
巴拿赫空间
贪婪算法
贪心算法
逼近
quasi-greedy bases
41A46
46B15
41A25
weak thresholding greedy algorithm
term approximation
Lebesgue constants
weak Chebyshev greedy algorithm
ISSN:1674-7283, 1869-1862
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm（WTGA） and weak Chebyshev thresholding greedy algorithm.Then we discuss the greedy approximation on some function classes.For some sparse classes induced by uniformly bounded quasi-greedy bases of L_p,12 the WCGA is better than the TGA.
Bibliographie:m-term approximation Lebesgue constants weak thresholding greedy algorithm weak Chebyshev greedy algorithm quasi-greedy bases
We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm（WTGA） and weak Chebyshev thresholding greedy algorithm.Then we discuss the greedy approximation on some function classes.For some sparse classes induced by uniformly bounded quasi-greedy bases of L_p,12 the WCGA is better than the TGA.
11-5837/O1
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-7283
1869-1862
DOI:10.1007/s11425-015-5106-1