Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Bisection Algorithm, focusing on the convergence of sequences and the continuity of functions. It explains the properties of supremum and infimum, the Bolzano-Weierstrass theorem, and the concept of intermediate values. The lecture also discusses the convergence criteria of sequences and the uniqueness of limits, with a detailed demonstration of the algorithm's application. Additionally, it explores the image of intervals under functions, emphasizing the importance of continuity and the relationship between minimum and maximum values.