Bisection Method: Approximating Zeros of Functions

Related lectures (29)

Covers the convergence of fixed point methods for nonlinear equations, including global and local convergence theorems and the order of convergence.

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

Covers the bisection method for finding function roots within intervals and its geometric interpretation.

Explores bisection and Regula Falsi bracketing methods for finding roots.

Covers the bisection method for finding zeros of nonlinear functions.

Covers numerical methods in physics, focusing on solving complex problems and understanding limitations.

Covers exam-like problems on nonlinear equations, ODEs, and numerical methods.

Covers Newton's method for finding zeros of functions through fixed point iteration and discusses convergence properties.

Explores Runge Kutta and multistep methods for solving ODEs, including Backward Euler and Crank-Nicolson.

Page 2 of 2