Curve Fitting: Polynomial Interpolation

This lecture covers the concept of curve fitting through polynomial interpolation, focusing on the convergence speed of fitting methods and the associated theorems. It discusses the stability of polynomial interpolation, measurement errors, and the Clenshaw-Curtis nodes for avoiding the Runge's phenomenon. The lecture also explores the impact of equally distributed nodes and noise on polynomial fitting, emphasizing the importance of Lebesgue constant in evaluating the conditioning of the interpolation.