✦ LIBER ✦

Greedy algorithms and bestm-term approximation with respect to biorthogonal systems

✍ Scribed by Peter Oswald

Book ID: 110545795
Publisher: SP Birkhäuser Verlag Boston
Year: 2001
Tongue: English
Weight: 760 KB
Volume: 7
Category: Article
ISSN: 1069-5869
DOI: 10.1007/bf02514500

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

OnN-termed approximations inHs-norms wit

OnN-termed approximations inHs-norms with respect to the Haar system

✍ P. Oswald 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 365 KB

Estimates of best approximations in inte

Estimates of best approximations in integral metrics and Fourier coefficients with respect to multiplicative systems

✍ S. S. Volosivets; R. N. Fadeev 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 258 KB

On a greedy algorithm inL1(0, 1) with re

On a greedy algorithm inL1(0, 1) with regard to subsystems of the Haar system and onω-quasigreedy bases

✍ S. Gogyan 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 644 KB