On the coincidence of pure greedy and best m-term approximations

DOI10.1134/S0001434622010230OpenAlexW4213411997WikidataQ114075403 ScholiaQ114075403MaRDI QIDQ2113418FDOQ2113418

K. S. Vishnevetskiy

Publication date: 14 March 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434622010230

zbMATH Keywords

Hilbert space\(m\)-term approximationgreedy approximationcoherence parameter

Mathematics Subject Classification ID

Numerical analysis (65-XX) Artificial intelligence (68Txx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Approximations and expansions (41Axx)

Cites Work

• Adaptive greedy approximations
• Some remarks on greedy algorithms
• Greedy Approximation
• Title not available (Why is that?)
• Rates of convex approximation in non-Hilbert spaces

Cited In (3)

• The best \(m\)-term approximation and greedy algorithms
• Greedy bases are best for \(m\)-term approximation
• Comparison of Purely Greedy and Orthogonal Greedy Algorithm

This page was built for publication: On the coincidence of pure greedy and best \(m\)-term approximations

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