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....

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Science China. Mathematics Ročník 59; číslo 4; s. 697 - 714
Hlavní autori:	Ye, PeiXin, Wei, XiuJie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Beijing Science China Press 01.04.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!