On the Convergence of a Weak Greedy Algorithm for the Multivariate Haar Basis

被引:3
|
作者
Dilworth, S. J. [1 ]
Gogyan, S. [2 ]
Kutzarova, Denka [3 ]
机构
[1] Univ S Carolina, Dept Math, Columbia, SC 29208 USA
[2] Armenian Acad Sci, Inst Math, Yerevan 0019, Armenia
[3] Bulgarian Acad Sci, Inst Math, Sofia, Bulgaria
基金
美国国家科学基金会;
关键词
Greedy algorithms; Weak thresholding; Thresholding greedy algorithm; Branch-greedy; Nonlinear approximation; Multivariate Haar system; Multivariate Haar wavelet; BANACH-SPACES; APPROXIMATION; SYSTEMS;
D O I
10.1007/s00365-013-9212-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for L (1)[0,1] (d) (da parts per thousand yen1). We prove convergence and uniform boundedness of the weak greedy approximants for all faL (1)[0,1] (d) .
引用
收藏
页码:343 / 366
页数:24
相关论文
共 50 条