Lower bounds for the rate of convergence of greedy algorithms (Q3405544)
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 5668382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the rate of convergence of greedy algorithms |
scientific article; zbMATH DE number 5668382 |
Statements
Lower bounds for the rate of convergence of greedy algorithms (English)
0 references
10 February 2010
0 references
pure greedy algorithm
0 references
best \(n-\)term approximation
0 references
interpolation classes
0 references
rate of convergence
0 references
0.8824008703231812
0 references
0.8485707640647888
0 references
0.8364783525466919
0 references
0.8337680101394653
0 references
0.8283151388168335
0 references
