The weighted property (A) and the greedy algorithm

[摘要] 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.

[发布日期] 2019-12-01

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