Optimality of Algorithms for Approximation and Computation - Rothschild Lecture
Isaac Newton Institute for Mathematical Sciences via YouTube
Get 20% off all career paths from fullstack to AI
Lead AI Strategy with UCSB's Agentic AI Program — Microsoft Certified
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore the cutting-edge research on optimality of algorithms for approximation and computation in this Rothschild Lecture delivered by Professor Ronald DeVore from Texas A&M University. Delve into the intricate world of data science as the lecture covers topics related to approximation, sampling, and compression. Gain insights into the latest developments in mathematical sciences and their applications in the field of data analysis. Presented at the prestigious Isaac Newton Institute for Mathematical Sciences, this hour-long talk offers a deep dive into the theoretical foundations that underpin modern computational methods.
Syllabus
Date: Tuesday 21st May 2019 - 16:00 to
Taught by
Isaac Newton Institute for Mathematical Sciences