skip to content

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

Presented by: 
Konstantin Ryutin
Thursday 21st February 2019 - 09:40 to 10:15
INI Seminar Room 1
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.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons