Scribd
Upload
10 views7 pages

Lec 6 Secant-Method

The document discusses the Secant Method as an alternative to the Newton-Raphson Method, highlighting its advantages in not requiring the derivative for approximations. It outlines the algorithm for the Secant Method and provides examples and homework problems related to finding roots and maxima. Additionally, it compares the Secant Method with the False Position Method, noting differences in initial guesses and convergence behavior.

Uploaded by

lilpep534
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
10 views7 pages

Lec 6 Secant-Method

The document discusses the Secant Method as an alternative to the Newton-Raphson Method, highlighting its advantages in not requiring the derivative for approximations. It outlines the algorithm for the Secant Method and provides examples and homework problems related to finding roots and maxima. Additionally, it compares the Secant Method with the False Position Method, noting differences in initial guesses and convergence behavior.

Uploaded by

lilpep534
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
You are on page 1/ 7

Secant Method Graphically

Newton-Raphson Method is Interpretation


an extremely powerful
technique but it has a major
weakness: the need to know 𝑦 = 𝑓 (𝑥 )
value of the derivative of at
each approximation.
Frequently, is far more
difficult and needs more ( 𝑥0 , 𝑓 ( 𝑥0) )
arithmetic operations to ( 𝑥1 , 𝑓 ( 𝑥1))
calculate than . Therefore we
introduce a slight variation.
𝑥 3 𝑥 2 𝑥1 𝑥 0

𝑟𝑜𝑜𝑡
Derivation of Formula
By definition

Let be close to then

Substituting value of in Newton Raphson’s Formula


Generalizing

Algorithm
1. If initial guess is and then compute next approximation to the
root by

2. If , repeat step 1 on and .


3. If then is root of the equation.
Example

Use the Secant method to estimate the root of

where and
Solution

H. W
1. Given . Use Secant method to determine the maximum of this function
with initial guess 1. Assuming that convergence is not an issue, approximate
the point of maxima until the .

2. Compute four iterations for the function , using the secant method, in
which the real roots of the equation lies in the interval [0, 1]. Also calculate
%age error in your answer.

3. Compute the root of the equation in the interval [0, 2] using the secant
method. The root should be correct to three decimal places.
Difference between False Position
and Secant Method
Secant Method False Position Method

 Initial guesses may or  Initial guesses must


may not bracket the bracket the root.
root.  Latest estimate of the
 Latest estimate replaces root replaces whichever
values in strict order, i.e, of the original values
replaces and replaces . yielded a function value
with the same sign.
 It may diverge as  It is always convergent
estimates at each
as two estimates at each
iteration may not
iteration bracket the
bracket the root.
root.

You might also like