Halley's method

Related lectures (29)

Page 1 of 3

Covers root-finding methods, focusing on the bisection and secant techniques, their implementations, and comparisons of their convergence rates.

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

Covers numerical methods for finding roots, including secant, Newton, and fixed point iteration techniques.

Illustrates the Newton's method graphically, discussing convergence and extreme cases.

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

Covers coordinate descent, a method for optimizing functions by updating one coordinate at a time.

Discusses numerical methods, focusing on stopping criteria, SciPy for optimization, and data visualization with Matplotlib.

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

Discusses the Taylor series and secant method, focusing on their applications in numerical analysis and root-finding techniques.

Summarizes the finite difference method for solving one-dimensional limit problems.