Equivalence between almost-greedy and semi-greedy bases

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS

卷:470

Article

Berna, P. M.¹ 

[1] Univ Autonoma Madrid, Dept Matemat, E-28049 Madrid, Spain

关键词: Thresholding greedy algorithm;    Almost-greedy bases;    Semi-greedy bases;   

DOI  :  10.1016/j.jmaa.2018.09.065

来源: Elsevier

【 摘 要 】

In [3] it was proved that almost-greedy and semi-greedy bases are equivalent in the context of Banach spaces with finite cotype. In this paper we show this equivalence for general Banach spaces.(C) 2018 Elsevier Inc. All rights reserved.

【 授权许可】

Free