Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 6 Sep 2012 in math.FA and math.CA | (1209.1378v1)

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$.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up