Scribd
Upload
593 views

Matlab Code Bisection Method

The document describes the bisection method for finding the root of a function. It provides the MATLAB code to implement the bisection method, which takes as inputs a function, left and right endpoints of an interval, and number of iterations. The code iteratively bisects the interval and determines if the root is in the lower or upper half, outputting the estimated solution and error bound after the iterations. An example run on a function converges after 13 iterations.

Uploaded by

Malik Mohammad Asif
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
593 views

Matlab Code Bisection Method

The document describes the bisection method for finding the root of a function. It provides the MATLAB code to implement the bisection method, which takes as inputs a function, left and right endpoints of an interval, and number of iterations. The code iteratively bisects the interval and determines if the root is in the lower or upper half, outputting the estimated solution and error bound after the iterations. An example run on a function converges after 13 iterations.

Uploaded by

Malik Mohammad Asif
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

The

 Bisection  Method    
 
One  way  to  define  function  in  command  window  is:    
 
>>  f=@(x)x.^3+4*x.^2-­‐10  
f  =    
       @(x)x.^3+4*x.^2-­‐10  
>>  f(3)  
ans  =  
       53  
 
Matlab  Code:    (in  MATLAB  editor)    
 
 
function [x e] = mybisect(f,a,b,n)
% function [x e] = mybisect(f,a,b,n)
% Does n iterations of the bisection method for a function f
% Inputs: f -- an inline function
% a,b -- left and right edges of the interval
% n -- the number of bisections to do.
% Outputs: x -- the estimated solution of f(x) = 0
% e -- an upper bound on the error
format long
c = f(a); d = f(b);
if c*d > 0.0
error('Function has same sign at both endpoints.')
end
disp(' x y')
for i = 1:n
x = (a + b)/2;
y = f(x);
disp([ x y])
if y == 0.0 % solved the equation exactly
e = 0;
break % jumps out of the for loop
end
if c*y < 0
b=x;
else
a=x;
end
end
 
 
 
To  run  this:    
 
>>  mybisect2(f,1,2,  13)  
                     x                                    y  
     1.500000000000000      2.375000000000000  
     1.250000000000000    -­‐1.796875000000000  
     1.375000000000000      0.162109375000000  
     1.312500000000000    -­‐0.848388671875000  
     1.343750000000000    -­‐0.350982666015625  
     1.359375000000000    -­‐0.096408843994141  
     1.367187500000000      0.032355785369873  
     1.363281250000000    -­‐0.032149970531464  
     1.365234375000000      0.000072024762630  
     1.364257812500000    -­‐0.016046690754592  
     1.364746093750000    -­‐0.007989262812771  
     1.364990234375000    -­‐0.003959101522923  
     1.365112304687500    -­‐0.001943659010067  
ans  =  
     1.365112304687500  

You might also like