Chapter Two: Root of Equation
2.1 Introduction
Root finding methods can be classified into (a) Bracketing methods, (b) Open methods
and (c) Root of polynomials. Open methods differ from bracketing methods; in that
open methods require only a single starting value or two starting values that do not
necessarily bracket a root. Open methods may diverge as the computation progresses,
but when they do converge, they usually do so much faster than bracketing methods
(a) Bracketing methods: the bracketing methods we are going to study are:
1. Bisection Method
2. False position method
3. Graphical method (reading assignment’s)
(b) Open Methods: The open methods we are going to study are:
1. Newton-Raphson Method
2. Secant Method
3. Simple Fixed point Iteration (reading assignment’s)
(c) Roots of Polynomials
1. Muller’s Method
2. Conventional Method (reading assignment’s)
(a) Bracketing methods: Some of the known bracketing methods are Bisection method,
Regula Falsi method (or False Position)
1. Bisection methods: Bisection method is based on the fact that if f(x) is real and
continuous function, and for two initial guesses x0 and x1 brackets the root such
that: f(x0)f(x1) < 0 then there exists at least one root between x0 and x1.
Bisection Method Algorithm (Step Wise)
1. Start
2. Define function f(x)
3. Choose initial guesses x0 and x1 such that f(x0)f(x1) < 0
3. Choose pre-specified tolerable error e.
4. Calculate new approximated root as x2 = (x0 + x1)/2
5. Calculate f(x0)f(x2)
a. if f(x0)f(x2) < 0 then x0 = x0 and x1 = x2
b. if f(x0)f(x2) > 0 then x0 = x2 and x1 = x1
c. if f(x0)f(x2) = 0 then go to (8)
7. If |f(x2)| > e then go to (5) otherwise go to (8)
8. Display x2 as root.
9. Stop, if the following given case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Define function f (xi) leas than tolerance error or true relative error.
o Up to the given of approximate relative error.
o Up to the given of iteration numbers.
Example-1 Find a root of an equation f(x) =x3-x-1 using Bisection method at f (xr)
=-0.00006.
Solution:
f(x)=x3-x-1
X 0 1 2
f(x) -1 -1 5
1st iteration:
f(1)=-1<0 and f(2)=5>0
Now, Root lies between 1 and 2
x0=(1+2)/2=1.5
f(x0)=f(1.5)=0.875>0
|f(1.5)| > e , x0=1.5 not the root of an equation
2nd iteration:
f(1)=-1<0 and f(1.5)=0.875>0
Now, Root lies between 1 and 1.5
x1=(1+1.5)/2=1.25
f(x1)=f(1.25)=-0.29688<0
|f(1.25)| > e , x1=1.25 not the root of an equation
3rd iteration:
Here f(1.25)=-0.29688<0 and f(1.5)=0.875>0
Now, Root lies between 1.25 and 1.5
x2=(1.25+1.5)/2=1.375
f(x2)=f(1.375)=0.22461>0
|f(1.375)| > e , x2=1.375 not the root of an equation
4th iteration:
f(1.25)=-0.29688<0 and f(1.375)=0.22461>0
Now, Root lies between 1.25 and 1.375
x3=(1.25+1.375)/2=1.3125
f(x3)=f(1.3125)=-0.05151<0
|f(1.3125)| > e , x3=1.3125 not the root of an equation
5th iteration:
Here f(1.3125)=-0.05151<0 and f(1.375)=0.22461>0
Now, Root lies between 1.3125 and 1.375
x4=(1.3125+1.375)/2=1.34375
f(x4)=f(1.34375)=0.08261>0
|f(1.34375)| > e , x4=1.34375 not the root of an equation
6th iteration:
Here f(1.3125)=-0.05151<0 and f(1.34375)=0.08261>0
Now, Root lies between 1.3125 and 1.34375
x5=(1.3125+1.34375)/2=1.32812
f(x5)=f(1.32812)=0.01458>0
|f(1.32812)| > e , x2=1.32812 not the root of an equation
7th iteration:
Here f(1.3125)=-0.05151<0 and f(1.32812)=0.01458>0
Now, Root lies between 1.3125 and 1.32812
x6=(1.3125+1.32812)/2=1.32031
f(x6)=f(1.32031)=-0.01871<0
|f(1.32031)| > e , x2=1.32031 not the root of an equation
8th iteration:
Here f(1.32031)=-0.01871<0 and f(1.32812)=0.01458>0
Now, Root lies between 1.32031 and 1.32812
x7=(1.32031+1.32812)/2=1.32422
f(x7)=f(1.32422)=-0.00213<0
|f(1.32422)| > e , x2=1.32422 not the root of an equation
9th iteration:
Here f(1.32422)=-0.00213<0 and f(1.32812)=0.01458>0
Now, Root lies between 1.32422 and 1.32812
x8=(1.32422+1.32812)/2=1.32617
f(x8)=f(1.32617)=0.00621>0
|f(1.32617)| > e , x2=1.32617 not the root of an equation
10th iteration:
Here f(1.32422)=-0.00213<0 and f(1.32617)=0.00621>0
Now, Root lies between 1.32422 and 1.32617
x9=(1.32422+1.32617)/2=1.3252
f(x9)=f(1.3252)=0.00204>0
|f(1.3252)| > e , x2=1.3252 not the root of an equation
11th iteration:
Here f(1.32422)=-0.00213<0 and f(1.3252)=0.00204>0
Now, Root lies between 1.32422 and 1.3252
x10=(1.32422+1.3252)/2=1.32471
f(x10)=f(1.32471)=-0.00005<0
|f(1.32471)| > e , x2=1.32471 is the root of an equation
2.False position method: Regula Falsi is based on the fact that if f(x) is real and
continuous function, and for two initial guesses x0 and x1 brackets the root such
that: f(x0)f(x1) < 0 then there exists at least one root between x0 and x1.
Algorithm for False Position Method
1. Start
2. Define function f(x)
3. Choose initial guesses x0 and x1 such that f(x0)f(x1) < 0
4. Choose pre-specified tolerable error e.
5. Calculate new approximated root as: x2 = (x0*f(x1)-x1 * f(x0))/(f(x1) - f(x0))
6. Calculate f(x0)f(x2)
a. if f(x0)f(x2) < 0 then x0 = x0 and x1 = x2
b. if f(x0)f(x2) > 0 then x0 = x2 and x1 = x1
c. if f(x0)f(x2) = 0 then go to (8)
7. if |f(x2)|>e then go to (5) otherwise go to (8)
8. Display x2 as root.
9. Stop, if the following given case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Define function f (xi) leas than tolerance error or true relative error.
o Up to the given of approximate relative error.
o Up to the given of iteration numbers.
Example-1, find a root of an equation f(x)=x3-x-1 correct up to 4 decimal place using
False Position method at approximate percentage relative error is 0.0083%.
Solution:
f(x)=x3-x-1
X 0 1 2
f(x) -1 -1 5
1st iteration:
f(1)=-1<0 and f(2)=5>0
Now, Root lies between x0=1 and x1=2
x2=x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0)
x2=1.16667
f(x2)=f(1.16667)=-0.5787<0
Er=|(x2-x1)/x2| *100%=|(1.16667-2)/1.16667| *100%=74.43%, x2=1.16667 is not the root
of an equation
2nd iteration:
f(1.16667)=-0.5787<0 and f(2)=5>0
Now, Root lies between x0=1.16667 and x1=2
x3= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x3=1.25311
f(x3)=f(1.25311)=-0.28536<0
Er=|(x3-x2)/x3| *100%=|(1.25311-1.16667)/1.25311| *100%=6.89%, x3=1.25311 is not
the root of an equation
3rd iteration:
Here f(1.25311)=-0.28536<0 and f(2)=5>0
Now, Root lies between x0=1.25311 and x1=2
x4= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x4=1.29344
f(x4)=f(1.29344)=-0.12954<0
Er=|(x4-x3)/x4| *100%=|(1.29344-1.25311)/1.29344|*100%=3.12%, x4=1.29344 is not
the root of an equation
4th iteration:
Here f(1.29344)=-0.12954<0 and f(2)=5>0
Now, Root lies between x0=1.29344 and x1=2
x5= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x5=1.31128
f(x5)=f(1.31128)=-0.05659<0,
Er=|(x5-x4)/x5| *100%=|(1.31128 1.29344)/1.31128|*100%=1.36% , x5=1.31128 is no
the root of an equation
5th iteration:
Here f(1.31128)=-0.05659<0 and f(2)=5>0
Now, Root lies between x0=1.31128 and x1=2
x6= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x6=1.31899
f(x6)=f(1.31899)=-0.0243<0
Er=|(x6-x5)/x6| *100%=|(1.31899-1.31128)/|1.31899 *100%=0.5845%, x6=1.31899 is not
the root of an equation
6th iteration:
Here f(1.31899)=-0.0243<0 and f(2)=5>0
Now, Root lies between x0=1.31899 and x1=2
x7= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x7=1.32228
f(x7)=f(1.32228)=-0.01036<0
Er=|(x7-x6)/x7| *100%=|(1.32228-1.31899)|/1.32228 *100%=0.2488%, x7=1.32228 is not
the root of an equation
7th iteration:
Here f(1.32228)=-0.01036<0 and f(2)=5>0
Now, Root lies between x0=1.32228 and x1=2
x8= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x8=1.32368
f(x8)=f(1.32368)=-0.0044<0
Er=|(x8-x7)/x8|*100%=|(1.32368-1.32228)|/1.32228 *100%=0.1059%, x8=1.32368 is not
the root of an equation
8th iteration:
Here f(1.32368)=-0.0044<0 and f(2)=5>0
Now, Root lies between x0=1.32368 and x1=2
x9= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x9=1.32428
f(x9)=f(1.32428)=-0.00187<0
Er=|(x9-x8)/x9| *100%=|(1.32428-1.32368)|/1.32228 *100%=0.0454%, x9=1.32428 is not
the root of an equation
9th iteration:
Here f(1.32428)=-0.00187<0 and f(2)=5>0
Now, Root lies between x0=1.32428 and x1=2
x10= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x10=1.32453
f(x10)=f(1.32453)=-0.00079<0
Er=|(x10-x9)/x10| *100%=|(1.32453-1.32428)|/1.32453 *100%=0.0189%, x10=1.32453 is
not the root of an equation
10th iteration:
Here f(1.32453)=-0.00079<0 and f(2)=5>0
Now, Root lies between x0=1.32453 and x1=2
x11= x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x11=1.32464
f(x11)=f(1.32464)=-0.00034<0
Er=|(x11-x10)/x11| *100%=|(1.32464-1.32453)|/1.32464*100%=0.0083%, x11=1.32464 is
the root of an equation
(b) Open methods: Open methods differ from bracketing methods, in that open
methods require only a single starting value or two starting values that do not
necessarily bracket a root. Open methods may diverge as the computation progresses,
but when they do converge, they usually do so much faster than bracketing methods.
Open methods are newton raphson method, Secant method and Fixed Point Iteration
method
1. Newton Raphson Method: Newton Raphson Method is an open method and starts
with one initial guess for finding real root of non-linear equations.
Algorithm for Newton Raphson Method
1. Start
2. Define function as f(x)
3. Define first derivative of f(x) as g(x)
4. Input initial guess (x0), tolerable error (e) and maximum iteration (N)
5. Initialize iteration counter i = 1
6. If g(x0) = 0 then print "Mathematical Error” and go to (12) otherwise go to (7)
7. Calculate x1 = x0 - f(x0) / g(x0)
8. Increment iteration counter i = i + 1
9. If i >= N then print "Not Convergent" and go to (12) otherwise go to (10)
10. If |f(x1)| > e then set x0 = x1 and go to (6) otherwise go to (11)
11. Print root as x1
12. Stop, if the following given case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Up to the given of approximate relative error.
o Define function f (xi) leas than tolerance error or true relative error.
o Up to the given of iteration numbers.
The general stopping criteria of the newton raphson method Steps are:
Step-1: Find points a and b such that a<b and f(a)⋅f(b)<0.
Step-2: Take the interval [a,b] and find next value x0=(a+b)/2
Step-3: Find f(x0) and f′(x0), x1=x0-f(x0)/ f’(x0)
Step-4: If f(xi)=0 then xi is an exact root, else x0=xi
Step-5: Repeat steps 3 and 4 until f(xi)=0 or |f(xi)|≤accuracy. If the following given case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Up to the given of approximate relative error.
o Define function f (xi) leas than tolerance error or true relative error.
o Up to the given of iteration numbers.
Example-1, Find a root of an equation f(x)=x3-x-1 using Newton Raphson method, the
approximate relative is 0.036%
Solution:
f(x)=x3-x-1
f’(x)=3x2-1
X 0 1 2
f(x) -1 -1 5
f(1)=-1<0andf(2)=5>0
Root lies between 1 and 2
x0=(1+2)/2=1.5
1st iteration:
f(x0)=f(1.5)=0.875
f’(x0)=f′(1.5)=5.75
x1=x0-f(x0)/f’(x0)
x1=1.5-0.875/5.75
x1=1.34783
Er=|(x1-x0)/x0| *100%=|(1.34783-1.5)|/1.34783*100%=11.29%. x1=1.32453 is not the
root of an equation
2nd iteration:
f(x1)=f(1.34783)=0.10068
f’(x1)=f′(1.34783)=4.44991
x2=x1-f(x1)/f’(x1)
x2=1.34783-0.10068/4.44991
x2=1.3252
Er=|(x2-x1)/x2| *100%=|(1.3252-1.32453)|/1.3252*100%=0.0506%, x2=1.3252 is not the
root of an equation
3rd iteration:
f(x2)=f(1.3252)=0.00206
f’(x2)=f′(1.3252)=4.26847
x3=x2-f(x2)/f’(x2)
x3=1.3252-0.00206/4.26847
x3=1.32472
Er=|(x3-x2)/x3| *100 %=|( 1.32472-1.3252)|/1.32472*100%=0.036%, x3=1.32472 is the
root of an equation
2. Secant Method: Secant Method is open method and starts with two initial guesses
for finding real root of non-linear equations.
Algorithm of Secant Method
1. Start
2. Define function as f(x)
3. Input initial guesses (x0 and x1), tolerable error (e) and maximum iteration (N)
4. Initialize iteration counter i = 1
5. If f(x0) = f(x1) then print "Mathematical Error" and go to (11) otherwise go to (6)
6. Calculate x2 = (f(x1)x0-x1 * f(x0)) / ( f(x1) - f(x0) )
7. Increment iteration counter i = i + 1
8. If i >= N then print "Not Convergent” and go to (11) otherwise go to (9)
9. If |f(x2)| > e then set x0 = x1, x1 = x2 and go to (5) otherwise go to (10)
10. Print root as x2
11. Stop, if the following given case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Up to the given of approximate relative error.
o Define function f (xi) leas than tolerance error or true relative error
o Up to the given of iteration numbers.
Generally the short method to solve the root of equation using Secant method Steps
are:
Step-1: Find points x0 and x1 such that x0<x1 and f(x0)⋅f(x1)<0.
Step-2: find next value using
Formula-1 : x2=(x0*f(x1)-x1*f(x0))/(f(x1)-f(x0)) Using any of the formula, 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 Stop, if the following given
case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Up to the given of approximate relative error.
o Define function f (xi) leas than tolerance error or true relative error.
o Up to the given of iteration numbers.
Example-1 Find a root of an equation f(x)=x3-x-1 using Secant method, the tolerance
error is 0.0007.
Solution:
f(x)=x3-x-1
X 0 1 2
f(x) -1 -1 5
1st iteration:
x0=1 and x1=2
f(x0)=f(1)=-1 and f(x1)=f(2)=5
x2=x0-f(x0)⋅(x1-x0)/(f(x1)-f(x0))
x2=1-(-1)×(2-1)/(5-(-1))
x2=1.16667
f(x2)=f(1.16667)=-0.5787
Er=|(x2-x1)/x2| *100 %=|( 1.16667-2)|/1.3252*100%=71.43%, x2=1.16667 is not the root
of an equation
2nd iteration:
x1=2 and x2=1.16667
f(x1)=f(2)=5 and f(x2)=f(1.16667)=-0.5787
x3=x1-f(x1)⋅(x2-x1)/(f(x2)-f(x1))
x3=2-5×(1.16667-2)/(-0.5787-5)
x3=1.25311
f(x3)=f(1.25311)=-0.28536
Er=|(x3-x2)/x3| *100 %=|( 1.25311-1.16667)|/1.25311*100%=6.898%, x3=1.25311 is not
the root of an equation
3rd iteration:
x2=1.16667 and x3=1.25311
f(x2)=f(1.16667)=-0.5787 and f(x3)=f(1.25311)=-0.28536
x4=x2-f(x2)⋅(x3-x2)/(f(x3)-f(x2))
x4=1.16667-(-0.5787)×(1.25311-1.16667)/(-0.28536-(-0.5787))
x4=1.33721
f(x4)=f(1.33721)=0.05388
Er=|(x4-x3)/x4| *100 %=|( 1.33721-1.25311)|/1.33721*100%=6.289%, x4=1.33721 is not
the root of an equation
4th iteration:
x3=1.25311 and x4=1.33721
f(x3)=f(1.25311)=-0.28536 and f(x4)=f(1.33721)=0.05388
x5=x3-f(x3)⋅(x4-x3)/(f(x4)-f(x3))
x5=1.25311-(-0.28536)×(1.33721-1.25311)/(0.05388-(-0.28536))
x5=1.32385
f(x5)=f(1.32385)=-0.0037
Er=|(x5-x4)/x5| *100%=|(1.32385-1.33721)|/1.32385*100%=1.009%, x5=1.32385 is not
the root of an equation
5th iteration:
x4=1.33721 and x5=1.32385
f(x4)=f(1.33721)=0.05388 and f(x5)=f(1.32385)=-0.0037
x6=x4-f(x4)⋅(x5-x4)/(f(x5)-f(x4))
x6=1.33721-0.05388×(1.32385-1.33721)/(-0.0037-0.05388)
x6=1.32471
f(x6)=f(1.32471)=-0.00004,
Er=|(x6-x5)/x6| *100 %=|(1.32471-1.32385)|/1.32471*100%=0.065%, x6=1.32471 is the
root of an equation, because 0.07%>0.065%
(c) Roots of Polynomials: the roots of polynomials refer to the values of a variable for
which the given polynomial is equal to zero.
1. Muller’s Method
2. Conventional Method (reading assignment’s)
1. Muller’s method: Muller's method is a root-finding algorithm, a numerical method for
solving equations of the form f(x) = 0. It was first presented by David E. Muller in 1956.
Muller's method is based on the secant method, which constructs at every iteration a
line through two points on the graph of f(x).
Algorithm of Secant Method
Step-1: Find points a and b such that x0<x1 and f(x0)⋅f(x1)<0.
Step-2: Take the interval [x0,x1] and find next value x2=(x0+x2)/2
Step-3: h1=x1-x0 and h2=x2-x1
Step-4: δ1=f(x1)-f(x0) h1 and δ2=f(x2)-f(x1) h2
Step-5: a=δ2-δ1*h2+h1, b=a×h2+d2, c=f(x2) and x3=x2+-2c/(b±√b2-4ac)
Step-6: Repeat until f(xi)=0 or |f(xi)|≤accuracy. Stop, if the following given case.
o Approximate relative error less than true relative error.
o Er= |(xnew-xold)/xnew)|*100%, ( Approximate relative error)
o Et= |(xnew-xold)/xnew)|*100, (true relative error)
o Up to the given of approximate relative error.
o Define function f (xi) leas than tolerance error or true relative error.
o Up to the given of iteration numbers.
Example-1: Find a root of an equation f(x) =x3-x-1 using Muller method, if the
approximation percentage relative error is 0.01861%
Solution:
f(x)=x3-x-1
X 0 1 2
f(x) -1 -1 5
x0=1
x1=2
x2=(1+2)/2=1.5
1st iteration:
f(x0)=f(1)=13-1-1=-1
f(x1)=f(2)=(2)3-2-1=5
f(x2)=f(1.5)=(1.5)3-1.5-1=0.875
h1=x1-x0=2-1=1
h2=x2-x1=1.5-2=-0.5
δ1=f(x1)-f(x0)h1=5—1*1=6
δ2=f(x2)-f(x1)h2=0.875-5*-0.5=8.25
a=δ2-δ1*h2+h1=8.25-6*-0.5+1=4.5
b=a×h2+ δ2=4.5×-0.5+8.25=6
c=f(x2)=0.875
x3=x2+-2c/(b±√b2-4ac)
x3=x2+-2c/(b+sign(b)√b2-4ac)=1.5+-2×0.875/(6+√62-4×4.5×0.875)=1.5+-1.75/(6+√20.2
5)
=1.5+-1.756+4.5=1.33333
Relative percent error
ɛa1=|(x3-x2)/x3|×100%=|(1.33333-1.5)1.33333|×100%=12.5%
x0=x1=2
x1=x2=1.5
x2=x3=1.33333 is not the root of an equation
2nd iteration:
f(x0)=f(2)=(2)3-2-1=5
f(x1)=f(1.5)=(1.5)3-1.5-1=0.875
f(x2)=f(1.33333)=(1.33333)3-1.33333-1=0.03704
h1=x1-x0=1.5-2=-0.5
h2=x2-x1=1.33333-1.5=-0.16667
δ1=f(x1)-f(x0)*h1=0.875-5*-0.5=8.25
δ2=f(x2)-f(x1)*h2=0.03704-0.875*-0.16667=5.02778
a=δ2-δ1*h2+h1=5.02778-8.25*-0.16667±0.5=4.83333
b=a×h2+ δ2=4.83333×-0.16667+5.02778=4.22222
c=f(x2)=0.03704
x4=x2+-2c/(b±√b2-4ac)
x4=x2+-2c/(b+sign(b)√b2-4ac)
=1.33333+-2×0.03704/(4.22222+√4.222222-4×4.83333×0.03704)
=1.33333+-0.07407/(4.22222+√17.11111)
=1.33333+-0.07407/(4.22222+4.13656)=1.32447
Relative percent error
ɛa2=|(x4-x3)/x4|×100%=|(1.32447-1.33333)/1.32447|×100%=0.66908%
x0=x1=1.5
x1=x2=1.33333
x2=x3=1.32447 is not the root of an equation
3rd iteration:
f(x0)=f(1.5)=(1.5)3-1.5-1=0.875
f(x1)=f(1.33333)=(1.33333)3-1.33333-1=0.03704
f(x2)=f(1.32447)=(1.32447)3-1.32447-1=-0.00105
h1=x1-x0=1.33333-1.5=-0.16667
h2=x2-x1=1.32447-1.33333=-0.00886
δ1=f(x1)-f(x0)*h1=0.03704-0.875*-0.16667=5.02778
δ2=f(x2)-f(x1)*h2=-0.00105-0.03704*-0.00886=4.29796
a=δ2-δ1*h2+h1=4.29796-5.02778*-0.00886±0.16667=4.1578
b=a×h2+d2=4.1578×-0.00886+4.29796=4.26112
c=f(x2)=-0.00105
x5=x2+-2c/(b±√b2-4ac)
x5=x2+-2c/(b+sign(b)√(b2-4ac)
=1.32447+-2×-0.00105/(4.26112+√4.261122-4×4.1578×-0.00105)
=1.32447+0.0021/(4.26112+√18.17461)=1.32447+0.0021/(4.26112+4.26317)=1.32472
Approximation relative percent error
ɛa3=|(x5-x4)/x5|×100 %=|( 1.32472-1.32447)/1.32472|×100%=0.01861%, x5=1.32472 is
the root of an equation
