Lectures related to Root Finding Methods: Secant, Newton, and Fixed Point Iteration

Covers the bisection method for finding zeros of continuous functions through iterative narrowing of intervals.

Covers fixed point methods and the Picard method for solving nonlinear equations iteratively.

Explores the convergence of fixed point methods and the implications of different convergence rates.

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.