Best m-term approximation of the "step-function" and related problems

Add to your list(s) Download to your calendar using vCal

• Konstantin Ryutin ()
• Thursday 21 February 2019, 09:40-10:15
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

This talk has been canceled/deleted

The main point of the talk is  the problem of approximation    of the step-function by $m$-term trigonometric polynomials  and some closely related problems: the approximate rank of a specific triangular matrix,  the Kolmogorov width of BV functions. This problem has its origins  in approximation theory (best sparse approximation and Kolmogorov widths) as well as in computer science (approximate rank of a matrix). There are different approaches and techniques: $\gamma_2$—norm, random approximations, orthomassivity of a set….  I plan to show what can be achieved by these techniques.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.