Lebesgue inequalities for Chebyshev thresholding greedy algorithms (Q2206762): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127218617, #quickstatements; #temporary_batch_1722270516152 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127218617 / rank | |||
Normal rank | |||
Latest revision as of 17:29, 29 July 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
