Quasi-greedy property of subsystems of the multivariate Haar system (Q2821881)
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: Quasi-greedy property of subsystems of the multivariate Haar system |
scientific article; zbMATH DE number 6629494
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-greedy property of subsystems of the multivariate Haar system |
scientific article; zbMATH DE number 6629494 |
Statements
Quasi-greedy property of subsystems of the multivariate Haar system (English)
0 references
26 September 2016
0 references
greedy algorithm
0 references
quasi-greedy algorithm
0 references
All sets of dyadic cubes are described for which a subsystem of the multivariate Haar system is quasi-greedy in \(L^1(0,1)^d\). Moreover, it is proved that the greedy algorithm has for these sets a good rate of convergence.
0 references
