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

作者：Berna P M^*; Blasco O

来源：Analysis Mathematica, 2017, 43(2): 119-132.

DOI：10.1007/s10476-017-0302-6

• thresholding greedy algorithm
• m-term approximation
• weight-greedy basis

In this paper we show 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.

• 出版日期2017-6