On n-term approximation with positive coefficients |
| |
Authors: | E. D. Livshits |
| |
Affiliation: | 1. Moscow State University, Russia
|
| |
Abstract: | In this paper, we consider algorithms for constructing n-terms approximations with nonnegative coefficients. The convergence theorem is proved for a “positive” analog of the Pure Greedy Algorithm. We establish a condition on the sequence of weakness coefficients which is sufficient for the convergence of the Positive Weak Greedy Algorithm. This condition is also necessary for the class of monotone sequences. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |