Video library: V. N. Temlyakov, Rate of convergence of Thresholding Greedy Algorithms

VIDEO LIBRARY


Conference on the Theory of Functions of Several Real Variables, dedicated to the 90th anniversary of O. V. Besov May 29, 2023 11:00, Moscow, Steklov Mathematical Institute + Zoom

Rate of convergence of Thresholding Greedy Algorithms V. N. Temlyakov Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
https://youtu.be/ETKwJQOmmUo Abstract: The rate of convergence of the classical Thresholding Greedy Algorithm with respect to bases is studied. We bound the error of approximation by the product of both norms – the norm of $f$ and the $A_1$-norm of $f$. We obtain some results for greedy bases, unconditional bases, and quasi-greedy bases. In particular, we prove that our bounds for the trigonometric basis and for the Haar basis are optimal.