CIVAMAT

Roots of Algebraic and

Transcendental
Equations
 Introduction
The following numerical methods for solving
roots of algebraic and transcendental equations
with one independent variable, x will be presented:
Incremental Search Method
Bisection Method
False Position Method
Secant Method
Newton Raphson Method
Newtons Second Order Method
http://www.youtube.com/watch?v=nRbsfnUftT4&feature=results_video&pl
aynext=1&list=PL0FDE9DBA1FB4FB02

http://www.youtube.com/watch?v=Qwyjgm
qbR9s

http://www.youtube.com/watch?v=OzLN5_
DGI5o
Newton Raphson Method
an iterative process which follows a set
guideline to approximate one root,
considering the function, its derivative, and
an initial x-value.
may be used even if the interval is not known
it can only be used if the first derivative F(x)
can be evaluated
Newton Raphson Method
Procedure
1. Start with an initial guess of the root, say x1.
2. Compute F(x1) and F(x1).
3. Compute x2:

4. Check the absolute value of the difference

between (x1 x2) < error
a. If the difference < error, then x2 is the root.
b. If the difference not less than the error, then replace x1
by x2, and repeat steps 2 and 3.
5. STOP when 4(a) is satisfied.
Newton Raphson Method
Newton Raphson Method
The Newton-Raphson method works most of
the time if your initial guess is good enough.
Occasionally it fails but sometimes you can
make it work by changing the initial guess.
Pitfalls:
Division by zero
Root jumping
Oscillations near local maxima or minima
Inflection point issues method may start
diverging from the root but may then start
converging back to the root
Division by zero
Root jumping
Inflection point issues

An inflection point is a point on a curve at which the sign of

the curvature (i.e., the concavity) changes.
Oscillations near local maxima
or minima
 Example
Solving for the root of F(x) = x3 14x2+ 59x 70 = 0 using Newton Raphson
method (initial guess = 0.0)
x1 F(x1) F'(x1) x2 Abs(x1-x2)
0.00000 -70.00000 59.0000 1.18644 1.18644068

1.18644 -18.03690 30.0026 1.78762 0.60117811

1.78762 -3.55614 18.5334 1.97950 0.19187741

1.97950 -0.31093 15.3293 1.99978 0.02028328

1.99978 -0.00331 15.0035 2.00000 0.0002205

2.00000 0.00000 15.0000 2.00000 2.5932E-08

 Example
Solving for the root of F(x) = x3 14x2+ 59x 70 = 0 using Newton Raphson
method (initial guess = 4.0)
x1 F(x1) F'(x1) x2 Abs(x1-x2)
4.00000 6.00000 -5.0000 5.20000 1.2

5.20000 -1.15200 -5.4800 4.98978 0.21021898

4.98978 0.06142 -6.0201 4.99998 0.01020199

4.99998 0.00010 -6.0000 5.00000 1.6992E-05

5.00000 0.00000 -6.0000 5.00000 4.8137E-11

 Example
Solving for the root of F(x) = x3 14x2+ 59x 70 = 0 using Newton Raphson
method (initial guess = 10.0)
x1 F(x1) F'(x1) x2 Abs(x1-x2)
10.00000 120.00000 79.0000 8.48101 1.51898734
8.48101 33.41237 37.3144 7.58558 0.89542888
7.58558 8.45700 19.2269 7.14573 0.43985243
7.14573 1.60907 12.1040 7.01279 0.13293772
7.01279 0.12908 10.1796 7.00011 0.01268066
7.00011 0.00113 10.0016 7.00000 0.00011295
7.00000 0.00000 10.0000 7.00000 8.9314E-09
Newtons Second Order Method
This method has the advantage of converging
rapidly to a solution, and an extremely close
approximation of the value of the root may be
obtained with a minimum number of iterations.
Procedure
1. Start with an initial guess of the root, say x1.
2. Compute F(x1), F(x1) and F(x1).
3. Compute x2:

4. Check the absolute value of the difference

between (x1 x2) < error
a. If the difference < error, then x is the root.
2
b. If the difference is not less than the error, then
replace x1 by x2, and repeat steps 2 and 3.
5. STOP when 4(a) is satisfied.
THE END
QUESTIONS?
http://www.youtube.com/user/numericalmethodsguy#p/u
http://numericalmethods.eng.usf.edu/