Greedy approximation with regard to non-greedy bases

被引：13

作者：

Temlyakov, V. N. ^{[1
]}

Yang, Mingrui ^{[1
]}

Ye, Peixin ^{[2
,3
]}

机构：

[1] Univ S Carolina, Dept Math, Columbia, SC 29208 USA

[2] Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China

[3] Nankai Univ, LPMC, Tianjin 300071, Peoples R China

来源：

ADVANCES IN COMPUTATIONAL MATHEMATICS | 2011年 / 34卷 / 03期

基金：

美国国家科学基金会;

关键词：

Greedy algorithm; m-term approximation; Greedy basis; Quasi-greedy basis; ALGORITHM;

D O I：

10.1007/s10444-010-9155-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The main goal of this paper is to understand which properties of a basis are important for certain direct and inverse theorems in nonlinear approximation. We study greedy approximation with regard to bases with different properties. We consider bases that are tensor products of univariate greedy bases. Some results known for unconditional bases are extended to the case of quasi-greedy bases.

引用

页码：319 / 337

页数：19

共 18 条

[1] Restricted nonlinear approximation [J].