Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov

DOI10.1007/978-3-0348-0890-3zbMath1317.41019OpenAlexW1185548173MaRDI QIDQ2339770

Vladimir N. Temlyakov

Publication date: 7 April 2015

Published in: Advanced Courses in Mathematics -- CRM Barcelona (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-0348-0890-3

zbMATH Keywords

Schauder basisgreedy algorithmbest approximationunconditional basestrigonometric system\(m\)-term approximationHaar basisquasi-greedy basesgreedy basesalmost-greedy basesgeneral dictionariessparse approximation with bases

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)

Related Items (11)

Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces ⋮ Lebesgue constants for Chebyshev thresholding greedy algorithms ⋮ New parameters and Lebesgue-type estimates in greedy approximation ⋮ Nonlinear trigonometric approximations of multivariate function classes ⋮ Lebesgue inequalities for the greedy algorithm in general bases ⋮ Weight-almost greedy bases ⋮ Kolmogorov width and approximate rank ⋮ A survey on compressed sensing approach to systems and control ⋮ Lebesgue inequalities for Chebyshev thresholding greedy algorithms ⋮ On certain subspaces of \(\ell_p\) for \(0 < p \le 1\) and their applications to conditional quasi-greedy bases in \(p\)-Banach spaces ⋮ Characterization of weight-semi-greedy bases

This page was built for publication: Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov