Lebesgue inequalities for Chebyshev thresholding greedy algorithms (Q2206762): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:45, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lebesgue inequalities for Chebyshev thresholding greedy algorithms |
scientific article |
Statements
Lebesgue inequalities for Chebyshev thresholding greedy algorithms (English)
0 references
26 October 2020
0 references
The authors give important results and comment on Chebyshev thresholding greedy algorithms by the investigations of the numerical behaviours for the Chebyshevian Lebesgue parameters,under pertinent examples and references.
0 references
Chebyshev thresholding greedy algorithm
0 references
Chebyshevian Lebesgue parameter
0 references
