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 > Optimal sampling for approximation on general domains
Optimal sampling for approximation on general domainsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. ASCW03 - Approximation, sampling, and compression in high dimensional problems We consider the approximation of an arbirary function in any dimension from point samples. Approximants are picked from given or adaptively chosen finite dimensional spaces. Various recent works reveal that optimal approximations can be constructed at minimal sampling budget by least-squares methods with particular sampling measures. In this talk, we discuss strategies to construct these measures and their samples in the adaptive context and in general non-tensor-product multivariate domains. 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 listsType the title of a new list here CIDC Seminar Programme CSML listOther talksThe Bayes linear approach to emulation and history matching for complex computer simulators Probabilistic Interpolation of Uncertain Local Activation Times Clinical Applications of Cardiac Models The Scattering Map on Oppenheimer-Snyder Spacetime Welcome and Introduction |