The weighted property (A) and the greedy algorithm

JOURNAL OF APPROXIMATION THEORY

卷:248

Article

Berna, P. M.¹  Dilworth, S. J.²  Kutzarova, D.^3,4  Oikhberg, T.³  Wallis, B.⁵ 

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

[2] Univ South Carolina, Dept Math, Columbia, SC 29208 USA

[3] Univ Illinois, Dept Math, Urbana, IL 61801 USA

[4] Bulgarian Acad Sci, Inst Math & Informat, Sofia, Bulgaria

[5] Northern Illinois Univ, Dept Math Sci, De Kalb, IL 60115 USA

关键词: Thresholding greedy algorithm;    Unconditional basis;    Property (A);    w-greedy bases;   

DOI  :  10.1016/j.jat.2019.105300

来源: Elsevier

【 摘 要 】

We investigate the efficiency of the Thresholding Greedy Algorithm, by comparing it to optimal weighted approximations. For a weight w, we describe w-greedy, w-almost-greedy, and w-partially-greedy bases, and examine some properties of w-semi-greedy bases. To achieve these goals, we introduce and study the w-Property (A). (C) 2019 Elsevier Inc. All rights reserved.

【 授权许可】

Free