报告地点：行健楼学术活动室526
邀请人：汪艳秋
报告摘要：Greedy algorithms are ubiquitous in computational mathematics. In this talk, I will present novel convergence estimates of greedy algorithms including the reduced basis method for parametrized PDEs, the empirical interpolation method for approximating parametric functions, and the greedy algorithms for nonlinear dictionary approximation. The proposed convergence rates are all based on the metric entropy of underlying compact sets. This talk is partially based on joint work Jonathan Siegel.
