Skip to main content
Log in

The rate of convergence of weak greedy approximations over orthogonal dictionaries

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The convergence rate of a weak orthogonal greedy algorithm is studied for the subspace ℓ1 ⊂ ℓ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.

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

Access this article

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

Instant access to the full article PDF.

References

  1. A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis (Nauka, Moscow, 1976; Dover Publ., 1999).

    MATH  Google Scholar 

  2. S. B. Stechkin, “Absolute Convergence of Orthogonal Series,” Doklady Akad, Nauk SSSR 102 (1), 37 (1955).

    MathSciNet  MATH  Google Scholar 

  3. R. A. DeVore and V. N. Temlyakov, “Some Remarks on Greedy Algorithms,” Adv. Comput. Math. 5 (1), 173 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  4. V. N. Temlyakov, “Weak Greedy Algorithms,” Adv. Comput. Math. 12 (2–3), 213 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  5. A. V. Sil’nichenko, “Rate of Convergence of Greedy Algorithms,” Matem. Zametki 76 (4), 628 (2004).

    Article  MathSciNet  MATH  Google Scholar 

  6. E. D. Livshits, “Lower Estimates for the Rate of Convergence of Greedy Algorithms,” Izvestiya Rus. Akad. Nauk, Matem. 73 (6), 125 (2009).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. S. Orlova.

Additional information

Original Russian Text © A.S. Orlova, 2017, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2017, Vol. 72, No. 2, pp. 68–72.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Orlova, A.S. The rate of convergence of weak greedy approximations over orthogonal dictionaries. Moscow Univ. Math. Bull. 72, 84–87 (2017). https://doi.org/10.3103/S0027132217020097

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132217020097

Navigation