Professional Documents
Culture Documents
SECA
NT
MET
Submitted by:
HOD
APRILLE CEDRIC A. VARGAS
Submitted to:
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)
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
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