Greedy bases are best for \(m\)-term approximation

DOI10.1007/s00365-008-9006-2zbMath1194.46017OpenAlexW2037451795MaRDI QIDQ1039885

Witold Bednorz

Publication date: 23 November 2009

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-008-9006-2

zbMATH Keywords

\(n\)-term approximationunconditional basesgreedy basesdemocratic basesbest basis

Mathematics Subject Classification ID

Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Special properties of functions of several variables, Hölder conditions, etc. (26B35)

Related Items (3)

Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces ⋮ Frames and non linear approximations in Hilbert spaces ⋮ Wavelet bases in the Lebesgue spaces on the field of \(p\)-adic numbers

Cites Work

• Unconditional bases are optimal bases for data compression and for statistical estimation
• Best basis selection for approximation in \(L_p\)
• Unconditional bases and bit-level compression
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy bases are best for \(m\)-term approximation