✦ LIBER ✦

Greedy approximation with regard to non-greedy bases

✍ Scribed by V. N. Temlyakov; Mingrui Yang; Peixin Ye

Publisher: Springer
Year: 2010
Tongue: English
Weight: 373 KB
Volume: 34
Category: Article
ISSN: 1019-7168
DOI: 10.1007/s10444-010-9155-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Greedy Algorithms andM-Term Approximatio

Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries

✍ V.N. Temlyakov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 198 KB

We study the efficiency of greedy type algorithms with regard to redundant dictionaries in Hilbert space and we prove a general result which gives a sufficient condition on a dictionary to guarantee that the pure greedy algorithm is near best in the sense of power decay of error of approximation. We

Greedy Bases Are Best form-Term Approxim

Greedy Bases Are Best form-Term Approximation

✍ Witold Bednorz 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 334 KB

Minimum bases for permutation groups: Th

Minimum bases for permutation groups: The greedy approximation

✍ Kenneth D Blaha 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 588 KB

Greedy Algorithms with Regard to Multiva

Greedy Algorithms with Regard to Multivariate Systems with Special Structure

✍ V. N. Temlyakov 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 156 KB

Greedy algorithm computing minkowski red

Greedy algorithm computing minkowski reduced lattice bases with quadratic bit complexity of input vectors

✍ Hao Chen; Liqing Xu 📂 Article 📅 2011 🏛 Coastal and Estuarine Research Federation 🌐 English ⚖ 148 KB

On the divergence of greedy algorithms w

On the divergence of greedy algorithms with respect to Walsh subsystems in

✍ S.A. Episkoposian 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 133 KB