On the convergence of a weak greedy algorithm for the multivariate Haar basis

From MaRDI portal
Publication:485308

DOI10.1007/S00365-013-9212-4zbMATH Open1308.41033arXiv1209.1378OpenAlexW2165535591MaRDI QIDQ485308FDOQ485308


Authors: D. Kutzarova, Smbat L. Gogyan, S. J. Dilworth Edit this on Wikidata


Publication date: 9 January 2015

Published in: Constructive Approximation (Search for Journal in Brave)

Abstract: We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for L1[0,1]d (dge1). We prove convergence and uniform boundedness of the weak greedy approximants for all finL1[0,1]d.


Full work available at URL: https://arxiv.org/abs/1209.1378




Recommendations




Cites Work


Cited In (4)





This page was built for publication: On the convergence of a weak greedy algorithm for the multivariate Haar basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485308)