Root-finding algorithms

Related lectures (29)

Discusses the bisection method for solving nonlinear equations and its implementation using Python with NumPy and Matplotlib.

Focuses on using the bisection method to approximate function roots with precision.

Covers methods for solving nonlinear equations, including bisection and Newton-Raphson methods, with a focus on convergence and error criteria.

Covers Coppersmith's method for finding small roots of polynomials modulo N efficiently.

Introduces the bisection method for finding zeros of nonlinear functions.

Covers open methods, Newton-Raphson, and secant method for iterative solutions in numerical methods.

Explores iterative methods for solving linear systems with a focus on error control.

Covers numerical methods for root finding, focusing on the secant and Newton's methods.

Explores dominant balance analysis in solving the quintic polynomial, with a focus on non-dimensionalization and series expansions.

Page 2 of 2