Two lower estimates in greedy approximation (Q1423641): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Vladimir N. Temlyakov / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Wolfgang W. Breckner / rank | |||
Normal rank | |||
Revision as of 08:19, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two lower estimates in greedy approximation |
scientific article |
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
