On convergence of Weak Thresholding Greedy Algorithm in L1 (0,1)

被引:6
|
作者
Gogyan, Smbat [1 ]
机构
[1] Armenian Acad Sci, Inst Math, Yerevan 375019, Armenia
关键词
Haar system; Weak Thresholding Greedy Algorithm; Greedy Algorithm; Quasi-greedy basis; Convergence; SYSTEMS; APPROXIMATION;
D O I
10.1016/j.jat.2008.08.017
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For any 0 < t < 1 we construct a Weak Thresholding Greedy Algorithm with weakness parameter t which converges in L-1 (0, 1) with respect to the Haar system, i. e. the Haar system is a 'good non quasi-greedy basis. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:49 / 64
页数:16
相关论文
共 50 条