Scribd
Upload
31 views

Minor Project Bisection Method

The document describes a student project to implement the bisection method for finding roots of polynomial equations in C++. The project is carried out by two students, Y.Bhanu Prasad and N.Ajay Reddy, under the supervision of Dr. K. Govardhan. The objective is to find roots of equations in a simple manner with increasing accuracy. The methodology involves writing C++ code to perform the bisection method by iteratively narrowing down the interval containing the root. The project outline provides details on the problem statement, objectives, uniqueness, scope of work, resources required and background.

Uploaded by

N Ajay Reddy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Minor Project Bisection Method

The document describes a student project to implement the bisection method for finding roots of polynomial equations in C++. The project is carried out by two students, Y.Bhanu Prasad and N.Ajay Reddy, under the supervision of Dr. K. Govardhan. The objective is to find roots of equations in a simple manner with increasing accuracy. The methodology involves writing C++ code to perform the bisection method by iteratively narrowing down the interval containing the root. The project outline provides details on the problem statement, objectives, uniqueness, scope of work, resources required and background.

Uploaded by

N Ajay Reddy
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

GANDHI INSTITUTE OF TECHNOLOGY AND MANAGEMENT (GITAM)

(Deemed to be University, Estd. /s 3 of UGC Act 1956)


VISAKHAPATNAM*HYDERABAD«BENGALURU

Finding Roots of Equation using Bisection Method


In C++

B. Sc. SPH39g Minor Project

Name of Student :Y.Bhanu Prasad


N.Ajay Reddy
ID No. of Student 222012101034
222012101017

N M

GANDHI INSTITUTE OF TECHNOLOGY AND MANAGEMENT (GITAM)


(Deemed to be University, Estd. u/s 3 of UGC Act 1956)
VI^AKHAPATNAM*HYDERABAD#BENGALURU
GANDHI INSTITUTE OF TECHNOLOGY AND MANAGEMENT
(GITAM) SEMESTER VI 22-23

SPH392 Minor Project

Project Title:

Name of Supervisor Dr.K.Govardhan

Name of Student Y.Bhanu Prasad


N.Ajay Reddy
ID No. of Student :222012101034
222012101017

Summary of Proposed work (Minimum 200 words)


Our Project is to implement a Bisection method program. The programming language used
is C++. The objective of the project is to find the root of a polynomial function. The
bisection method is use to find the root of a polynomial function.
It bisects the interval and then selects a sub-interval in which the root must lie, and the solution is
iteratively reached by 'narrowing down the values after guessing, which encloses 'the actual solution. It
divides the interval in half and replaces one endpoint with the midpoint so that the root is bracketed. This
method is based on The Intermediate Value Theorem and easy to implement.

The working of the bisection method algorithm for a given function f(x):

Step 1:
Choose two values, a and b such that f(a)>0 and f(b) < 0.

Step 2:
Calculate a midpoint c as the arithmetic mean between a and b such that c (a+b)/2. This is called
interval halving.

Step 3:
valuate the function f for the value of c.

Step 4:
The root of the function is found only if the value of f(c) = 0.

Step 5:
If (c) # 0, then we need to check the sign: we replace a with c if fc) has the same sign as f(a) and we
kaep.the same value for b we replace b withc if flc) has the same sign as fb), and we keep the same
value for a To get the right value with the new value of a or b, we go back to step 2 And recalculateC.
The bracketing approach is known as the bisection method, and it is always convergent. Errors can be
managed. Increasing the number of iterations in the bisection method always results in a more accurate
root.

Key Words: finding real root of non-linear equations, teamwork, implementation of code.

y.Bhanu Prauad pA olol) 2 23


(Signature of Student)
Date: -
(Signature of Supervisor)
Date:

The Minor Project Outline


1 Student details: Y.Bhanu Prasad
N.Ajay Reddy
2. Project Title: Finding Roots of Equation using Bisection Method in C++.

. Supervisor Name: Dr.K.Govardhan

4. Problem statement (what is the problem being addressed):


The problem statement is about finding roots of the equation in a simplex manner and to
increases the accuracy of the root.

5. Objective of the project:


The objective of the project is finding roots of th polynomial equation in less time
complexity using the C++ code.

6. Uniqueness of the project


The bisection method is useful for
finding the roots of poynomial equation up to the n tems
depending on the point lies in the region of x value.

7. Scope of work
This method is used to find the root of an equation in each interval that value of x for which
f(x)=0.
8. Resources needed for the project: including pcople, hardware, software, etc.
Hardware requirements: laptop or pe
Software requirements: C++ compiler
9 Background of previous work done in the chosen area

10. Methodology
Using C++ compiler, we must write code to perform the operation
Of bisection Method.

Supervisor's Rating of the Technical Quality of this Project Outline

EXCELLENT/GOOD/FAIR/ POOR (Plcase specify):


Supervisor's suggestions and remarks about the outline (if applicable).

M
Date 28/05/2022 lo1
(Signature of Supervisor)

Name ofthe supervisor: D°, K. Giovamdhan

You might also like