The weighted property (A) and the greedy algorithm

P. M. Berná, S. J. Dilworth, D. Kutzarova, T. Oikhberg, B. Wallis

Research output: Contribution to journalArticlepeer-review


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).

Original languageEnglish (US)
Article number105300
JournalJournal of Approximation Theory
StatePublished - Dec 2019


  • Property (A)
  • Thresholding greedy algorithm
  • Unconditional basis
  • w-greedy bases

ASJC Scopus subject areas

  • Analysis
  • Numerical Analysis
  • General Mathematics
  • Applied Mathematics


Dive into the research topics of 'The weighted property (A) and the greedy algorithm'. Together they form a unique fingerprint.

Cite this