Lebesgue-Type Inequalities for Quasi-greedy Bases

We show that, for quasi-greedy bases in real or complex Banach spaces, an optimal bound for the ratio between greedy N -term approximation ∥ x − G N x ∥ and the best N -term approximation σ N ( x ) is controlled by max{ μ ( N ), k N }, where μ ( N ) and k N are well-known constants that quantify the...

Celý popis

Podrobná bibliografia

Vydané v:	Constructive approximation Ročník 38; číslo 3; s. 447 - 470
Hlavní autori:	Garrigós, Gustavo, Hernández, Eugenio, Oikhberg, Timur
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.12.2013
Predmet:	Analysis Mathematics Mathematics and Statistics Numerical Analysis 41A46 46B15 Non-linear approximation Bounded variation 41A65 Thresholding greedy algorithm Quasi-greedy bases Lebesgue-type inequalities Democracy functions 41A17
ISSN:	0176-4276, 1432-0940
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!