Two lower estimates in greedy approximation (Q1423641)
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 2051468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two lower estimates in greedy approximation |
scientific article; zbMATH DE number 2051468 |
Statements
Two lower estimates in greedy approximation (English)
0 references
7 March 2004
0 references
Given an arbitrary Hilbert space with a denumerable orthonormal basis, the authors construct two examples providing lower estimates for the rate of convergence of the pure Greedy algorithm and of the weak Greedy algorithm, respectively.
0 references
0.861616849899292
0 references
0.8485707640647888
0 references
0.8374061584472656
0 references
0.8318859338760376
0 references
