On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1) (Q1040855)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1) |
scientific article; zbMATH DE number 5639032
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1) |
scientific article; zbMATH DE number 5639032 |
Statements
On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1) (English)
0 references
26 November 2009
0 references
The author studies a weak thresholding greedy algorithm in \(L^1 (0,1)\) with regard to the Haar system. He proves that the Haar system is a good ``non quasi-greedy'' basis.
0 references
greedy algorithms
0 references
quasi-greedy basis
0 references
convergence
0 references
