词条 | Stechkin's lemma |
释义 |
In mathematics — more specifically, in functional analysis and numerical analysis — Stechkin's lemma is a result about the ℓq norm of the tail of a sequence, when the whole sequence is known to have finite ℓp norm. Here, the term “tail” means those terms in the sequence that are not among the N largest terms, for an arbitrary natural number N. Stechkin's lemma is often useful when analysing best-N-term approximations to functions in a given basis of a function space. The result was originally proved by Stechkin in the case . Statement of the lemmaLet and let be a countable index set. Let be any sequence indexed by , and for let be the indices of the largest terms of the sequence in absolute value. Then where . Thus, Stechkin's lemma controls the ℓq norm of the tail of the sequence (and hence the ℓq norm of the difference between the sequence and its approximation using its largest terms) in terms of the ℓp norm of the full sequence and an rate of decay. References
| last1 = Schneider | first1 = Reinhold | last2 = Uschmajew | first2 = André | title = Approximation rates for the hierarchical tensor format in periodic Sobolev spaces | journal = Journal of Complexity | volume = 30 | year = 2014 | issue = 2 | pages = 56–71 | issn = 0885-064X | doi = 10.1016/j.jco.2013.10.001| citeseerx = 10.1.1.690.6952 }} See Section 2.1 and Footnote 5. 4 : Functional analysis|Numerical analysis|Inequalities|Lemmas |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。