Skip to main content
SpringerLink
Log in

Rate of Convergence of Greedy Algorithms

  • Published:
Mathematical Notes Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

REFERENCES

  1. R. A. DeVore and V. N. Temlyakov, Adv.Comput.Math., 5 (1996), 173–187.

    Google Scholar 

  2. S. V. Konyagin and V. N. Temlyakov, East J.Approx., 5 (1999), no. 4, 493–499.

    Google Scholar 

  3. E. D. Livshitz and V. N. Temlyakov, Constructive Approx., 19 (2003), no. 4, 509–523.

    Google Scholar 

  4. V. N. Temlyakov, “Greedy expansions in Banach spaces,” in: Research Report 2003:06, Dept. Math., Univ. South Carolina, Columbia, SC, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. M. V. Lomonosov Moscow State University, russia

    A. V. Sil'nichenko

Authors
  1. A. V. Sil'nichenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sil'nichenko, A.V. Rate of Convergence of Greedy Algorithms. Mathematical Notes 76, 582–586 (2004). https://doi.org/10.1023/B:MATN.0000043488.98673.79

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:MATN.0000043488.98673.79

Search

Navigation