On the Convergence of a Weak Greedy Algorithm for the Multivariate Haar Basis
classification
🧮 math.FA
math.CA
keywords
greedyweakbasisconvergencehaarmultivariatealgorithmalgorithms
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.