You are on page 1of 5

NUMERICAL METHODS – SOLVING FOR ROOTS

I. NEWTON RAPHSON METHOD

- The Newton Raphson Method (also known as Newton’s method) is a way

to quickly find a good approximation for the root of a real-valued function

f(x).

- A calculus base and one of the most popular root solving methods

Algorithm

1. Assume (x)

2. Evaluate f(x)

3. Evaluate f’(x)

4. Δx= f(x)/f’(x)

5. Xnew= (x – Δx)

6. Repeat the process until the value of X is equal to the real roots.

Example: x3-2x-5=0 (2-3) => limitations Real Roots: 2.094551482

I X f(x) f’(x) Δx

1 2 -1 10 -0.1

2 2.1 0.06 11.23 5.43187889x10-3


3 2.094568121 1.85722010x10-4 11.16164684 1.66393618x10-5

4 2.094551482 5.10828x10-9 11.16143773 4.57672221x10-4

II. FALSE-POSITION METHOD

- The False-Position Method is a modification on the bisection method: if it

is known that the root lies on (a,b), then it is reasonable that we can

approximate the function on the interval by interpolating the points

(a,f(a))and (b,f(b)).

𝑎 𝑓(𝑏)− 𝑏 𝑓(𝑎)
C= 𝑓(𝑏)− 𝑓(𝑎)

Example: x3 + 4x2 – 10 = 0 (1-2) limitation Real Roots: 1.365230613

i a b c f(c)

1 1 2 1.263157895 -1.60227438

2 1.2315789 2 1.338827839 -0.4303647452

3 1.338827839 2 1.358546342 -0.1100087878

4 1.358546342 2 1.36354744 -0.02776209169

5 1.36354744 2 1.364807032 -6.983412542x10-3

(until 16th iterations )


III. BISECTION METHOD

- A numerical method in mathematics to find a root of a given function.

- Is a successive approximation method that narrows down an interval that

contains a root of the function f(x).


𝑎+ 𝑏
X= 2

F(x) is (+); x = b

F(x) is (-); x = a

Example: x3 – 2x – 5 = 0 (2 – 2.25) limitations Real Roots: 2.094551482

I a b X f(x)

1 2 2.5 2.25 1.890625

2 2 2.5 2.125 0.345703125

3 2 2.125 2.0625 -0.35131835944

4 2.0625 2.125 2.09375 -0.8441650391x10-3

5 2.09375 2.125 2.109375 0.1668357849


IV. INCREMENTAL SEARCH METHOD

- Is a numerical method that is used when is needed to find an interval

of two values of “x” that is meant to contain at least one root.

- The Incremental search method starts with an initial X and a Delta X.

This Delta X are the increments that will be used starting from 1, 0.1,

0.01, 0.001 ( add zeros) until the real roots will be obtained.

Example: x3 – 2x – 5 = 0 (2-3) limitations Roots: 2.094551482

I ∆X x f(x) x + ∆X f(x + ∆X) [f(x)] [f(x + ∆X)]

1 1 2 -1 3 16 -

2 1 3 16 4 31 +

3 0.1 2 -1 2.1 0.061 -

4 2.1 0.061 2.2 1.248 +

5 0.01 2 -1 2.01 -0.899 +

6 2.01 -0.899 2.02 -0.7975 +

7 2.02 -0.7976 2.03 -0.694573 +

8 2.03 -0.694573 2.04 -0.590336 +


9 2.04 -0.590336 2.05 -0.484875 +

Increments to be used for Finding the Real Roots

1
0.1
0.01
0.001
0.0001
0.00001
0.000001
0.0000001
0.00000001
0.000000001
0.0000000001

You might also like