YoVDO

On the Completeness of Interpolation Algorithms

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Numerical Analysis Courses Computational Mathematics Courses Approximation Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive lecture on the completeness of interpolation algorithms presented by Raheleh Jalali from the Hausdorff Center for Mathematics. Delve into the intricate details of this 22-minute talk, which draws insights from recent publications in the field. Gain a deeper understanding of the mathematical foundations and theoretical aspects of interpolation algorithms, their completeness properties, and potential applications. Examine the research findings discussed in the linked ACM and arXiv papers to enhance your knowledge of this advanced topic in computational mathematics and algorithm design.

Syllabus

Raheleh Jalali: On the Completeness of Interpolation Algorithms


Taught by

Hausdorff Center for Mathematics

Related Courses

Introducción a la informática: codificación de la información
Universitat Jaume I via Independent
Introducción al desarrollo de videojuegos con Unity3D
Universitat Jaume I via Independent
Numerical Analysis
Vidyasagar University via Swayam
Computational Mathematics with SageMath
Institute of Chemical Technology (ICT) via Swayam
Computational Commutative Algebra
NPTEL via YouTube