Abstract:
The approximation properties of the X-greedy algorithm in the space Lp(0,1) are studied. For 1<p<2
estimates for the rate of convergence of the X-greedy algorithm with respect to the Haar system are obtained
that are close to optimal.
Bibliography: 18 titles.
Keywords:
greedy algorithms, m-term approximations, the Haar system, rate of convergence.
Citation:
E. D. Livshits, “The convergence of the greedy algorithm with respect to the Haar system in the space Lp(0,1)”, Sb. Math., 201:2 (2010), 253–288
\Bibitem{Liv10}
\by E.~D.~Livshits
\paper The convergence of the greedy algorithm with respect to the Haar system in the space $L_p(0,1)$
\jour Sb. Math.
\yr 2010
\vol 201
\issue 2
\pages 253--288
\mathnet{http://mi.mathnet.ru/eng/sm7517}
\crossref{https://doi.org/10.1070/SM2010v201n02ABEH004072}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2656325}
\zmath{https://zbmath.org/?q=an:1193.41037}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2010SbMat.201..253L}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000277376300010}
\elib{https://elibrary.ru/item.asp?id=19066186}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77954784400}
Linking options:
https://www.mathnet.ru/eng/sm7517
https://doi.org/10.1070/SM2010v201n02ABEH004072
https://www.mathnet.ru/eng/sm/v201/i2/p95
This publication is cited in the following 2 articles:
R. Causey, S. J. Dilworth, S. Gogyan, D. Kutzarova, “An X-greedy algorithm with weakness parameters”, C. R. Acad. Bulgare Sci., 68:3 (2015), 295–300
S. J. Dilworth, E. Odell, T. Schlumprecht, A. Zsák, “Renormings and symmetry properties of 1-greedy bases”, J. Approx. Theory, 163:9 (2011), 1049–1075
Citation in format AMSBIB
Contact us: