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 listsNew Thinking In Economics Tarner Lectures Mordell LecturesOther talksPaediatric Malignancies The Enigma of Emotion Applications of uncertainty quantification and sensitivity analysis for cardiovascular models Reduced order modeling for uncertainty quantification in cardiac electrophysiology Application of Deep Learning on Reducing Uncertainty in the Atrial Structure from Contrast-enhanced MRIs |