Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Nonlinear Equations: Bisection Method

In course

ChE-312: Numerical methods

This course introduces students to modern computational and mathematical techniques for solving problems in chemistry and chemical engineering. The use of introduced numerical methods will be demonstrated using the Python programming language. ...

Description

This lecture covers the concept of root finding for continuous functions, focusing on the bisection method to find a finite x where f(x)=0. It also includes examples of applying the method to solve a three-tanks system with pumps, tanks, and valves, emphasizing the importance of initial guesses for the root.

Instructors (2)

Kevin Sivula

Ljubisa Miskovic

Ljubisa Miskovic earned his Ph.D. degree in Automatic Control from the Swiss Federal Institute of Technology (EPFL) under the co-supervision of Dominique Bonvin and Alireza Karimi, in 2006. He pursued his postdoctoral studies at the Centre for Systems Engineering and Applied Mechanics, Universite Catholique de Louvain with Michel Gevers before moving to the laboratory of Vassily Hatzimanikatis at the EPFL. In 2010, he became a research scientist. His research interests include systems biology, metabolic engineering, synthetic biology, data-driven control design, system identification, stochastic processes and estimation theory.

Official source

Related concepts (20)

Root-finding algorithms

In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Bisection method

In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods.

Tank

A tank is an armoured fighting vehicle intended as a primary offensive weapon in front-line ground combat. Tank designs are a balance of heavy firepower, strong armour, and good battlefield mobility provided by tracks and a powerful engine; usually their main armament is mounted in a turret. They are a mainstay of modern 20th and 21st century ground forces and a key part of combined arms combat.

Numerical methods for ordinary differential equations

Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs). Their use is also known as "numerical integration", although this term can also refer to the computation of integrals. Many differential equations cannot be solved exactly. For practical purposes, however – such as in engineering – a numeric approximation to the solution is often sufficient. The algorithms studied here can be used to compute such an approximation.

Related lectures (32)

Numerical Methods in Chemistry

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

Attack on RSA using LLL

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

Numerical Methods: Iterative Techniques

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

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 in Biomechanics: Hip-A