Numerical Method1

Bisection Method Algorithm
Bisection Method is one of the basic numerical solutions for finding the root of a
polynomial equation. It brackets the interval in which the root of the equation lies
and subdivides them into halves in each iteration until it finds the root. Thus, the
bisection method is also called the bracketing method. It works by repeatedly
dividing an interval that contains the root into two subintervals, and then selecting
the subinterval that has a sign change. The algorithm stops when the length of the
subinterval is less than a given tolerance or when the function value at the midpoint
is zero.
However, as the working mechanism is similar to the binary search algorithm, the
bisection method is also known as binary search method, halving method. It is
primarily based on the Intermediate value theorem.
➢ Bisection Method Algorithm
Follow the below procedure to get the solution for the

continuous function:
1. Start
2. Define function f(x)
3. Choose initial guesses x0 and x1 such that
f(x0) and f(x1) have opposite sign
4. Calculate new approximated root as
x2 = (x0 + x1)/2
5. Calculate f(x2)
a. if f(x2) < 0 then x0 = x0 and x1 = x2 goto (5)
b. if f(x2) > 0 then x0 = x2 and x1 = x1 goto (5)
c. if f(x2) = 0 then goto (7)
6. Display x2 as root.
7. Stop
The bisection method is an approximation method to find the roots of the given
equation by repeatedly dividing the interval. This method will divide the interval
until the resulting interval is found, which is extremely small.
➢ Bisection Method Example
We have to find the root of the following continuous function using the bisection
method formula.
x2-3 = 0
Solution:
Given: x2-3 = 0
Let f(x) = x2-3
Now, find the value of f(x) at a= 1 and b=2.
f(x=1) = 12-3 = 1 – 3 = -2 < 0
f(x=2) = 22-3 = 4 – 3 = 1 > 0
The given function is continuous, and the
root lies in the interval [1, 2].
Let “t” be the midpoint of the interval.
I.e., t = (1+2)/2
t =3 / 2
t = 1.5
Therefore, the value of the function at “t” is
f(t) = f(1.5) = (1.5)2-3 = 2.25 – 3 = -0.75 < 0
If f(t)<0, assume a = t.
and
If f(t)>0, assume b = t.
f(t) is negative, so a is replaced with t = 1.5 for the next iterations.
The iterations for the given functions are:
So, after the seventh iteration, we get the final interval [1.7266, 1.7344]
Hence, 1.7344 is the approximated solution.
➢ Applications of Bisection Method:
The Bisection Method has several applications across various fields, including:
▪ Root Finding: One of the primary applications of the Bisection Method is in
finding the roots of equations, both polynomial and transcendental. This is
useful in numerous scientific and engineering problems where determining
the values of unknown variables is essential.
▪ Optimization: The Bisection Method can be employed in optimization
problems where finding the roots of the derivative function is necessary. This
is particularly useful in maximizing or minimizing functions, such as in financial
modeling or engineering design.
▪ Numerical Analysis: The Bisection Method serves as a fundamental building
block in more complex numerical algorithms, such as the Newton-Raphson
method and the Secant method. These methods often rely on root-finding as
a key step in solving various mathematical problems.
▪ Engineering: In engineering disciplines, the Bisection Method can be used for
tasks such as determining stability conditions in control systems, analyzing
stress distributions in mechanical structures, or finding the equilibrium states
of physical systems.
▪ Financial Modeling: Bisection Method can be applied in financial modeling to
determine interest rates, bond prices, or investment returns. It is particularly
useful in scenarios where complex financial equations need to be solved
iteratively.
▪ Physics: In physics, the Bisection Method can help in solving differential
equations that model physical phenomena, such as heat transfer, fluid
dynamics, or quantum mechanics. It is also used in simulations and numerical
experiments.
▪ Economics: In economic modeling and analysis, the Bisection Method can be
utilized to solve equations representing supply and demand curves,
equilibrium prices, or optimal resource allocation problems.
Overall, the Bisection Method finds applications in a wide range of disciplines due to
its simplicity, reliability, and effectiveness in approximating solutions to root-finding
problems.
Advantages of Bisection Method
• Guaranteed convergence. 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.
• Doesn't demand complicated calculations. There are no complicated
calculations required when using the bisection method. To use the bisection
method, we only need to take the average of two values.
• Error bound is guaranteed. There is a guaranteed error bound in this
technique, and it reduces with each repetition. Each cycle reduces the error
bound by 12 per cent.
• The bisection method is simple and straightforward to programme on a
computer.
• In the case of several roots, the bisection procedure is quick.
Disadvantages of Bisection Method
• Although the Bisection method's convergence is guaranteed, it is often slow.

• Choosing a guess that is close to the root may necessitate numerous iterations
to converge.
• Some equations' roots cannot be found. Because there are no bracketing
values, like f(x) = x².
• Its rate of convergence is linear.
• It is incapable of determining complex roots.
• If the guess interval contains discontinuities, it cannot be used.
• It cannot be applied over an interval where the function returns values of the
same sign.
CONCLUSION
In conclusion, the Bisection Method Algorithm emerges as a versatile and powerful
tool for root-finding in continuous functions. Throughout this report, we have delved
into its principles, implementation, advantages, and limitations. We have also
highlighted its wide-ranging applications across diverse fields, underscoring its
importance in numerical analysis and problem-solving. Despite its simplicity, the
Bisection Method continues to be a cornerstone in computational mathematics,
offering a reliable approach to approximating solutions to root-finding problems. By
understanding its principles and nuances, practitioners can effectively utilize the
Bisection Method to address a myriad of mathematical challenges in real-world
scenarios.
REFERENCE
• Bisection Method – What is, Algorithm, and Example (guru99.com)
• Bisection method – Wikipedia
• Bisection Method - Definition, Procedure, and Example (byjus.com)
• Bisection Method Algorithm (Step Wise) (codesansar.com)

Numerical Method1

Uploaded by

Copyright:

Available Formats

Numerical Method1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Numerical Method1

Uploaded by

Copyright:

Available Formats

Bisection Method Algorithm

Follow the below procedure to get the solution for the

The iterations for the given functions are:

• Guaranteed convergence. The bracketing approach is known as the bisection

Disadvantages of Bisection Method

• Although the Bisection method's convergence is guaranteed, it is often slow.

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.