Vector greedy algorithms

✍ Scribed by Adam Lutoborski; Vladimir N. Temlyakov

• Book ID: 104347297
• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 191 KB
• Volume: 19
• Category: Article
• ISSN: 0885-064X
• DOI: 10.1016/s0885-064x(03)00026-8

✦ Synopsis

Our objective is to study nonlinear approximation with regard to redundant systems. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. Greedy-type approximations proved to be convenient and efficient ways of constructing m-term approximants. We introduce and study vector greedy algorithms that are designed with aim of constructing mth greedy approximants simultaneously for a given finite number of elements. We prove convergence theorems and obtain some estimates for the rate of convergence of vector greedy algorithms when elements come from certain classes.