NUMERICAL METHODS AND ANALYSIS REVIEWER
Bracketing Method- method used in Theorem. It begins with an interval [a,b]
numerical analysis in determining or where the function values f(a) and f(b) have
finding the root of a continuous opposite signs. It then calculates the
function. Its core idea is to bracket midpoint of the interval, c=(a+b)/2. The new
or enclose a root within an interval interval is then chosen to be either [a,c] or
and then systematically shrink that [c,b], depending on which sub-interval
interval until converges on the roots’ maintains the sign change. This process is
location. repeated until the interval is sufficiently
The types of bracketing method small. The new guess for the root is always
include bisection and false position the midpoint of the current interval.
method.
This method has a linear convergence rate.
The foundational mathematical
This means that with each iteration, the
principle behind this method is the
error is reduced by a constant factor,
Intermediate Value Theorem (IVT).
specifically by half. The number of
This theorem states that if a
iterations, n, required to achieve a desired
continuous function has values of
tolerance, ϵ, from an initial interval of
opposite signs at the endpoint of an
length L can be calculated beforehand:
interval, then there exists at least
one root within that interval. x L −x u
x r=
This method is used when analytical 2
solutions are not enough to solve a While it is guaranteed to converge, the
specific function, specifically non- bisection method is often considered slow,
linear functions. especially when compared to other
methods. Its simplicity is its main
advantage.
TWO TYPES OF BRACKETING METHOD FALSE POSITION METHOD: Also known as
The Bisection Method and False Position the Regula Falsi method, this is an
Method are numerical techniques to find improvement on the bisection method. Like
the roots of a function. Both methods rely bisection, it starts with an interval [a,b]
on narrowing down an interval where the where f(a) and f(b) have opposite signs.
root lies, but they differ in their approach Instead of simply halving the interval, it uses
and efficiency. linear interpolation to find a more
intelligent guess for the root. It draws a
BISECTION METHOD: The bisection method
straight line (a secant line) between the
is the simpler of the two. It operates on the
points (a,f(a)) and (b,f(b)). The new guess
principle of the Intermediate Value
for the root, c, is the point where this line
intersects the x-axis. The formula for this
new guess is:
In science and engineering, both the
This method generally converges faster than bisection method and false position
the bisection method. Its convergence rate method are used to solve equations when
is considered superlinear, meaning it is analytical solutions are not available.
faster than linear but not as fast as
Field Equation Method Benefit
quadratic. This is because it takes into
Example Used
account the magnitude of the function
values. If one endpoint is much closer to the Physics E = 21mv2 + Bisection Accurate
root (i.e., its function value is much closer to mgh approximation
zero), the linear interpolation will produce a of equilibrium
new guess that is much closer to that end, points
leading to a faster approach to the root.
Chemical k = Ae − RTEa False Faster
Engineering Position determination
Tolerance value - this is the value being set of reaction
as the stopping criteria for the rates
Civil x2 − 9 = 0 Bisection Reliable root
Engineering finding in
structural
analysis
For instance, in physics, the bisection
method can find the energy required for a
system to be at equilibrium by solving for
the root ofE = 21mv2 + mgh. In chemical
engineering, the false position method can
rapidly calculate reaction rates
usingk = Ae − RTEafor efficient process
design. These methods improve efficiency
and accuracy in solving complex problems.
