Optimality of Algorithms for Approximation and Computation - Rothschild Lecture
Isaac Newton Institute for Mathematical Sciences via YouTube
MIT Sloan: Lead AI Adoption Across Your Organization — Not Just Pilot It
Free courses from frontend to fullstack and AI
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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