arXiv · 1209.1378
On the Convergence of a Weak Greedy Algorithm for the Multivariate Haar Basis
Abstract
We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for $L_1[0,1]^d$ ($d \ge 1$). We prove convergence and uniform boundedness of the weak greedy approximants for all $f \in L_1[0,1]^d$.
Explore related subjects
Keep this discovery
S. J. Dilworth, S. Gogyan, Denka Kutzarova. 2012-09-06. On the Convergence of a Weak Greedy Algorithm for the Multivariate Haar Basis. https://arxiv.org/abs/1209.1378
Cite the original work for its findings. Save a collection to share your selection of sources.