Sbornik: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Sb.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Sbornik: Mathematics, 2010, Volume 201, Issue 2, Pages 253–288
DOI: https://doi.org/10.1070/SM2010v201n02ABEH004072 (Mi sm7517) 		 
This article is cited in 2 scientific papers (total in 2 papers)

The convergence of the greedy algorithm with respect to the Haar system in the space $L_p(0,1)$

E. D. Livshits

Evernote Corporation
English version PDF (463 kB) Citations (2) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/SM2010v201n02ABEH004072
Abstract: The approximation properties of the $X$-greedy algorithm in the space $L_p(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.
Received: 29.12.2008 and 02.07.2009
Bibliographic databases:
UDC: 517.518.8
MSC: Primary 41A65; Secondary 41A25, 41A30
Language: English
Original paper language: Russian
Citation: E. D. Livshits, “The convergence of the greedy algorithm with respect to the Haar system in the space $L_p(0,1)$”, Sb. Math., 201:2 (2010), 253–288
Citation in format AMSBIB
\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:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математический сборник Sbornik: Mathematics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025