Pages that link to "Item:Q294506"
From MaRDI portal
The following pages link to Efficiency of weak greedy algorithms for \(m\)-term approximations (Q294506):
Displaying 10 items.
- Lebesgue constants for Chebyshev thresholding greedy algorithms (Q824549) (← links)
- Greedy bases are best for \(m\)-term approximation (Q1039885) (← links)
- The best \(m\)-term approximation and greedy algorithms (Q1127004) (← links)
- Weak greedy algorithms (Q1968628) (← links)
- Quasi-greedy bases for sequences with gaps (Q2019394) (← links)
- The weighted property (A) and the greedy algorithm (Q2334382) (← links)
- On the generalized approximate weak Chebyshev greedy algorithm (Q2985963) (← links)
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776) (← links)
- Approximate weak greedy algorithms (Q5950886) (← links)
- On the worst-case inefficiency of CGKA (Q6114271) (← links)