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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Izvestiya: Mathematics, 2006, Volume 70, Issue 1, Pages 87–108
DOI: https://doi.org/10.1070/IM2006v070n01ABEH002304
(Mi im559)
 

This article is cited in 4 scientific papers (total in 4 papers)

On the recursive greedy algorithm

E. D. Livshits
References:
Abstract: We study the recursive greedy algorithm (RGA) and prove its convergence for any initial function and any dictionary. We get exact (in the power scale) estimates for the rate of convergence of the RGA in the case when the initial function belongs to the class $\mathcal A_1(\mathcal D)$. These estimates are extended to larger classes of initial functions and are used to compare some classes of functions determined by a given dictionary.
Received: 26.11.2004
Bibliographic databases:
UDC: 517.518.8
Language: English
Original paper language: Russian
Citation: E. D. Livshits, “On the recursive greedy algorithm”, Izv. Math., 70:1 (2006), 87–108
Citation in format AMSBIB
\Bibitem{Liv06}
\by E.~D.~Livshits
\paper On the recursive greedy algorithm
\jour Izv. Math.
\yr 2006
\vol 70
\issue 1
\pages 87--108
\mathnet{http://mi.mathnet.ru//eng/im559}
\crossref{https://doi.org/10.1070/IM2006v070n01ABEH002304}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2212435}
\zmath{https://zbmath.org/?q=an:1163.41308}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000237779300004}
\elib{https://elibrary.ru/item.asp?id=9251695}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33744812140}
Linking options:
  • https://www.mathnet.ru/eng/im559
  • https://doi.org/10.1070/IM2006v070n01ABEH002304
  • https://www.mathnet.ru/eng/im/v70/i1/p95
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Известия Российской академии наук. Серия математическая Izvestiya: Mathematics
    Statistics & downloads:
    Abstract page:440
    Russian version PDF:246
    English version PDF:18
    References:64
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024