Scribd
Upload
31 views5 pages

Seca NT MET HOD

The document discusses the secant method, which is an iterative root-finding algorithm that approximates the function as linear between successive points. It assumes the function is approximately linear in the region of interest. Each new estimate is taken as the point where the approximating line crosses the x-axis. An example is provided to demonstrate the secant method applied to finding the root of the function f(x)=e-x-x. The iterations show the successive estimates converging to the true root of 0.567 after three iterations.

Uploaded by

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

Seca NT MET HOD

The document discusses the secant method, which is an iterative root-finding algorithm that approximates the function as linear between successive points. It assumes the function is approximately linear in the region of interest. Each new estimate is taken as the point where the approximating line crosses the x-axis. An example is provided to demonstrate the secant method applied to finding the root of the function f(x)=e-x-x. The iterations show the successive estimates converging to the true root of 0.567 after three iterations.

Uploaded by

Cedric Vargas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Republic of the Philippines

ISABELA STATES UNIVERSITY


(Ilagan Campus)
COLLEGE OF ENGINEERING, ARCHITECTURE AND TECHNOLOGY

SECA
NT
MET
Submitted by:
HOD
APRILLE CEDRIC A. VARGAS

Submitted to:

ENGR. JOSELITO BUGAYONG


SECANT METHOD
A potential problem in implementing the Newton-Rapson method is the
evaluation of the derivative. Although this is not inconvenient for polynomials and
many other functions, there are certain functions whose derivatives may be
extremely difficult or inconvenient to evaluate. For these cases, the derivative can
be approximated by a backward finite divided difference

Graphical depiction of the secant method

f(x)

f(xi)

f(xi -1)
1)

xi - 1 xi x

f ( x ¿¿ i)
f ' (x ¿¿i)≅ f ( x ¿¿ i−1)− ¿¿¿
(x ¿¿ i−1)−(x i )¿
SECANT METHOD THEORY
A root-finding algorithm which assumes as function to be approximately linear in
the region of interest. Each improvement is taken as the point where the
approximating line crosses the axis. The secant method retains only the most
recent estimate, so the root does not necessarily remain bracketed. The secant
method is implemented in the Wolfram Language as the undocumented option
method.

FORMULA
( X ¿¿ 1)( X 0−X 1)
X i +1 = X i - f ¿
f ( X 0 )−f ( X 1)

X i+1new − X i+1old
¿ Ea ∨¿= x 100
X i +1new

CONDITION
In the 2nd iteration and to the ff. iteration
X 0=X 1

X 1 =X i+1
Example.
f ( X )=e− X −X ; X 0=0 ; X 1 =1; (3 decimal places)

Recall that the true root = 0.567


iteration X0 X1 f ( X0) f (X 1 ) X i +1
1st 0 1 1 -0.632 0.613
2nd 1 0.613 -0.632 -0.071 0.564
3rd 0.613 0.564 -0.071 0.005 0.567

1st iteration f ( X 1 )=¿ e−0.613−0.613

X 0= 0 f ( X 1 )=¿ -0.071

X 1= 1 (−0.071)(1−0.613)
X i +1=¿ 0.613 -
−0.632−(−0.071)
f ( X 0 )=e−0−0
X i +1=¿0.564
f ( X 0 )=1

f ( X 1 )=¿ e−1−1
3rd iteration
f ( X 1 )=¿ -0.632
X 0= 0.613
(−0.632)(0−1)
X i +1=¿ 1 -
1−(−0.632) X 1 = 0.564

X i +1=¿0.613 f ( X 0 )=e−0.613−0.613

f ( X 0 )=−0.071

2nd iteration f ( X 1 )=¿ e−0.564−0.564

X 0= 1 f ( X 1 )=¿ 0.005

X 1 = 0.613 (0.005)(0.613−0.564)
X i +1=¿ 0.564 -
−0.071−0.005
f ( X 0 )=e−1−1
X i +1=¿0.56
f ( X 0 )=−0.632

You might also like