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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Optimal sampling for approximation on general domains

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 lists

In person in the Max Perutz Lecture Theatre (CB2 0QH) and via Zoom, link:https://mrc-lmb-cam-ac-uk.zoom.us/j/91551032153?pwd=bUhESzgvZDlDTUllb1pCS1BQdFBlZz09 Clifford Allbutt Lecture Theatre, Clifford Allbutt Building (former LMB building) Centre for Advanced Photonics and Electronics, 9 JJ Thompson Ave.

Other talks

Title abstract tbc Tea and Coffee Break Theophilus Richmond’s The First Crossing: The Transition from Slavery to Indentureship in the Caribbean and the Case of the Black Slave on the Hesperus Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning Cooperation for Nature Why people with schizophrenia die earlier? Mortality and accelerated ageing
 

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