Greedy approximation in Banach spaces
From MaRDI portal
Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)
Recommendations
Cited in
(15)- Convergence of some greedy algorithms in Banach spaces
- Greedy algorithms and Kolmogorov widths in Banach spaces
- Greedy algorithms for reduced bases in Banach spaces
- Weak convergence of a greedy algorithm and the WN-property
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- scientific article; zbMATH DE number 1959425 (Why is no real title available?)
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Greedy approximation by arbitrary sets
- Greedy algorithms and bases from the point of view of Banach space theory
- Greedy algorithms with restricted depth search
- Greedy approximation of characteristic functions
- Brief introduction in greedy approximation
- Weak convergence of greedy algorithms in Banach spaces
- On orthorecursive expansions in terms of a chain of systems
This page was built for publication: Greedy approximation in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443975)