Characterization of 1-greedy bases (Q818457)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5013594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of 1-greedy bases |
scientific article; zbMATH DE number 5013594 |
Statements
Characterization of 1-greedy bases (English)
0 references
20 March 2006
0 references
The authors investigate 1-greedy bases for a real Banach space, i.e., bases for which the greedy algorithm provides the best \(m\)-term approximation. A characterization of 1-greediness is studied. The authors also give a list of open problems that arise from this article.
0 references
Banach space
0 references
best approximation
0 references
greedy algorithms
0 references
approximation error
0 references
unconditional basis
0 references
Haar basis
0 references
0 references
0.8628010749816895
0 references
0.8618885278701782
0 references
0.8566057085990906
0 references
0.8563453555107117
0 references
