Greedy algorithm for Besov classes

MaRDI QIDQ5298035zbMATH OpenFDO

Authors Heping Wang

Publication date 16 July 2007

zbMATH Keywords

greedy algorithm\(m\)-term approximationtensor product wavelet dictionary

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Recommendations

• Representation and m-term approximation for anisotropic Besov classes
• Greedy algorithm with regard to the needlet system on the sphere
• The best m-term approximation and greedy algorithms
• Greedy bases are best for \(m\)-term approximation
• scientific article; zbMATH DE number 2215660

Cited in

(7)

• Greedy algorithm for functions with low mixed smoothness
• Universal bases and greedy algorithms for anisotropic function classes
• Greedy algorithm with regard to the needlet system on the sphere
• Representation and m-term approximation for anisotropic Besov classes
• Best basis selection for approximation in \(L_p\)
• The best \(m\)-term approximations on generalized Besov classes \(M\, B_{q, \theta}^{\Omega}\) with regard to orthogonal dictionaries
• Multiple Haar basis and \(m\)-term approximations of functions from the Besov classes. II

This page was built for publication: Greedy algorithm for Besov classes

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