Rate of convergence of thresholding greedy algorithms

DOI10.4213/sm9926ezbMATH Open1546.41017MaRDI QIDQ6569587

V. N. Temlyakov

Publication date: 9 July 2024

Published in: Sbornik: Mathematics (Search for Journal in Brave)

zbMATH Keywords

rate of convergencegreedy algorithmbases

Mathematics Subject Classification ID

Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Rate of convergence, degree of approximation (41A25)

Cites Work

• Unnamed Item
• Unnamed Item
• A discrete transform and decompositions of distribution spaces
• The best \(m\)-term approximation and greedy algorithms
• Greedy algorithm and \(m\)-term trigonometric approximation
• Rates of convex approximation in non-Hilbert spaces
• Hyperbolic wavelet approximation
• Greedy algorithms with regard to multivariate systems with special structure
• Universal bases and greedy algorithms for anisotropic function classes
• Hyperbolic cross approximation. Lecture notes given at the courses on constructive approximation and harmonic analysis, Barcelona, Spain, May 30 -- June 3, 2016
• Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
• Greedy approximation with regard to non-greedy bases
• A remark on greedy approximation in Banach spaces.
• Multivariate Approximation
• Greedy algorithm for general biorthogonal systems

This page was built for publication: Rate of convergence of thresholding greedy algorithms