Diploma Course in Computer Engineering

(As per directives of I Scheme, MSBTE)

A
MICROPROJECT REPORT
ON

“Algorithm to find the approximate root of algebraic

equations”

Subject – Applied Mathematics (AMI)

SUBMITTED
BY

Roll No Name Branch

1131 Harsh
Nandgaonkar
1132 Mayuresh CO2I
Nirbhavane
1133 Ozas Patel
1134 Het Panchal
1135 Aayush Parab
 PART A – PLAN

Topic of the Microproject: Algorithm to find the approximate root of

algebraic equations

BRIEF INTRODUCTION: -

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. There are various methods
that can be used to find the approximate root of an algebraic equation. Some of
them are Bisection method, Newton Raphson method, Regula Falsi method, etc.

AIM OF THE MICROPROJECT

• To implement an algorithm to find the approximate root of an

algebraic equation using the Newton-Raphson method and Bisection
method.
• To verify the correctness of the algorithm using test cases.
• To analyze the convergence and stability of the method.
 RESOURCES REQUIRED-

Name of
Sr. No. Specifications QTY Remarks
Resources

Hardware:
1. Computer CPU - Ryzen 3 1200
system RAM - 8 GB For all
Storage Required - At As per Practical
most 1 GB batch of Test
size Case
genera-
tion.
2. Operating
system Windows 10 Pro

3. Software
Microsoft Word 2010 or above
for report
 PART B – PLAN

Topic of the Project : Algorithm to find the approximate root

of algebraic equations

BRIEF INTRODUCTION:-

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. There are various methods that can be used to find the
approximate root of an algebraic equation. Some of them are Bisection method, Newton
Raphson method, Regula Falsi method, etc.

AIM OF THE MICROPROJECT-

• To implement an algorithm to find the approximate root of an

algebraic equation using the Newton-Raphson method and Bisection
method.
• To verify the correctness of the algorithm using test cases.
• To analyze the convergence and stability of the method.
COURSE OUTCOME INTEGRATED-

Writing an algorithm to find the approximate root of an algebraic equation.

ACTUAL PROCEDURE FOLLOWED-

➢ Group Information:

The basic aim of micro project is to accelerate the attainment of the

various outcomes in the cause. In the last two weeks of March the
subject was introduced. The syllabus as well as detail of micro project
was discussed. The groups of 5 members were formed. The schedule
of Plan A & B and presentation were finalized. The various micro
project topic related to subject was discussed.

➢ Finalization Of Micro Project:

After attending the feature of two weeks, we were able to select the
topic for micro project. We discussed the topic with our guide,
regarding the concept which we are going to apply in the project. We
individually tried to explain the basic platform of project.

➢ Planning:

From finalizing the project, we, the group members, started working on
the project. We started the planning phase. We discussed among
ourselves regarding the resource such as hardware and software
requirement. In third week of March, we completed the Part A plan of
the microproject.
 ➢ Module Distribution And Analysis Part:

Once the planning was over regarding resources etc., we also

finalized the module which we will be designing. According to the
members we distributed the module among them and started the
analysis.

➢ Design Part:

In this part, we tested the each module and get the actual result for our
micro project. By doing this we were clearer of the project.

➢ Submission:
First week of April was the submission week, we have to submit the
project to the guide. We have to complete both the Part A and Part B
plan of project. We also have to submit the soft copy of project to the
guide.

This report was created by: Harsh Nandgaonkar

 ACTUAL RESOURCES USED-

Name of
Sr. No. Specifications QTY Remarks
Resources

Hardware:
1. Computer CPU - Ryzen 3 1200
system RAM - 8 GB For all
Storage Required - At As per Practical
most 1 GB batch of Test
size Case
genera-
tion.
2. Operating
system Windows 10 Pro

3. Software
Microsoft Word 2010 or above
for report
 Output Of
The Micro-
Project
 Introduction to Root Finding Algorithm:-

What is Root Finding Algorithm?

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.

Most numerical root-finding methods use iteration, producing

a sequence of numbers that hopefully converge towards the root as
a limit. They require one or more initial guesses of the root as starting
values, then each iteration of the algorithm produces a successively more
accurate approximation to the root. Since the iteration must be stopped at
some point these methods produce an approximation to the root, not an
exact solution.

The behaviour of general root-finding algorithms is studied in numerical

analysis. However, for polynomials, root-finding study belongs generally
to computer algebra, since algebraic properties of polynomials are
fundamental for the most efficient algorithms. The efficiency of an
algorithm may depend dramatically on the characteristics of the given
functions. In general, numerical algorithms are not guaranteed to find all
the roots of a function, so failing to find a root does not prove that there is
no root.
 Methods of Root-Finding
There are several methods that can be used to find the approximate root of an
algebraic equation. Here are some of the most common ones:

1. Bisection Method: The simplest root-finding algorithm is the bisection

method. This is an iterative method that uses the intermediate value theorem
to narrow down the possible range of the root. The method works by
repeatedly dividing an interval in half and determining which half of the
interval contains the root.

2. Newton-Raphson method: This is an iterative method that uses the derivative

of the equation to calculate the slope of the curve at the current guess for the
root. The method then uses this slope to calculate a new guess that is closer
to the root.

3. Fixed-point iteration method: This is an iterative method that involves

rearranging the equation so that the root is on one side and then using this
rearranged equation to generate a sequence of guesses for the root. The
method works by repeatedly applying a fixed function to the current guess to
generate the next guess.

4. Secant method: This is an iterative method that uses a similar approach to the
Newton-Raphson method, but instead of using the derivative, it uses a finite
difference approximation to estimate the slope of the curve.

Each of these methods has its own advantages and disadvantages, and the choice of
method will depend on the specific problem being solved and the properties of the
equation being solved.
 Bisection Method

This is an algorithm to find the approximate root of an algebraic equation

using the bisection method:

1. Choose two initial guesses for the root of the equation, denoted by a
and b, such that f(a) and f(b) have opposite signs.

2. Calculate the midpoint of the interval [a, b], denoted by c.

3. Calculate the function value of the equation at c.

4. If f(c) is zero or less than a specified tolerance level, stop and return c
as the root.

5. Otherwise, if f(c) has the same sign as f(a), set a = c and repeat from
step 2.

6. Otherwise, set b = c and repeat from step 2.

7. Repeat steps 2 to 6 until the difference between a and b is less than a

specified tolerance level or a maximum number of iterations is
reached.

8. The final approximation for the root is the value of c.

 Newton-Raphson Method

This is an algorithm to find the approximate root of an algebraic equation

using the Newton-Raphson method:

1. Choose an initial guess for the root of the equation, denoted by x0.

2. Calculate the function value and derivative of the equation at x0.

3. Use the formula x1 = x0 - f(x0)/f'(x0) to calculate the next

approximation for the root, denoted by x1.

4. Repeat steps 2 and 3 with x1 as the new value of x0, until the
difference between successive approximations is less than a specified
tolerance level or a maximum number of iterations is reached.

5. The final approximation for the root is the value of xn.

 Fixed-Point Iteration Method

This is an algorithm to find the approximate root of an algebraic equation

using the Newton-Raphson method:

1. Choose an initial guess for the root of the equation, denoted by x0.

2. Rearrange the equation so that the root is on one side and obtain an
equivalent equation of the form x = g(x).

3. Define a function g(x) that corresponds to the rearranged equation.

4. Calculate the next guess for the root using the formula xn = g(xn-1).

5. If the difference between xn and xn-1 is less than a specified

tolerance level, stop and return xn as the root.

6. Otherwise, set xn-1 = xn and repeat from step 4.

7. Repeat steps 4 to 6 until the difference between xn and xn-1 is less

than a specified tolerance level or a maximum number of iterations is
reached.

8. The final approximation for the root is the value of xn.

Conclusion –
We have implemented and analyzed the bisection method for finding
approximate roots of algebraic equations. We have shown that the method is
effective and accurate for a wide range of equations and initial guesses, and
that it converges to the root within a reasonable number of iterations. Overall,
the bisection method is a powerful and versatile tool for finding approximate
roots of algebraic equations, and this microproject has provided a solid
foundation for future research and applications of the method in the field of
Applied Mathematics.

References –
1) https://www.cantorsparadise.com/some-root-finding-algorithms-5c6fa8a4a165

2) https://www.researchgate.net/publication/306558591_The_Approximate_Calculation
_of_the_Roots_of_Algebraic_Equation_Through_Monte_Carlo_Method

3) http://web.math.ucsb.edu/~padraic/mathcamp_2013/root_find_alg/Mathcamp_2013
_Root-Finding_Algorithms_Day_1.pdf

Skill Developed/Learning out of this Microproject

First and foremost, we learnt to work in a group, share information. Even though
we had a lot of fun, we could learn a great deal from the micro project, than we
would have from the classroom learning. We learnt how to work as a team, and
how to do brain storming. We have learnt how to get the information we need.
Action Plan: -
Plan
Plan End Name Of Team
Sr No Detail Of Activities Start
Date Members
Date
Group formed according to roll no
Harsh Nandgaonkar
& group leaders were elected also
1 Het Panchal
detailed information on micro
Aayush Parab
project was given

Mayuresh
Finalization of microproject as
Nirbhavane
2 well as detailed discussion
Ozas Patel
regarding topic
Aayush Parab

Planning of micro-project
regarding, resources, software Harsh Nandgaonkar
3 used, submission date and Ozas Patel
completing part a plan of micro – Het Panchal
project

Mayuresh Nirbhavane
Complete analysis of design part of Het Panchal
micro-project & distribution of Aayush Parab
4
module among group members

Harsh Nandgaonkar
5 Getting it finalized by the guide Mayuresh
Nirbhavane

6 Implementation of Project report Harsh Nandgaonkar

Het Panchal

Presentation of 1st part of micro- Ozas Patel

project Infront of guide by each Mayur
7
group member and Preparing of Het Panchal
part b plan for micro-project

Harsh Nandgaonkar
8
Submission of micro-project Ozas Patel