Department of Mathematics - Seminar on Applied Mathematics - Entropy-based convergence rates of greedy algorithms

In this talk, I will present some new convergence estimates of greedy algorithms including the reduced basis method for parametrized PDEs and the empirical interpolation method for approximating parametric functions. The proposed convergence rates are based on the metric entropy numbers of underlying parametrized compact sets. This talk is partially based on joint work Jonathan Siegel.