A Lower Estimate for Entropy Numbers

Author: Kühn T.

Source: Journal of Approximation Theory, Volume 110, Number 1, May 2001 , pp. 120-124(5)

Publisher: Academic Press

Buy & download fulltext article:

OR

Price: $52.63 plus tax (Refund Policy)

Abstract:

The behaviour of the entropy numbers ek(id: lnprarrlnq), 0<p<qlesinfin, is well known (up to multiplicative constants independent of n and k), except in the quasi-Banach case 0<p<1 for “medium size” k, i.e., when log nlesklesn, where only an upper estimate is available so far. We close this gap by proving the lower estimate ek(id: lnprarrlnq)gesc(log(n/k+1)/k)1/p-1/q for all 0<p<qlesinfin and log nlesklesn, with some constant c>0 depending only on p. Copyright 2001 Academic Press.

Keywords: entropy numbers; sequence spaces

Language: English

Document Type: Research article

Affiliations: Fakultät für Mathematik und Informatik, Mathematisches Institut, Universität Leipzig, Augustusplatz 10/11, Leipzig, 04109, Germany

Publication date: 2001-05-01

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page