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 ...
详细信息
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.
暂无评论