![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Random sections of ellipsoids and the power of random information
![]() Random sections of ellipsoids and the power of random informationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. ASCW01 - Challenges in optimal recovery and hyperbolic cross approximation We study the circumradius of the intersection of an $m$-dimensional ellipsoid$mathcal E$ with half axes $sigma_1geqdotsgeq sigma_m$ with random subspaces of codimension $n$. We find that, under certain assumptions on $sigma$, this random radius $mathcal{R}n=mathcal{R}_n(sigma)$ is of the same order as the minimal such radius $sigma{n+1}$ with high probability. In other situations $mathcal{R}_n$ is close to the maximum$sigma_1$. The random variable $mathcal{R}_n$ naturally corresponds to the worst-case error of the best algorithm based on random information for $L_2$-approximation of functions from a compactly embedded Hilbert space $H$ with unit ball $mathcal E$. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsThe Eddington Lectures CSaP Professional Development Policy Seminars Switch Off WeekOther talks“Doing more” to keep children safe online – why the tech sector can only do so much Moor “culture” in independent Ceylon: the 1940s establishment of the Moors Islamic Cultural Home Developing new genetic tools to unravel Cryptosporidium transmission The 'dye herbarium': capturing colour in botanical collections How We got here |