Professional Documents
Culture Documents
Secant
Secant
T HOD
UEZ LINARES
M E
JUAN ROBERTO VELÁZQ
SECANT
NEDA
LUIS FABIAN IBAÑEZ PI
NCIA LEURETTE
PABLO SALVADOR VALE
Z
REBECA GARCÍA MÉNDE
NEZ REYES
SAMUEL FABIAN MARTÍ
FONSECA
TEACHER:PIERO RANGEL
DATE: 21/09/2020
DEFINITION
THE SECANT METHOD IS A ROOT-FINDING ALGORITHM THAT USES A SUCCESSION OF ROOTS OF SECANT
LINES TO BETTER APPROXIMATE A ROOT OF A FUNCTION F. HE SECANT METHOD CAN BE THOUGHT OF AS A
FINITE-DIFFERENCE APPROXIMATION OF NEWTON'S METHOD. THE METHOD WAS DEVELOPED
INDEPENDENTLY OF NEWTON'S METHOD AND PREDATES IT BY OVER 3000 YEARS
DIFFERENCES BETWEEN NEWTON-RAPHSON METHOD
AND SECANT METHOD
• IT IS A VARIATION OF THE NEWTON-RAPHSON METHOD WHERE INSTEAD OF CALCULATING THE DERIVATIVE OF THE FUNCTION AT THE
STUDY POINT, KEEPING IN MIND THE DEFINITION OF DERIVATIVE, THE SLOPE OF THE LINE IS APPROXIMATED BY A FUNCTION AT THE
STUDY POINT AND AT THE POINT OF THE PREVIOUS ITERATION.
• THE SECANT METHOD CAN BE THOUGHT OF AS A SIMPLIFICATION OF THE NEWTON-RAPHSON METHOD. INSTEAD OF TAKING THE
DERIVATIVE OF THE FUNCTION WHOSE ROOT WE WANT TO FIND, IT IS APPROXIMATED BY A LINE SECANT TO THE CURVE, WHOSE
SLOPE IS APPROXIMATELY EQUAL TO THE DERIVATIVE IN THE STARTING POINT.
• THIS METHOD IS OF SPECIAL INTEREST WHEN THE COMPUTATIONAL COST OF DERIVING THE STUDY FUNCTION AND EVALUATING IT
IS TOO HIGH, SO THAT NEWTON'S METHOD IS NOT ATTRACTIVE.
• IT CONVERGES AT FASTER THAN A LINEAR RATE, SO THAT IT IS MORE RAPIDLY CONVERGENT THAN THE
BISECTION METHOD.
• IT DOES NOT REQUIRE USE OF THE DERIVATIVE OF THE FUNCTION, SOMETHING THAT IS NOT AVAILABLE IN
A NUMBER OF APPLICATIONS.
• IT REQUIRES ONLY ONE FUNCTION EVALUATION PER ITERATION, AS COMPARED WITH NEWTON’S METHOD
WHICH REQUIRES TWO.
DISADVANTAGES OF SECANT METHOD
2
𝑓 ( 7)= ( 7 ) − 3 (7 ) − 4=24 ∴ 𝑓 𝑎 =24
2
𝑓 ( 5)= ( 5 ) − 3 ( 5 ) − 4=6 ∴ 𝑓 𝑏=6
𝑋 2= ( 7 ) −
( 24 ) ( 5− 7 )
( 6 ) − ( 24 )
= 4.33
FIRST
ITERATION
( 4.33 −7)
𝐸𝑟= ∗100=− 61.66 %
4.33
𝑎=𝑐𝑢𝑟𝑟𝑒𝑛𝑡
𝑝𝑜𝑖𝑛𝑡 𝑋 2=𝑎𝑝𝑝𝑟𝑜𝑎𝑐h 𝑓 (𝑎) (𝑏 − 𝑎) 𝑋 2 −𝑎
𝑏=
𝑝𝑟𝑒𝑣𝑖𝑜𝑢𝑠 𝑝𝑜𝑖𝑛𝑡 𝑖=𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛
𝑋 2= 𝑎 − 𝐸𝑟= ∗100
𝑓 (𝑏) − 𝑓 (𝑎 ) 𝑋2
𝑓 (𝑥) = 𝑥2 −3 𝑥 − 4 (7,5)
i a b Er
So:
1 7 5 24 6 4.33 -61.66%
i a b Er
2
𝑓 (4.33) =( 4.33 ) − 3 ( 4.33 ) − 4=1.76 2 4.33 7 1.76 24 4.12 -5.097%
Second
( 1.76 ) ( 7 −4.33 )
𝑋 2= ( 4.33 ) − =4.12
( 24 ) − ( 1.76 )
( 4.12− 4.33)
ITERATION
𝐸𝑟= ∗ 100=− 5.097 %
4.12
𝑎=𝑐𝑢𝑟𝑟𝑒𝑛𝑡
𝑝𝑜𝑖𝑛𝑡 𝑋 2=𝑎𝑝𝑝𝑟𝑜𝑎𝑐h 𝑓 (𝑎) (𝑏 − 𝑎) 𝑋 2 −𝑎
𝑏=
𝑝𝑟𝑒𝑣𝑖𝑜𝑢𝑠 𝑝𝑜𝑖𝑛𝑡 𝑖=𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑜𝑛
𝑋 2= 𝑎 − 𝐸𝑟= ∗100
𝑓 (𝑏) − 𝑓 (𝑎 ) 𝑋2
𝑓 (𝑥) = 𝑥2 −3 𝑥 − 4 (7,5)
i a b Er
So: 2 4.33 7 1.76 24 4.12 -5.097%
i a b Er
𝑓 ( 4.12) = ( 4.12 )
2
− 3 ( 4.12 ) − 4=0.61 3 4.12 4.33 0.61 1.76 4.00 -3%
𝑋 2= ( 4.12 ) −
( 0.61 )( 4.33 −4.12 )
( 1.76 ) − ( 0.61 )
=4 Third ITERATION
( 4.00 −4.12)
𝐸𝑟= ∗ 100=− 3 % When X is equal 4, Y will be
4.00
𝑓 2
(4 )=(4) − 3 ( 4 ) − 4=0 0. So the result is 4 with a
relative error from -3%
REFERENCE
• ALLEN, MYRON B.; ISAACSON, ELI L. (1998). NUMERICAL ANALYSIS FOR APPLIED SCIENCE. JOHN WILEY &
SONS. PP. 188–195.
• UNIVERSITY OF IOWA. (N.D.). THE SECANT METHOD. THE SECANT METHOD. RETRIEVED SEPTEMBER 19,
2020, FROM HTTP://HOMEPAGE.MATH.UIOWA.EDU/~WHAN/3800.D/S3-3.PDF
• SECANT METHOD - NUMERIC METHOD. (N.D.). SECANT METHOD - NUMERIC METHOD. RETRIEVED
SEPTEMBER 19, 2020, FROM HTTPS://SITES.GOOGLE.COM/A/NUMERICMETHOD.COM/WWW/ABOUT-
NUMERICAL-METHODS/ROOTS-OF-EQUATIONS/SECANT-METHOD