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

被引：0
|
作者：
P. M. Berná
Ó. Blasco
机构：
[1] Universitat Politècnica de València,Instituto Universitario de Matemática Pura y Aplicada
[2] Universidad de Valencia,Departamento de Análisis Matemático
[3] Campus de Burjassot,undefined
来源：
Analysis Mathematica | 2017年 / 43卷
关键词：
thresholding greedy algorithm; -term approximation; weight-greedy basis; 41A65; 41A46; 46B15;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：119 / 132
页数：13
相关论文
共 50 条
12345