0% found this document useful (0 votes)
5 views12 pages

Root Finding Methods in Numerical Analysis

This document discusses numerical methods for finding roots of equations, including the Bisection Method, Newton's Method, and the Secant Method. It outlines the criteria for terminating iterations and provides procedures and examples for each method. The document emphasizes the importance of initial approximations and convergence criteria in root-finding algorithms.

Uploaded by

tesfahun
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views12 pages

Root Finding Methods in Numerical Analysis

This document discusses numerical methods for finding roots of equations, including the Bisection Method, Newton's Method, and the Secant Method. It outlines the criteria for terminating iterations and provides procedures and examples for each method. The document emphasizes the importance of initial approximations and convergence criteria in root-finding algorithms.

Uploaded by

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

NUMERICAL METHODS

(MEng3073)
CHAPTER TWO

ROOT OF EQUATIONBy: Tesfahun


Meshesha
Learning Objectives:
• Introduction

• Bisection Method

• Secant Method

• Newton Method
2.1. Introduction
• Students should be familiar with from ordinary algebra is finding the root
of an equation , (the value of the argument that makes f zero).
• More precisely, if the function is defined as y = f(x), we seek the value α
such that.

• A polynomial of degree n has exactly n roots, real or complex, simple or


multiple, whereas a transcendental equation may have one root, infinite
root, or no root.

• Given one or two initial approximation to the root we require suitable


iteration for , such that the sequence of iterates converges to exact root.
Cont . . .
Criteria’s to terminate iteration procedures:
• Since we cannot perform infinite number of iterations, we need a criterion to stop the
iteration.

• Use either one or two of the following criterion:


i. The equation is satisfied to a given accuracy or error bound .

ii. The magnitude of the difference between two successive iterates is smaller than a given Precision

• Generally we will discuss the basic methods for finding the point , bisection method,
Newton’s method, and Secant methods.
2.2. Bisection Method
• Bisection is a root finding method with the approach of bisecting the intervals to
approximate the real root.

• Suppose we have intervals a and b, know that f(a)f(b) < 0. This means that f is
negative at one point and positive at the other.

• If we assume that f is continuous, then from Intermediate Value Theorem it


follows that there must be some value between a and b at which f is zero.

• Now let's try to use these ideas to find. Let c be the midpoint of the interval [a,
b]
Procedure for Bisection method:
1. Choose as the lower and as the upper guesses for the root. Such that the
function changes sign over the interval. This can be done by evaluating the at
a and b or by plotting the graph of the function.
2. Estimate the root c from equation 2.2.1, and find
3. Use the following evaluations to determine the next interval where the root lies
i. If f(a) f(c) > 0 ; hence the root is between c and b, i.e., [c, b].

ii. If f(a) f(c) < 0 ; hence the real root lies between a and c, i.e., [a, c].
iii. If f(c) = 0 ; if we assume that we already know , this means that , if this
is the condition, we have found a root and terminate the solution
y 𝜶= 𝑪 𝟓
f(b) f(x)

f(c1)

f(c3)
a c2 c4 c5 c3 c1 b x
f(c4)

f(c2)

1
𝐶 5 = ( 𝐶 4 +𝐶 3 )
f(a) 1 2
𝐶 4 = (𝐶 2 +𝐶 3 )
2
1
𝐶 3 = (𝐶 2+ 𝐶 1)
2
1
𝐶 2 = (𝑎+ 𝐶1 )
2
1
𝐶 1= ( 𝑎+ 𝑏 )
2

Example 2.2.1: If, and we take the original interval to be [a, b] = [0, 1]. Find
the most approximate solution with absolute percent error less than
2.3. Newton’s Method
• It is the classic algorithm for finding roots of functions. It is often introduced in
the calculus sequence as an application of the derivative of a function.

•There are two good derivations of Newton's method, geometric and analytic.
•Here the geometric derivation is discussed.
• Consider the figure, We wish to find a
root of, given an "initial guess"
of.
• The fundamental idea in Newton's method
is to use the tangent line approximation to
the function f at point .
Cont . . .
• The tangent line to the graph of the function at (), is defined as straight line determined by
the limit position of the secant line as the point), tends to) along the graph
• If α is the angle between the x-axis and the tangent line, then is the slope of the tangent
line to the curve at point.
• Then the point-slope formula for the equation of the straight line gives us

•From equation (2.3.1) we have; Example 2.3.1. Use Newton


Raphson method to find
•Recall; therefore we have a straight line with equation approximate root ofUse initial
guess of1. Conduct the iteration
• To find where this crosses the axis, we set y = 0 and solve for x until the approximate percent
error drops below 0.1%.
2.4. Secant Method
• The general formula to find estimate of the root of a function in secant method is derived by
using equation of straight line. Equation of straight line is given by;

• Consider the figure; and the slope m is given by;

• Y – intercept Z can be obtained as

• Substituting eq (2.4.2) and (2.4.3) into (2.4.1)


Cont . . .
•Since we are looking for the value which makes the function equals to zero,
set.

•Thus equation (2.4.7) is the used to find the next approximate root in secant
method;

Example 2.6.1:
Determine the real root of using secant method to locate the root. Employ initial guesses of and
Iterate until the absolute percent error fall below 0.5%
Thank

You might also like