Lectures related to Bisection Method: Iterative Search for Zeros

Root Finding Methods: Secant, Newton, and Fixed Point Iteration

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

Root Finding Methods: Bisection and Secant Techniques

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

Bisection Method: Approximating Zeros of Functions

Covers the bisection method for approximating zeros of functions, discussing advantages, disadvantages, and an alternative approach for faster convergence.

Nonlinear Equations: Methods and Applications

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

Numerical Methods: Iterative Techniques

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

Numerical Methods in Chemistry

Covers the implementation of numerical methods in MATLAB for solving chemical problems.

Numerical Methods: Bisection and Multidimensional Arrays

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

Iterative Methods for Nonlinear Equations

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

Numerical Analysis: Nonlinear Equations

Explores the numerical analysis of nonlinear equations, focusing on convergence criteria and methods like bisection and fixed-point iteration.

Numerical Methods: Fixed Point and Picard Method

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

Root Finding Methods: Secant and Newton's Methods

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

Vectorization in Python: Efficient Computation with Numpy

Covers vectorization in Python using Numpy for efficient scientific computing, emphasizing the benefits of avoiding for loops and demonstrating practical applications.

Bisection Method

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

Numerical Analysis: Nonlinear Equations

Covers algorithms for solving mathematical problems approximately using a computer, including nonlinear equations and numerical approximation methods.

Nonlinear Equations: Bisection Method

Introduces root finding using the bisection method for nonlinear equations, illustrated with a three-tanks system example.

Attack on RSA using LLL

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

Bisection Method, Newton Method

Covers the Bisection Method and Newton Method for solving nonlinear equations using interval splitting and tangent lines.

Numerical Analysis: Introduction to Computational Methods

Covers the basics of numerical analysis and computational methods using Python, focusing on algorithms and practical applications in mathematics.

Bisection Method: Proposition and Demonstration

Covers the bisection method proposition and its demonstration for finding roots.

Bisection Method: Zero Finding

Covers the bisection method for finding zeros of continuous functions.