Numerical Analysis: Nonlinear Equations

Related lectures (30)

Page 1 of 3

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

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

Explores the Newton method for non-linear equations, discussing convergence criteria and stopping conditions.

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

Covers the Newton method for finding zeros of functions using data interpolation.

Explores iterative methods for solving nonlinear equations, discussing convergence properties and implementation details.

Explores Newton's method for finding roots of nonlinear equations and its interpretation as a second-order method.

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

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

Covers the convergence of Newton's method and its applications in numerical analysis.