The best m-term approximation with respect to polynomials with constant coefficients

Autor:	Berná, Pablo M., Blasco, Óscar
Rok vydání:	2016
Předmět:	Mathematics - Functional Analysis
Druh dokumentu:	Working Paper
Popis:	In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the context of the weak greedy algorithm and weights. Comment: 12 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1606.07250 Zobrazit plný text záznamu View this record from Arxiv