Greedy approximation

Thời gian: 09:00 đến 11:30 Ngày 29/09/2016

Địa điểm: C2-714

Tóm tắt:

We study sparse representations and sparse approximations with respect to redundant dictionaries and bases. We address the problem of designing and analyzing greedy methods of approximation. A key question in this regard is: How to design an efficient algorithm? Answering this question we consider different greedy-type algorithms with respect to different systems. An important ingredient of the talk is that we perform our analysis in a Banach space instead of a Hilbert space. It is known that in many numerical problems users are satisfied with a Hilbert space setting and do not consider a more general setting in a Banach space. There are known arguments that justify interest in Banach spaces.