The best m-term approximation with respect to polynomials with constant coefficients
Functional Analysis
2016-06-24 v1
Abstract
In this paper we show that that greedy bases can be defined as those where the error term using -greedy approximant is uniformly bounded by the best -term approximation with respect to polynomials with constant coefficients in the context of the weak greedy algorithm and weights.
Cite
@article{arxiv.1606.07250,
title = {The best m-term approximation with respect to polynomials with constant coefficients},
author = {Pablo M. Berná and Óscar Blasco},
journal= {arXiv preprint arXiv:1606.07250},
year = {2016}
}
Comments
12 pages