Lower bounds for the rate of convergence of greedy algorithms (Q3405544): 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.1070/im2009v073n06abeh002478 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059687034 / rank | |||
Normal rank | |||
Revision as of 08:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the rate of convergence of greedy algorithms |
scientific article |
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
