Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2017, Number 2, Pages 68–72 (Mi vmumm62)  
This article is cited in 1 scientific paper (total in 1 paper)

Short notes

The rate of convergence of weak greedy approximations over orthogonal dictionaries

A. S. Orlova

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (232 kB) Citations (1)
References:
PDF
HTML
Abstract: Convergence rate of weak orthogonal greedy algorithm is studied for the subspace $\ell^1\subset\ell^2$ and orthogonal dictionaries. It is shown that general results on convergence rate of weak orthogonal greedy algorithms can be essentially improved in the studied case. It is also shown that this improvement is asymptotically sharp.
Key words: weak orthogonal greedy algorithm, orthogonal system, convergence rate.
Received: 28.09.2016
English version:
Moscow University Mathematics Bulletin, 2017, Volume 72, Issue 2, Pages 84–87
DOI: https://doi.org/10.3103/S0027132217020097
Bibliographic databases:
Document Type: Article
UDC: 517.518.36
Language: Russian
Citation: A. S. Orlova, “The rate of convergence of weak greedy approximations over orthogonal dictionaries”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2017, no. 2, 68–72; Moscow University Mathematics Bulletin, 72:2 (2017), 84–87
Citation in format AMSBIB
\Bibitem{Orl17}
\by A.~S.~Orlova
\paper The rate of convergence of weak greedy approximations over orthogonal dictionaries
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2017
\issue 2
\pages 68--72
\mathnet{http://mi.mathnet.ru/vmumm62}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3651814}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2017
\vol 72
\issue 2
\pages 84--87
\crossref{https://doi.org/10.3103/S0027132217020097}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000400779000009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018287750}
Linking options:
  • https://www.mathnet.ru/eng/vmumm62
  • https://www.mathnet.ru/eng/vmumm/y2017/i2/p68
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:202
    Full-text PDF :55
    References:48
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024