Two lower estimates in greedy approximation (Q1423641): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00365-003-0533-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090479267 / rank | |||
Normal rank | |||
Revision as of 21:51, 19 March 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
