Best m-term approximation of the "step-function" and related problems
Duration: 38 mins 52 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Ryutin, K
Thursday 21st February 2019 - 09:40 to 10:15 |
|---|
| Created: | 2019-02-21 16:14 |
|---|---|
| Collection: | Approximation, sampling and compression in data science |
| Publisher: | Isaac Newton Institute |
| Copyright: | Ryutin, K |
| Language: | eng (English) |
| Abstract: | 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: γ2--norm, random approximations, orthomassivity of a set.... I plan to show what can be achieved by these techniques. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 565.45 MB | View | Download | |
| WebM | 640x360 | 467.01 kbits/sec | 133.00 MB | View | Download | |
| iPod Video | 480x270 | 522.21 kbits/sec | 148.66 MB | View | Download | |
| MP3 | 44100 Hz | 249.74 kbits/sec | 71.19 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||