Two lower estimates in greedy approximation
From MaRDI portal
Publication:1423641
DOI10.1007/s00365-003-0533-6zbMath1044.41010MaRDI QIDQ1423641
E. D. Livshitz, Vladimir N. Temlyakov
Publication date: 7 March 2004
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-003-0533-6
41A25: Rate of convergence, degree of approximation
Related Items
Efficiency of the weak Rescaled Pure Greedy Algorithm, Greedy algorithms for prediction, Rescaled pure greedy algorithm for Hilbert and Banach spaces, On performance of greedy algorithms, Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations, Greedy expansions in Banach spaces, Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms, Greedy expansions in Hilbert spaces, Approximation and learning by greedy algorithms