University of Cambridge > > Isaac Newton Institute Seminar Series > Optimal sampling for approximation on general domains

Optimal sampling for approximation on general domains

Add 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity