Scribd
Upload
27 views4 pages

Bisection Method for Root Finding in MATLAB

This document discusses using the bisection method to find roots of nonlinear equations numerically. It provides background on the bisection method, describes the algorithm, and includes MATLAB code to implement the method. The document is intended as a lab report for a numerical methods course.

Uploaded by

KASHFI UDDIN
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views4 pages

Bisection Method for Root Finding in MATLAB

This document discusses using the bisection method to find roots of nonlinear equations numerically. It provides background on the bisection method, describes the algorithm, and includes MATLAB code to implement the method. The document is intended as a lab report for a numerical methods course.

Uploaded by

KASHFI UDDIN
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Department of Materials Science & Engineering

Chittagong University of Engineering & Technology

Name: Kashfi Uddin


ID: 1912019
Course code: MATH 316
Course Title: Numerical Methods in Engineering Sessional

Experiment no.: 01
Experiment name: Determination of the roots of an equation in a single
variable using the Bisection method
Objectives:
1. To determine the roots of an equation in a single variable using the Bisection method.
2. To understand the MATLAB implementation of the Bisection method.
3. To analyze results using different initial values and error tolerance.

Introduction:
In various science and engineering research fields, the solution of nonlinear equations is required to advance
the research purpose. The bisection method is a reliable and extensively used numerical approach for
locating nonlinear equation roots. It is based on the intermediate value theorem, which claims that if the
sign of a continuous function changes across an interval, it must have at least one root within that interval.
The bisection method begins with an initial interval and bisects it repeatedly, narrowing the search range
until the desired level of accuracy is achieved. This approach is relatively easy to implement and assures
solution convergence if specific requirements are met.

Bisection Method:
It is also called binary chopping or the half-interval method. For resolving f(x) = 0, the bisection method
is one of the easy and most valid iterative procedures. It is based on intermediate value property, i.e.
whether f(x) is real and continuous in (a, b) and f(a), f(b) are opposed signs, then ∃ at least one root in (a,
b) such that

x0 = a + b
2

Now the following three cases arise

• If f(x0) = 0, then is x0 root of f(x).


• If f(x0) > 0, then root of f(x0) will lie between x0 and a , that is
a + x0
X1=
2
• If f(x0) < 0, then root will lie between x0 and b , that is

b + x0
X2=
2
Figure 1 : A few steps of the bisection method applied over
the starting range [a1;b1].

Algorithm:
1. Step 1: Define the nonlinear equation. The first step is to define the provided nonlinear equation as
a function; we'll name it "f(x)".
2. Step 2: Choose an interval. Choose a starting interval [a, b] such that the signs of f(a) and f(b) are
the opposite. This guarantees that a root is present during the interval.
3. Step 3: Set convergence criteria: The appropriate tolerance, epsilon, denotes the permitted
inaccuracy in the root approximation.
4. Step 4: Implement the bisection method:
• Initialize variables: Set a counter, n, to 0.
• While (b - a) > epsilon, do the following steps:
• Increment the counter: n = n + 1.
• Calculate the midpoint: c = (a + b) / 2.
• Evaluate f(c): Compute f(c) using the defined function.
• Check for convergence: If f(c) is within the appropriate tolerance or equal to zero, the
iteration should be terminated.
• Update the interval: Set b = c if the signs of f(a) and f(c) are the opposites; else, set a = c.
• Return the approximate root: Return the value of c to the nonlinear equation's approximate
root upon convergence.
Matlab Code:
%ingradients
f = input('Enter your function= ');
a = input('Enter left side of integer= ');
b = input('Enter right side of integer= ');
n = input('Enter no of iterations= ')
e = input('Enter tolerance= ')
if f(a)*f(b)<0
for i=1:n
c=(a+b)/2;
fprintf('P%d = %.4f\n',i,c)
if abs(c-b)<e || abs (c-a)<e
break
end
if f(a)*f(c)<0
b=c;
else if f(b)*f(c)<0
a=c;
end
end
end

Result:
After inputting the code into Matlab and running without any error, we define the function,
F(x)= x^3-x^2-11;
The root is 2.6121

Discussion:
This lab report presented an implementation of MATLAB's bisection method to solve nonlinear
equations. The results showed that the bisection method converged to a root within a specified tolerance
(up to 4 decimals). The calculation is so time efficient in Matlab than hand calculation.

Common questions

Powered by AI

Varying the initial interval and tolerance in the Bisection method can significantly influence the results. A correctly chosen initial interval ensures the existence of a root, as improper intervals may lead to false results due to the lack of a sign change, which is crucial for the Bisection method. The selection of tolerance determines the precision of the approximation: a smaller tolerance results in a more accurate root approximation but may require more iterations, affecting computational efficiency. Conversely, a larger tolerance speeds up convergence but sacrifices accuracy .

Using a structured algorithmic framework like the Bisection method in engineering applications offers several advantages. It provides a systematic approach to handle complex numerical challenges, ensuring consistency and reliability. The Bisection method's simplicity and guaranteed convergence make it particularly useful for initial root-finding tasks, allowing engineers to quickly narrow down the search for solutions within specified tolerances. Additionally, its ease of use and implementation in computational software, such as MATLAB, facilitates the handling of large datasets and rigorous performance demands typical in engineering .

The iterative steps in the Bisection method involve: 1) Calculating the midpoint of the current interval, 2) Evaluating the function at the midpoint, and 3) Checking if the solution has converged within the specified tolerance or if the function at the midpoint equals zero. If these conditions are met, the process stops. Otherwise, the interval is updated by replacing either the left or the right end with the midpoint, depending on the sign of the function at the midpoint relative to the sign of the function at the current interval ends. This step-by-step narrowing ensures that the interval containing the root becomes progressively smaller, effectively zeroing in on the root .

The Bisection method ensures that the chosen interval always contains a root by updating the interval based on the sign of the function at the midpoint. Initially, an interval [a, b] is selected where the function values at the endpoints are of opposite signs, meaning a root exists within. Each iteration calculates the midpoint c of the interval and evaluates the function at c. Depending on the sign of f(c), either the left or right endpoint is replaced by c, maintaining the condition that f(a)f(b) < 0. This procedure ensures that the interval is halved while still enclosing the root .

The Bisection method guarantees convergence to a root of a nonlinear equation if the function is continuous on the interval [a, b] and the signs of the function evaluated at the endpoints a and b are opposite (i.e., f(a) * f(b) < 0).

The intermediate value theorem plays a crucial role in the functioning of the Bisection method by providing the mathematical basis for identifying the existence of a root within an interval. The theorem states that if a real-valued and continuous function changes sign over an interval [a, b], then there must be at least one root within this interval. This principle assures that by bisecting the interval repeatedly, the Bisection method can effectively narrow down the region where the root is located, guaranteeing the convergence to a root if the conditions of continuity and sign change are met .

The Bisection method is considered a reliable approach for finding roots of nonlinear equations in science and engineering because of its grounding in the intermediate value theorem, which ensures that a root exists within the interval if the function is continuous and changes sign. Its simplicity lies in its straightforward iterative process and ease of implementation, like in MATLAB. Moreover, the Bisection method provides guaranteed convergence to a root as long as the function meets the necessary conditions, making it a robust tool for numerical solutions, particularly when other more complex methods may not apply .

Despite its reliability, the Bisection method has limitations such as its relative slowness in convergence compared to other methods like Newton's method or the Secant method, especially near roots. This can make it inefficient for complex problems that demand fast solutions. Moreover, the method requires that the function is sign-changing and continuous over the interval, which may not always be easy to establish in all practical scenarios. These limitations can affect the choice of method when more rapid convergence or handling of complex functions without sign changes is required .

To effectively implement the Bisection method in MATLAB, you need to define the function, specify the initial interval [a, b], and set a maximum number of iterations along with a convergence criterion defined by tolerance 'e'. The method involves calculating the midpoint of the interval and updating either 'a' or 'b' based on the sign of the product of the function evaluated at the endpoints. The method stops when the interval width is less than the specified tolerance. Tolerance determines the accuracy of the root approximation by controlling how close to zero the function must be before terminating the iterations .

MATLAB enhances the efficiency of implementing the Bisection method by allowing for precise arithmetic and offering built-in functions for evaluating and looping operations like those needed in numerical methods. Specific features utilized include input functions for defining nonlinear equations and intervals, iterative loops for carrying out the steps of the Bisection method, and tolerance checks for convergence. MATLAB's ability to handle iterative processes efficiently and output results quickly, as demonstrated in the programming of the bisection procedure, significantly speeds up computations compared to manual calculations .

You might also like