Enviar artigo por via de e-mail Rate of convergence of Thresholding Greedy Algorithms
- Autores: Temlyakov V.N.1,2,3,4
-
Afiliações:
- Steklov Mathematical Institute of Russian Academy of Sciences
- Lomonosov Moscow State University
- Moscow Center for Fundamental and Applied Mathematics
- University of South Carolina
- Edição: Volume 215, Nº 2 (2024)
- Páginas: 147-162
- Seção: Articles
- URL: https://bakhtiniada.ru/0368-8666/article/view/251802
- DOI: https://doi.org/10.4213/sm9926
- ID: 251802
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
The rate of convergence of the classical Thresholding Greedy Algorithm with respect to some bases is studied. We bound the error of approximation by the product of two norms, the norm of
Palavras-chave
Sobre autores
Vladimir Temlyakov
Steklov Mathematical Institute of Russian Academy of Sciences; Lomonosov Moscow State University; Moscow Center for Fundamental and Applied Mathematics; University of South Carolina
Autor responsável pela correspondência
Email: temlyak@math.sc.edu
Doctor of physico-mathematical sciences, Professor
Bibliografia
- R. A. DeVore, S. V. Konyagin, V. N. Temlyakov, “Hyperbolic wavelet approximation”, Constr. Approx., 14:1 (1998), 1–26
- Dinh Dũng, V. Temlyakov, T. Ullrich, Hyperbolic cross approximation, Adv. Courses Math. CRM Barcelona, Birkhäuser/Springer, Cham, 2018, xi+218 pp.
- M. J. Donahue, L. Gurvits, C. Darken, E. Sontag, “Rates of convex approximation in non-Hilbert spaces”, Constr. Approx., 13:2 (1997), 187–220
- M. Frazier, B. Jawerth, “A discrete transform and decompositions of distribution spaces”, J. Funct. Anal., 93:1 (1990), 34–170
- Б. С. Кашин, А. А. Саакян, Ортогональные ряды, Наука, М., 1984, 496 с.
- S. V. Konyagin, V. N. Temlyakov, “A remark on greedy approximation in Banach spaces”, East. J. Approx., 5:3 (1999), 365–379
- В. Н. Темляков, “Приближение функций с ограниченной смешанной производной”, Тр. МИАН СССР, 178, 1986, 3–113
- V. N. Temlyakov, “Greedy algorithm and $m$-term trigonometric approximation”, Constr. Approx., 14:4 (1998), 569–587
- V. N. Temlyakov, “The best $m$-term approximation and greedy algorithms”, Adv. Comput. Math., 8:3 (1998), 249–265
- V. N. Temlyakov, “Greedy algorithms with regard to multivariate systems with special structure”, Constr. Approx., 16:3 (2000), 399–425
- V. N. Temlyakov, “Universal bases and greedy algorithms for anisotropic function classes”, Constr. Approx., 18:4 (2002), 529–550
- V. Temlyakov, Sparse approximation with bases, Adv. Courses Math. CRM Barcelona, Birkhäuser/Springer, Basel, 2015, xii+261 pp.
- V. Temlyakov, Multivariate approximation, Cambridge Monogr. Appl. Comput. Math., 32, Cambridge Univ. Press, Cambridge, 2018, xvi+534 pp.
- V. N. Temlyakov, On the rate of convergence of greedy algorithms
- V. N. Temlyakov, Mingrui Yang, Peixin Ye, “Greedy approximation with regard to non-greedy bases”, Adv. Comput. Math., 34:3 (2011), 319–337
- P. Wojtaszczyk, “Greedy algorithm for general biorthogonal systems”, J. Approx. Theory, 107:2 (2000), 293–314
Arquivos suplementares
