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

2016/06/23 by Pablo M. Berná, Berná, Pablo M., Óscar Blasco +1
Computer Science · Engineering · Mathematics · #FOS: Mathematics #Functional Analysis (math.FA) #Image and Signal Denoising Methods #Mathematical Analysis and Transform Methods #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.1606.07250

openalex publication_date 2016/06/23 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28

Abstract

In this paper we show that that greedy bases can be defined as those where\nthe error term using m-greedy approximant is uniformly bounded by the best\nm-term approximation with respect to polynomials with constant coefficients\nin the context of the weak greedy algorithm and weights.\n

Related

• Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm
• Derivation of an upper bound of the constant in the error bound for a near best m-term approximation
• A remark on approximation with polynomials and greedy bases
• Rate of convergence of Thresholding Greedy Algorithms
• Twenty-five years of greedy bases