2. INTRODUCTION
In this method roots are found using an algorithm,
that uses succession of root of secant to better
approximate a root of a function. This method can
thought of as finite difference of Newton’s Method
OVERVIEW
“To find the roots of non linear
equation with the help of secant
lines”
3. METHODOLOGY
A secant is defined by using two points on graph of a function f(x). It is
necessary to choose these initial points as xi
and xi-1
. Then next point xi-1
is obtained by computing x-value at which the secant line passing
through the points (xi
, f(xi
)) and (xi+1
, f(xi+1
)) has a y-coordinate of zero.
4. SECANT METHOD
(Derivation)
The secant method can also be derived from geometry :
The Geometric Similar Triangles:
AB/AE = DC/DE
can be written as:
f(xi
) / (xi
- xi+1
) = f(xi-1
) / (xi-1
- xi+1
)
On rearranging, the secant method is
given as:
xi+1
= xi
- (f(xi
)(xi
- xi-1
) / f(xi
) -f(xi-1
))
5. ALGORITHM
Step 1: Find points x0
and x1
such that x0
<x1
and
f(x0
).f(x1
) < 0.
Step 2: find next value using formulae
➔ x2
= x0
- f(x0
).(x1
-x0
) / { f(x1
)-f(x0
) }
➔ x2
= { x0
.f(x1
)- x1
-f(x0
) } / { f(x1
)-f(x0
) }
➔ x2
= x1
- f(x1
). (x1
- x0
) / { f(x1
) - f(x0
) }
(Using any of the formulae, you will get same x2
value)
Step 3: If f(x2
) = 0 then x2
is an exact root, else x0
= x1
and x1
= x2
Step 4: Repeat steps 2 & 3 until f(xi
)=0 or |f(xi
)| ≤ Accuracy
6. EXAMPLE
Find a root of an equation f(x) = x3
- x - 1 using secant
method
Solution:
Here x3
- x - 1 = 0
Let f(x) = x3
- x - 1
Here:
x 0 1 2
f(x) -1 -1 5
13. APPLICATIONS
Secant method is one of the analytical procedure available to
earthquake engineers for predicting earthquake and structures
Secant method is used to develop linear dynamic analysis
model to have the potential to influence the behaviour of the
structure in non-linear range.
It is used for nonlinear pushover analysis, which defines the
force-displacement relationship of the walls in the building
under lateral load.
14. ADVANTAGES
It converges faster than a linear rate so it is more rapidly
convergent.
Requires two guesses that do not need to bracket the root.
It doesn't require use of derivative of a given function because
in some practical cases, derivatives become very hard to find.
It requires only one function evaluation per iteration as
compared to Newton’s method which requires two