Bisection Method – Numerical Root Finding Method in MATLAB

Bisection method is root finding method of non-linear equation in numerical method. It is also known as binary search method, interval halving method, the binary search method, or the dichotomy method and Bolzano’s method. Bisection method is bracketing method because its roots lie within the interval. Therefore, it is called closed method. This method is always converge. The disadvantage of this method is that it is slow compare than other numerical methods to solve nonlinear equation.

At here, we write the code of Bisection Method in MATLAB step by step. MATLAB is easy way to solve complicated problems that are not solve by hand or impossible to solve at page. MATLAB is develop for mathematics, therefore MATLAB is the abbreviation of MATrix LABoratory.

At here, we find the root of the function f(x) = x²-2 = 0 by using Bisection method with the help of MATLAB.

MATLAB Code of Bisection Method

clear all;
close all;
clc;
f=inline('x^2-2');
a=input('Enter a=');
b=input('Enter b=');
tol=input('Enter tolerance=');
itr=input('Enter number of iteration=');
p=0;
for i=1:itr
    m=(a+b)/2;
    if abs(a-b) < tol
        p=1;
        k=i;
        break;
    else
        if f(a)*f(m)<0
            b=m;
        else
            a=m;
        end
    end
end

if p==1
    fprintf('Solution is %f at iterations %i',m,k)
else
    fprintf('No convergent solution exist in the given number iteration')
end