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

Full description

Saved in:

Bibliographic Details
Published in:	Science China. Mathematics Vol. 59; no. 4; pp. 697 - 714
Main Authors:	Ye, PeiXin, Wei, XiuJie
Format:	Journal Article
Language:	English
Published:	Beijing Science China Press 01.04.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!