Greedy approximations with regard to bases

MaRDI QIDQ5490960zbMATH OpenFDO

Authors V. N. Temlyakov

Publication date 26 September 2006

zbMATH Keywords

convergencegreedy algorithmnonlinear approximationbest \(m\)-term approximationgreedy basis

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Recommendations

• scientific article; zbMATH DE number 2065342
• Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
• scientific article; zbMATH DE number 2016952
• The best \(m\)-term approximation and greedy algorithms
• Greedy approximation

Cited in

(10)

• Greedy bases in weighted modulation spaces
• Greedy approximation and regression analysis for the discrete TM system
• The thresholding greedy algorithm, greedy bases, and duality
• scientific article; zbMATH DE number 2016952 (Why is no real title available?)
• On certain subspaces of \(\ell_p\) for \(0 < p \le 1\) and their applications to conditional quasi-greedy bases in \(p\)-Banach spaces
• Greedy bases are best for \(m\)-term approximation
• On the convergence of a weak greedy algorithm for the multivariate Haar basis
• scientific article; zbMATH DE number 2065342 (Why is no real title available?)
• Greedy algorithms for reduced bases in Banach spaces
• Weak thresholding greedy algorithms in Banach spaces

This page was built for publication: Greedy approximations with regard to bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490960)