arXiv · 1606.07250
The best m-term approximation with respect to polynomials with constant coefficients
Abstract
In this paper we show that 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.
Explore related subjects
Keep this discovery
Pablo M. Berná, Óscar Blasco. 2016-06-23. The best m-term approximation with respect to polynomials with constant coefficients. https://arxiv.org/abs/1606.07250
Cite the original work for its findings. Save a collection to share your selection of sources.